Amazon Interview Report
- 1of 1 vote
AnswersFind your own method to balance an unbalanced binary tree.(you must not use existing methods like AVL, red black or b trees)
- suresh March 05, 2014 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 Data Structures - 0of 0 votes
AnswersThere is a file which contains N words. There may be M anagrams in that file, K words on each anagrams. K>=1, M>=1, N>=1. You need to write an algorithm which will create one list for each anagram with k words and group all M lists with one data structure
- suresh March 05, 2014 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 Data Structures
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.