abhishek27.kumar
I am Abhishek Kumar Verma persuing master degree from National Institute Of Technology Durgapur (INDIA). and i love to solve problem related to algorithms . i am a fun loving guy and i feel fun in coding .
I am Abhishek Kumar Verma persuing master degree from National Institute Of Technology Durgapur (INDIA). and i love to solve problem related to algorithms . i am a fun loving guy and i feel fun in coding .
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.
i hope these lines are gud enough to explain what r u looking for and pls go through all the language and code which i have given ..
- abhishek27.kumar September 26, 2012What is the time complexity of this algorithm? Well, if a node is at level r, we do r amount
of work (that’s in the looking “up” step). We can take a guess at O(n lg n) (n nodes, doing an
average of lg n amount of work on each step), or we can be super mathematical:
There are 2^r nodes at level r.
1*2^1 + 2*2^2 + 3*2^3 + 4*2^4 + ... d * 2^d