Interested to Buy Any Domain ? << Click Here >> for more details...
Memory is not a constraint. In a single iteration(NOTE: you
can't go back), how will you find out the 10th last
node/item in a linked list.
- 16 Answers
- 27772 Views
- BNB, FDS, Goldman Sachs, Nagarro, I also Faced
- E-Mail Answers
Answer Posted / ashutosh
Assume the list is a circular one (implemented by pos%10).
So, when you are iterating, you are going round and round in
a circle. When you reach the end, you just have to go back
exactly 10 items. By going back here means accessing the
element 10 position prior to the current one, which is
implemented by (pos-10)%10
Since, it's a circular array as assumed, you have always
access it by doing pos%10 or (pos-10)%10.
NOTE: The value of pos has always been incremented and never
decremented or set to zero.
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What are friend functions in C++?
What is the difference between the indirection operator and the address of oper-ator?
What is #include math h in c++?
Does c++ have finally?
Explain how an exception handler is defined and invoked in a Program.
What is a float in c++?
How can we check whether the contents of two structure variables are same or not?
Can you pass an array to a function in c++?
What is c++ hash?
Does c++ have string data type?
Explain linear search.
How the virtual functions maintain the call up?
What are the various oops concepts in c++?
what is Member Functions in Classes?
Why struct is used in c++?
