Microservices vs Monolith: Pros, Cons & Real‑World Trade‑offs

Friend Circles | DFS Graph Solution | Coding Interview | java | python

LeetCode 721 - Accounts Merge Explained | Depth First Search (DFS) Approach

LeetCode 721: Accounts Merge | Disjoint Set Implementation with 4-Step Breakdown & Code Walkthrough

LeetCode 1752: Comprehensive Guide with 4 Approaches to Check if Array Is Sorted and Rotated - Java

HackerRank Roads and Libraries - Solving with Union Find (Disjoint Sets) |Java Coding Interview Prep

Leetcode 547: Solving Number of Provinces Using Union Find, DFS & BFS - Graph Algorithm

Disjoint Set ( Union Find) - Path Compression - Union by Size - Union By Rank - Java

Number of Islands: Solution using both BFS and DFS - Leetcode 200 - Array - Matrix - BFS - DFS

Flood Fill - Leetcode 733 - Depth First Search - Breadth First Search - Matrix - Java

Subarray Sum Equals K: Efficient Solution - Leetcode 560 - Array - Prefix Sum

Range Sum Query Immutable - Leetcode 303 - Array - Prefix Sum

Binary Tree Level Order Traversal: with Visual Understanding - Leetcode 102 - Binary Tree - BFS

Valid Parenthesis Efficient Solution with Visual Understanding - Leetcode 20- ArrayDeque - Java

Search in sorted rotated array - Leetcode 33 - Modified Binary Search - Java

Group Anagrams - Leetcode 49 - HashMap - Java

Design a Thread Safe Connection Pool - Object Oriented Design Interview Preparation - Java

Design a HashMap - Object Oriented Design Interview Preparation - Leetcode 706 - Java

Design and implement a Call Center - Object Oriented System Design Interview Preparation - Java

Design and Implement a Parking Lot - Object Oriented System Design Interview Preparation - Java

Implement LRU Cache - Object Oriented System Design Interview Preparation - Leetcode 146 - Java