Arrays:Binary search,Sorting,sliding window,2 pointer, prefix sum, stacks,Greedy,DPQuestions:704. Binary Search (E)74. Search a 2D Matrix(M)153. Finding Minimum in a sorted array(M)33. search in a rotated array(M)4. Median of two sorted arrays…
Resources: https://medium.com/@shivambhadani_/system-design-for-beginners-everything-you-need-in-one-article-c74eb702540b [Super Awesome👆] https://workat.tech/machine-coding/practice https://www.youtube.com/playlist?list=PLMCXHnjXnTnvo6alSjVkgxV-VH6EPyvoX https://codewitharyan.com/system-design/low-level-design https://github.com/lavakumarThatisetti/Machine-Coding-Round
Cleared Google and Meta after 5 months of grind [L5 Offer] I've been meaning to write this for quite some time and finally got to it today. This is me…
Staff Engineer offer - how I prepared and interview experience Got offer from Reddit for the staff engineer role for their infra (Remote, US). I have ~6 YOE. This was…
Ask for clarifications on user input, constaints….etc Discuss multiple approaches and trade-offs (i.e discussed a brute force solution and its time complexity as well as an improvement and the new…
-----Question 1: Design a Distributed Metrics Logging and Aggregation SystemCompany(s) asked: Google, Facebook, Amazon, eBay, Datadog, Atlassian-----Question 2: Design a Distributed Stream Processing System like KafkaCompany(s) asked: Amazon, Microsoft, Wise,…
⸻ Tree Answers Basic Questions 1. What is the difference between a binary tree and a binary search tree (BST)? • A binary tree is a tree where each node…
CategoryPatterns# QuestionsEasyMediumHardComplexity (Avg Case)ArraysSliding Window, Two Pointers, Prefix Sum18594O(N) - O(N log N)StringsHashing, Two Pointers, Sliding Window14473O(N)Linked ListFast & Slow Pointers, Recursion10352O(N)Stacks & QueuesMonotonic Stack, LRU Cache12273O(N)Binary SearchSearch Space Reduction,…
🚀 NeetCode 150 - Priority-Based Study Roadmap This roadmap is structured priority-wise, optimizing for FAANG interviews. It assumes 2-3 hours of practice per day and categorizes topics into high-priority, mid-priority,…
Optimization TechniqueUsed ForTime Complexity ImprovementSpace Complexity ImprovementExplanationSpace Optimization (In-Place Computation)Modify array in-place (e.g., Remove Duplicates)No changeO(N) → O(1)Modifies input data without extra space to save memory. Used in in-place sorting,…