Share a problem that you failed to solve in an onsite recently
Frog jump at google with optimum solution I saw it on leetcode but didn’t solve it before onsite
Sorting an array such that the sum of the adjacent elements is a perfect square.
Given a grid of letters and a dictionary, find the largest set of dictionary words appearing in the grid, such that no words overlap. I had the idea but coding it up is tricky
Runlength encoding without using extra space
Filter Fibonacci numbers from a list of non-negative integers. For example: Given [2,17,1,13,11], output: [2,1,13]. I gave an idea to solve it but couldn't complete the code.
Iterative post order binary tree traversal in 35 mins.
For this question, did they ask to do in O(1) space?
You can’t do it in O(1) space unless you’re doing a Morris traversal, which is kind of cheating since it modifies the tree and restores it as it goes. The typical solution for this is to use a stack and node pointer.
Level order traverser iterative
What the hell is interactive?
Means?
P vs NP
Kth smallest element from two sorted arrays in logarithmic time , const space
Vertical order traversal
At G?
Same here.