Leetcode 448. Find All Numbers Disappeared in an Array [ Solution + Code Explained]

Описание к видео Leetcode 448. Find All Numbers Disappeared in an Array [ Solution + Code Explained]

One of the most frequently asked coding interview questions on Array in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe etc.

LeetCode : Climbing Stairs

Question : Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

Example:

Input:
[4,3,2,7,8,2,3,1]

Output:
[5,6]


Connect with me on LinkedIn at:   / jayati-tiwari  

Комментарии

Информация по комментариям в разработке

Похожие видео