There was an error while loading. Please reload this page.
#2017
#SoftwareDevelopmentEngineer
#Experienced-1Year
Round 1:
Round 2 (Behavioral):
Round 3 (DS/PS):
What is the total number of binary search trees given n keys.
Given 2d matrix with gold at one cell and bombs in some and 4 miners coming from 4 extreme ends, who'll reach the gold first
Sort an array of 0s, 1s and 2s.
Round 4 (DS/PS):
Find the largest sum contiguous subarray.
Given dictionary, create a DS such that you can find the max length word for given prefix. (Trie)
Print all root to leaf nodes of a given binary tree.
Round 5 (Hiring Manager):