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
- 27356 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 the uses of c++ in the real world?
If you hear the cpu fan is running and the monitor power is still on, but you did not see anything show up in the monitor screen. What would you do to find out what is going wrong?
What are the advantages of early binding?
Is there structure in c++?
Explain the volatile and mutable keywords.
Write my own zero-argument manipulator that should work same as hex?
Write a program using display() function which takes two arguments.
How can I learn c++ easily?
How would you use the functions sin(), pow(), sqrt()?
What is pair in c++?
What is a far pointer? where we use it?
What is the difference between passing by reference and passing a reference?
How can you specify a class in C++?
What is the latest c++ version?
What is the c++ code?
