Skip to content

Commit 09eb1d9

Browse files
author
Amogh Singhal
authored
Create Interview_Questions.md
1 parent 86385b1 commit 09eb1d9

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

Interview_Questions.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
## 1. How to find the middle element of a linked list
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.

0 commit comments

Comments
 (0)