apandey846
Comments (1)
Followers (1)
Reputation 10
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.
Hope this solution will also work.
- apandey846 July 13, 2012step 1: Calculate the length of both LinkList , say L1 and L2
step 2: Calculate the difference d, and find out which is longer.
step 3: Traverse the longer List for 'd' number of nodes.
step 4: Now start adding the nodes value of both LinkList and keep the Sum in longer List L1.
step 5: This way longer List L1 will have the its own starting number and Sum of each digit.
step 6: Finally create a function which have 'carry' as Static variable and traverse from end of a linklist using recursion. Use mod function to get the 'carry' part of each node starting from the end. And add this carry to previous node(in recursion). this way carry will propagate in backward direction.
step 7: If the carry still have some value when we come to first node then create a new node and add to the starting of the Linklist.
What say Guys..?