-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 162 (Intern)
pkkp86nitd edited this page Aug 31, 2019
·
1 revision
"Technical Round :(F2F ,After Qualifying Online Round)
- Question 1 : How to sort a linked list which is already sorted by absolute values in time complexity O(N) and space complexity O(1).
- Question 2 : How to find the total number of islands in a 2-D array, Where 1 represents land and 0 represents water.
- Question 3 : How to detect whether a given binary tree is a full tree.
- Question 4 : Connect nodes at the same level in a binary tree via a "next" link.
- Question 5 : Find if a palindrome can be made by any anagram of a string.
- Question 6 : Divide a circular linked list into two equal circular linked lists(when size of the circular linked list is odd make the 1st divided circular linked list with one extra node).
"