Iterate over the two linked lists and add leading zeros in case one list has fewer digits than the other. Start at the top node of both lists and call the recursive function on the next node. Continue to the end of the list. Creates a node for the sum of the current number of digits and returns the carry.
the question was fizz buzz.
data structures and algorithm, dynamic programmig, lld
How did you resolve complex issue with simple solution
It's All about previous experience and mostly related to tools and new technology approach and
The dependency sequence.
there are a bunch of distinctive numbers with only one pair of duplicates. find the odd ones
How many data points did the application you work with return?
Talk about your research
Are you familiar with hash tables or Maps in Java?
Viewing 3191 - 3200 interview questions