Commit b5d671b

author

Amogh Singhal

authored

Update Interview_Questions.md

1 parent 09eb1d9 commit b5d671bCopy full SHA for b5d671b

File tree

-0

lines changed

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,2 +1,5 @@`
`1`	`1`	`## 1. How to find the middle element of a linked list`
`2`	`2`	Solution: Start with two pointer `p` and `q`. For every second iteration of `p`, iterate `q`. When `p` reaches the end of the linked list. `q` will be in the middle of the list.
	`3`	`+`
	`4`	`+## 2. How to find the loop or cycle in a linked list`
	`5`	+Solution: Start with two pointer `p` and `q`. For every second iteration of `p`, iterate `q`. If `p` and `q` are pointing to the same node, there is a loop or cycle present.

Comments

(0)