We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e385f1f commit 53e4164Copy full SHA for 53e4164
README.md
@@ -1,7 +1,11 @@
1
# Python-DataStructure-and-Algorithm
2
-
3
4
-linkedlist_nth_to_lastnode.py
5
+## linkedlist_nth_to_lastnode.py
6
Q: find the nth element from last node of a given linked list.
7
If nth value is greater than given linked list then through back LookupError.
+
+## LinkedList_CycleCheck.py
+Q: check for cycle in give given linked list if exist return True else False.
8
+ - 1 --> 2 --> 3 --> 1
9
+ - __True__
10
+ - 1 --> 2 --> 3 --> None
11
+ - __False__
0 commit comments