How do you find out if a linked-list has an end? (i.e. the list is not a cycle)
Submitted by: AdministratorYou can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle.
Submitted by: Administrator
Submitted by: Administrator
Read Online C++ Programming Job Interview Questions And Answers
Top C++ Programming Questions
| ☺ | What does extern mean in a function declaration in C++? |
| ☺ | Write a short code using C++ to print out all odd number from 1 to 100 using a for loop |
| ☺ | What is C++? |
| ☺ | How many ways are there to initialize an int with a constant? |
| ☺ | Explain the ISA and HASA class relationships. How would you implement each in a class design? |
Top Coding/Programming Categories
| ☺ | Python Interview Questions. |
| ☺ | OOP Interview Questions. |
| ☺ | Software engineering Interview Questions. |
| ☺ | PHP Interview Questions. |
| ☺ | VBA (Visual Basic for Applications) Interview Questions. |
