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
- 25362 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 it possible to provide special behavior for one instance of a template but not for other instances?
What are features of c++?
What is c++ library?
What operator is used to access a struct through a pointer a) >> b) -> c) *
what is data encapsulation in C++?
What is the two main roles of operating system?
How do you import payscale data from non SAP to SAP?is it through LSMW or any other way is there?
an operation between an integer and real always yeilds a) integer result b) real result c) float result
What is a constructor and how is it called?
What is std :: flush?
What is an adaptor class in c++?
Does a derived class inherit or doesn't inherit?
What is the difference between an enumeration and a set of pre-processor # defines?
What is auto type c++?
What is main function in c++ with example?
