@prakhar-srv

Prakhar Srivastava

@prakhar-srv

Website

London, UKJoined May 2026

About

Nothing here yet.

Available for

Nothing here yet.

Prakhar Srivastava's blogs

codeintuitioncodeintuition.hashnode.dev13 posts

Articles Threads Comments2

Recently published

PSPrakhar Srivastavacodeintuition.hashnode.dev

Big O Notation Explained: Growth Rate, Not Operation Count

1d ago · 9 min read · You've read three Big O articles this week. You can recite that hash map lookups are O(1) amortised, that merge sort is O(n log n), that nested loops are O(n²). Then your interviewer writes a function

Join discussion

PSPrakhar Srivastavacodeintuition.hashnode.dev

BFS vs DFS: How to Pick the Right Graph Traversal

1d ago · 5 min read · You run a graph traversal, it visits every node, and the tests pass. Then a problem asks for the shortest path and your answer comes back a few steps too long. Or it asks you to detect a cycle and you

Join discussion

PSPrakhar Srivastavacodeintuition.hashnode.dev

How Backtracking Works: One Skeleton for Every Problem

2d ago · 7 min read · You've written a recursive function before. You can trace a call stack. And yet the first time a problem says "generate all valid combinations of...", the recursion you know how to write doesn't obvio

Join discussion

PSPrakhar Srivastavacodeintuition.hashnode.dev

AVL Trees Explained: Rotations, Balance Factors, and Self-Balancing BSTs

3d ago · 10 min read · You insert [1, 2, 3, 4, 5] into an empty binary search tree and watch every value land to the right of the previous one. The tree is a straight line. Five nodes deep. Searching for 5 walks all five. Y

Join discussion

PSPrakhar Srivastavacodeintuition.hashnode.dev

Amazon vs Google vs Meta: The DSA Patterns Each Company Tests

May 12 · 8 min read · You've drilled sliding window. You've drilled binary search. You've solved Two Sum, Three Sum, and Group Anagrams enough times to write them blindfolded. The next medium that lands in front of you is

Join discussion

Prakhar Srivastava

About

Available for

Prakhar Srivastava's blogs

Recently published

Big O Notation Explained: Growth Rate, Not Operation Count

BFS vs DFS: How to Pick the Right Graph Traversal

How Backtracking Works: One Skeleton for Every Problem

AVL Trees Explained: Rotations, Balance Factors, and Self-Balancing BSTs

Amazon vs Google vs Meta: The DSA Patterns Each Company Tests

Search Hashnode

Prakhar Srivastava

About

Available for

Prakhar Srivastava's blogs

Recently published

Big O Notation Explained: Growth Rate, Not Operation Count

BFS vs DFS: How to Pick the Right Graph Traversal

How Backtracking Works: One Skeleton for Every Problem

AVL Trees Explained: Rotations, Balance Factors, and Self-Balancing BSTs

Amazon vs Google vs Meta: The DSA Patterns Each Company Tests