Compare arrays and linked lists.
01
01
Understand the problem
arrayslinked-list
02
02
Attempt it yourself
Sketch your approach before reading the solution — that's what interviews test.
Stuck? AI Nudge Available
Get a conceptual hint to guide your logic without spoiling the final implementation.
03
03
Study the solution
The solution is waiting
Give it an honest attempt first — then compare your thinking with the full walkthrough.
04
04
Read the code
Singly linked node + traversal
Run Playgroundclass Node:
def __init__(self, val, nxt=None):
self.val = val
self.next = nxt
def get(head, index): # O(n) - must walk
cur, i = head, 0
while cur and i < index:
cur, i = cur.next, i + 1
return cur.val if cur else None
def push_front(head, val): # O(1) - just relink
return Node(val, head)
# --- demo ---
head = Node(10, Node(20, Node(30))) # 10 -> 20 -> 30
print(get(head, 1)) # 20
head = push_front(head, 5)
print(get(head, 0)) # 505
05
Join the discussion
Discussion (0)
Sign in to join the discussion.
No responses yet. Be the first to share what you think.