pranav bhole
Hello, This is Pranav Bhole, I am student of Master of Science in Computer Science at University of Texas at Dallas.
Hello, This is Pranav Bhole, I am student of Master of Science in Computer Science at University of Texas at Dallas.
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
In order to get rid of O(n^2), I came up with the following solution.
- pranav bhole February 07, 20131. Sort the elements in 2D array and store it in 26 buckets with counts.
2. Build the tree of valid words having 26 possible children (A-Z) under each node.
While building this tree, do not add the child which is not present in the buckets.
Also the add only those words in the tree having same letter count present in the buckets. For example 'o' comes 3 times, thus do not add the word in the tree which contains more than 4 'o'.
3. this will create the tree of all significant possible letters which are also included in the valid word list.
4. Traverse and print the tree by following algorithm
A. Visit node and print it till you find the leaf.
B . If you find the leaf print it and go to parent and delete that leaf.
C. Go root node and follow A.