Write a Java program to check if a linked list is circular or cyclic, and how do you find if a linked list contains loop or cycles in Java are some common linked list related data structure interview questionsasked in various Java Interviews. This is some time asked as follow-up question of basic linked list questions like inserting element at beginning, middle and end of linked list or finding length of linked list. In order to solve linked list related algorithmic question in Java, you need to be familiar with concept of singly linked list, doubly linked list and circular linked list. Until stated specifically, most questions are based on singly linked list. For those who are not familiar of linked list data structure, its a collection of nodes. Each node contains two parts data and address, where address part points to another node in linked list. Last node of linked list, often referred as tail points to null. Also a singly list can only move in one direction, towards end. Now, let's come back to this question. Good thing about this question is that, it can also be solved by using two pointer approach discussed in How to find middle element of linked list in single pass. If a linked list contains a loop or cycle it is known as circular or cyclic linked list. As I said we can use two pointer approach to check if a linked list is circular or not.
How to Find if Linked List contains Loops or Cycles in Java Coding Question
Saturday, March 1, 2014
Read more »
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment