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
- 23121 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
Is c++ primer good for beginners?
How do you write a function that can reverse a linked-list?
What are c++ data types?
Is it possible to pass an object of the same class in place of object reference to the copy constructor?
Does improper inheritance have a potential to wreck a project?
Does dev c++ support c++ 11?
Can manipulators fall in love?
Is it possible for the objects to read and write themselves?
Can recursive program be written in C++?
How does atoi function work?
What can I use instead of namespace std?
Difference between overloading vs. Overriding
What is ostream in c++?
What is conditions when using boolean operators?
Does c++ have string data type?
