How to find all duplicates in an array without using extra space?
Given an array of integers, the integers are in the range of 1 ≤ a[i] ≤ n (n = size of array). In this Array, some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
We have to solve this problem without using extra space and in O(n) time complexity.
For Example:
Input: [4, 3, 2, 7, 8, 2, 3, 1]
Output: [2, 3]
Write a code to find all Anagrams in a String. Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.
Both the strings only consist of lowercase English letters. The length of both strings s and p will not be larger than 20,100.
The order of output does not matter.
How to check if two nodes are cousins in a Binary tree.
Given two values x and y, we have to write a code to check the nodes corresponding to values x and y are cousins or not. All the values in this binary tree are unique.
Two nodes of a binary tree are cousins if they have the same depth, but have different parents.
In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.