marie-yau / interview-problems Goto Github PK

I/P [8, 3, 2, [5, 6, [9]], 6]

O/P 8+3+2+2*(5+6+3*(9))+6 => 95

https://www.careercup.com/question?id=5767007794888704

Given two two integer arrays. Find the longest common subsequence.
eg: a =[1 5 2 6 3 7], b = [5 6 7 1 2 3]. return [1 2 3] or [5 6 7]

https://www.careercup.com/question?id=5734546864078848

Given the root of a binary tree, print the nodes column wise and row wise.

..............6
............/....
...........9......4
........../........
.........5....1.....3
.................../
...........0.......7
The answer would be 5 9 0 6 1 4 7 3.

https://www.careercup.com/question?id=5709428993556480

You have two sorted arrays, where each element is an interval. Now, merge the two array, overlapping intervals can be merged as a single one.

I/P :
List 1 [1,2] , [3,9]
List 2 [4,5], [8, 10], [11,12]

O/P [1,2], [3,10], [11,12]

https://www.careercup.com/question?id=5697271283318784

Give you a text file, remove duplicated lines.