#Leetcode
Two Sum Longest Substring Without Repeating Characters Best Time to Buy and Sell Stock LRU Cache Number of Islands Reorganize String Trapping Rain Water Group A
Two Sum Merge Strings Alternately Palindrome Number Trapping Rain Water Median of Two Sorted Arrays Longest Substring Without Repeating Characters 3Sum Merge So
Granular breakdown by subtechnique, focusing on patterns relevant to Amazon🧠 Greedy SubpatternsGreedy for Local Min/Max122. Best Time to Buy and Sell Stock IIG
Two SumBest Time to Buy and Sell StockLRU CacheMaximum Frequency After Subarray OperationNumber of IslandsReorganize StringLongest Palindromic SubstringMaximize
Trapping Rain WaterMerge k Sorted ListsCandyMedian of Two Sorted ArraysMinimum Window SubstringBasic CalculatorLFU CacheConcatenated WordsReverse Nodes in k-Gro
LRU CacheMaximum Frequency After Subarray OperationNumber of IslandsReorganize StringLongest Palindromic SubstringMaximize Y‑Sum by Picking a Triplet of Distinc
Two Sum – HashMapBest Time to Buy and Sell Stock – ArraysReverse Linked List – Linked ListValid Parentheses – StackPalindrome Number – Math/StringFlood Fill – D
A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words be
Many struggle with backtracking because they confuse two fundamental patterns i.e Sequential Decision Making and Choice Generation. The Conversion Funnel: From
🎯 The Real Question: How do I train my brain to see patterns?here's the actual thinking process that happens in senior developers' minds:📖 STEP 1: R
EasyDesign Parking System (87.1%)Make Array Zero by Subtracting Equal Amounts (73.3%)Maximum Units on a Truck (74.3%)MediumLRU Cache (45.2%)Number of Islands (6
1/ Why System Design? I realized that while DSA builds problem-solving skills, System Design teaches how real-world software works:ScalabilityReliabilityPerfor
High Frequency Problems (Sorted by Frequency)https://unisala.com/llm/conversation/87DITfU?leafId=3676cfa1-37c8-4168-8211-df0cd93d07d7🟢 Easy Problems202. Happy
Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.Return any possible rearrangement of&nb
A sort that return a specific order of the vertex of a given a graph as long as the graph satisfies certain condition. This is a simple algorithm to learn.First
Easy (35/288)Two SumPalindrome NumberRoman to IntegerLongest Common PrefixValid ParenthesesMerge Two Sorted ListsRemove Duplicates from Sorted ArrayRemove Eleme
EasyKids With the Greatest Number of CandiesMediumThe kth Factor of nOptimal Partition of StringLowest Common Ancestor of a Binary Tree IVMinimum Swaps to Group
Google Spring' 23 High FrequencyGuess the Word (Hard)Reconstruct Itinerary (Hard)Finding the Number of Visible Mountains (Medium)Largest Color Value in a Direct