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
- 27852 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 is :: operator in c++?
Is python written in c or c++?
What are built-in functions? What is the syntax for the definition?
Can java be faster than c++?
Describe new operator?
What are the various oops concepts in c++?
When should we use multiple inheritance?
What is virtual destructor ans explain its use?
When should you use global variables?
Give an example of run-time polymorphism/virtual functions.
Define what is constructor?
Are vectors faster than arrays?
Explain about Garbage Collector?
Which software is best for programming?
What is the best free c++ compiler for windows?
