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
- 27209 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 the difference between the compiler and the preprocessor?
Why was c++ created?
What are the advantages of early binding?
Would you rather wait for quicksort, linear search, or bubble sort on a 200000 element array? (Or go to lunch...) a) Quicksort b) Linear Search c) Bubble Sort
What are virtual constructors/destructors?
What is the best c++ compiler for windows 10?
How much maximum can you allocate in a single call to malloc()?
How did c++ get its name?
What is the output of the following program? Why?
What are the benefits of pointers?
How to declare a function pointer?
Which programming language should I learn first?
Name the implicit member functions of a class.
What is ostream in c++?
When we use Abstract Class and when we use Interface?where we will implement in real time?
