Solving Sorted Array Coding Challenges

⚡ Binary Search is NOT just about finding an element in a sorted array. In competitive programming & interviews, binary search shows up in many disguises. Here’s a complete map of Binary Search problem types you should master 👇 🔹 1. Classic Binary Search Search in a sorted array. Variants: first/last occurrence, count of elements ≤ X. Example: Find position of target in sorted array. 🔹 2. Answer / Decision Binary Search When the answer lies in a monotonic range. If f(x) is True → all larger (or smaller) values are True. Example: Minimum capacity of ship to transport packages in D days. Pattern: while (low < high) { mid = (low+high)/2; if (check(mid)) high=mid; else low=mid+1; } 🔹 3. Binary Search on Real Numbers (Precision Search) Used when searching on continuous values (floats). Stop after fixed iterations (like 100) or until high - low < eps. Example: Find square root of N with precision 1e-6. 🔹 4. Binary Search on Answers with Feasibility Function Problems where you ask: “Is it possible with X?” If yes → try smaller X, else larger. Example: Aggressive cows (placing cows in stalls with max distance). 🔹 5. Binary Search inside DP / Greedy Used to optimize transitions. Example: Longest Increasing Subsequence (patience sorting) → O(n log n). Example: Weighted interval scheduling (binary search on compatible jobs). 🔹 6. Binary Search on Prefix/Suffix Often combined with prefix sums or hashing. Example: Find longest prefix with sum ≤ X. Example: Find longest substring that is a prefix of another string. 🔹 7. Binary Search + Geometry Real-life optimization, distances, areas. Example: Find minimum radius of circle to cover all points. Example: Maximize height of water level without overflow. 🔹 8. Implicit Binary Search (Search Space Not Explicitly Stored) When array is not built, but you can compute A[mid] in O(1). Example: Kth smallest element in multiplication table. Example: Kth number in union of sorted sequences. 🔹 9. Binary Search on Functions (Ternary/Quasi Binary) When function is unimodal (increase → peak → decrease). Example: Find maximum profit day. (Technically ternary search, but many treat it under binary search family). 🔥 Key Insight: Binary Search is really about searching in monotonic spaces — whether that’s indices, values, functions, or answers. If you master all 9 patterns above, you’ll crack 90% of CP & interview problems where binary search appears in disguise. Stay tuned for more such content!! ✌🏻🚀

A crucial problem-solving technique for coding interviews is the "Case Analysis". With hard problems, you often don't know where to start. But what you CAN do is sort the inputs into cases and tackle each case one by one. Take the problem of finding the minimum in a sorted, rotated array with duplicates (a LeetCode hard, linked below). The array could look like [4, 5, 6, 1, 3, 3, 4], and we should return 1. My first thought was to apply binary search (given the trigger: sorted array), but the presence of duplicates gave me pause. Imagine we check the midpoint, and we find... [4, ?, ?, 4, ?, ?, 4] It's unclear whether we should go left or right. To get unstuck, I did a Case Analysis. My intuition was that the relationship between the first and last elements is important, so I classified the inputs based on that: ➤ Case 1: first < last ➤ Case 2: first > last ➤ Case 3: first = last Tackling each of these cases individually is a lot less daunting. ➤ Case 1: first < last We have something like [1, ?, ..., ?, 10]. We must realize that the array is not rotated at all; the elements after the rotation point can never be greater than the first element (an array like [1, 2, 3, 0, 10] is impossible). So, for Case 1, we simply return the first element in O(1) time. ✅ ➤ Case 2: first > last This allows us to binary search for the rotation point. We can define the 'before' region as elements >= first, and the 'after' region as elements < first. Then we binary search for the transition point and return the first element in the 'after' region. This binary search takes O(log n) time. ✅ (Blog post about finding transition points linked below.) ➤ Case 3: first = last Zoning in on this Case led me to come up with a worst-case input: Imagine that the sorted array, before the rotation, is this: [0, 1, 1, 1, 1, 1, ...., 1]. After the rotation, this ends up looking like an array with all 1's, except a 0 at a random position. You can't binary search for that! For this input, NO algorithm can do better than a O(n) linear scan. ❌ We could then pivot the conversation to perhaps improving the average runtime for Case 3. LeetCode is not all about memorizing answers. Interviewers want to see strategic problem-solving like this.

During my Meta DSA rounds, I used arrays. During my Google DSA rounds, I used arrays. During my Amazon DSA rounds, I used arrays. At each company I interviewed, especially in the DSA rounds, I've used two pointers a lot.  When you get used to it, you unlock solutions to dozens of common problems. Here's everything you need to know about two pointers: ↳ What It Is: Two pointers is a technique where you maintain two references to positions in a data structure, usually an array or string. You move these pointers based on specific conditions to solve the problem efficiently. It transforms O(n²) brute force solutions into O(n) linear time. ↳ When To Use It – You're working with sorted arrays or strings. – The problem asks about pairs, triplets, or subarrays. – You need to find elements that meet certain conditions. – You're dealing with palindromes or string reversal. – You need to remove duplicates or partition data. ↳ Core Patterns 1. Opposite Ends (Converging) Start one pointer at the beginning, one at the end. Move them toward each other based on conditions. Perfect for: Two Sum (sorted), container with most water, valid palindrome. Example: Finding pairs that sum to a target in a sorted array. 2. Same Direction (Fast and Slow) Both pointers start at the same position. One moves faster than the other. Perfect for: Removing duplicates, detecting cycles, finding middle element. Example: Remove duplicates from sorted array in place. 3. Sliding Window One pointer marks the window start, the other marks the end. Expand or contract the window based on conditions. Perfect for: Longest substring problems, maximum sum subarrays, minimum window. Example: Longest substring without repeating characters. 4. Partition (Dutch National Flag) Use multiple pointers to partition data into sections. Common in sorting and array rearrangement problems. Perfect for: Sort colors, move zeros, partition arrays. Example: Move all zeros to the end while maintaining order. ↳ Practice Problems (Easiest to Hardest) Beginner: - Valid Palindrome - Remove Duplicates from Sorted Array - Move Zeroes - Reverse String Intermediate: - Two Sum II (sorted array) - Container With Most Water - 3Sum - Sort Colors Advanced: - Trapping Rain Water - Minimum Window Substring - Longest Substring Without Repeating Characters - Subarray Product Less Than K

How I Solved 300+ Array Problems: The Secret is Pattern Recognition, Not Memorisation I spent 6 months grinding 300+ array problems. Here's what nobody tells you: It's not about memorising solutions; it's about seeing patterns. I talk to so many QAs who could test code perfectly but froze when writing it. The problem wasn't coding ability—it was a lack of pattern recognition. Most people fail because they: Read → Panic → Google → Copy → Move on. After 100 problems, they still can't solve the 101st. The 7 Patterns That Solve 90% of Array Problems Instead of 100 random solutions, learn these 7 core concepts: - Two Pointers: When you see sorted arrays, pairs, or reversing, think: Pointers from both ends. Reduces O(n2) to O(n). - Sliding Window: For subarrays, substrings, or k-size windows, think: Maintain a window and slide it. Turns nested loops into a single pass. - Prefix Sum: When you need range queries or subarray sums, think: Precompute cumulative sums. Trades O(n) space for O(1) queries. - HashMap for O(1) Lookup: For finding pairs, checking existence, or frequency counting, think: Store what you've seen. Eliminates nested loops. - Kadane's Algorithm: When you need the maximum subarray/contiguous elements, think: Track the running sum. Dynamic programming made simple. - In-Place Manipulation: When the constraint is "without extra space" or "rearrange," think: Swap instead of copy. Space complexity from O(n) to O(1). Sort + Greedy: For intervals, meeting rooms, or merging, think: Will sorting reveal the pattern? Simplifies complex logic. The Real Challenge & Your Action Plan: The hardest part isn't learning the patterns—it's knowing WHICH pattern to use WHEN. Example: "Find two numbers that sum to target in a sorted array." ❌ Brute Force is O(n2). ✅ Pattern Recognition: Sorted Array + Pairs → Two Pointers. The solution becomes obvious. Stop grinding random problems. Instead: - Week 1-2: Master one pattern at a time. - Week 3-4: Mix them up and build recognition speed. Solve 30 problems deeply across these 7 patterns, not 100 randomly. Arrays aren't hard; they teach you how to think in patterns. This skill transfers to Strings, Linked Lists, and Trees—it's the foundation of development. Start by spending 20 minutes thinking about the pattern before jumping to the code. I stopped solving problems. I started solving patterns. That’s the only difference. -x-x- Want to crack your next SDET Coding Interview?: https://lnkd.in/ggXcYU2s #japneetsachdeva

Solve this self-testing DSA cheatsheet with 13 groups of patterns & 65 problems to check whether you’re ready for FAANG-level DSA rounds in 2026. On-site interviews are making a comeback at many companies, so I’ve spent 30+ hours collecting these problems from real interviews at Amazon, Uber, Flipkart, JP Morgan, DE Shaw, and many other FAANG+ companies. The goal should be to do this:  - Take any 2 random problems - Set a 45-minute timer, simulate interview conditions - See how far you get, after 45 mins, check where you fell short.  - Improve the gaps in your preparation and improve for the better Btw, this cheatsheet is based on my DSA Pattern system: https://lnkd.in/g94khGEh. I’ve just released a new version where, now, we have:  -50+ videos (15+ hours), all recorded by me -Built-in code editor + AI assisted feedback also built-in -Personal notes, patterns, code & solutions all stored in one place Back to the cheatsheet: [1] Arrays and Hashing Basics - Problems: Two Sum, Product of Array Except Self, Contains Duplicate, Majority Element, Sort Colors - Keywords: hash map, frequency, prefix product, counting, in place - Trigger: Use when the question talks about counts, presence, or rearranging array values without complex rules. [2] Two Pointer Techniques - Problems: 3Sum, Container With Most Water, Move Zeroes, Remove Duplicates from Sorted Array, Valid Palindrome - Keywords: left right pointers, shrinking range, swapping, partitioning - Trigger: Use when you can sort or already have sorted data and need pairs, ranges, or in place cleanup. [3] Sliding Window - Problems: Longest Substring Without Repeating Characters, Subarray Sum Equals K, Minimum Window Substring, Sliding Window Maximum, String Compression - Keywords: window start end, expand shrink, running count, best window - Trigger: Use when you scan a string or array for the best subarray or substring that satisfies a condition. [4] Binary Search on Sorted or Answer Space - Problems: Search in Rotated Sorted Array, Find First and Last Position of Element in Sorted Array, Median of Two Sorted Arrays, Find Peak Element, Koko Eating Bananas - Keywords: mid index, sorted property, search space, monotonic answer - Trigger: Use when the input or the answer behaves in a sorted or monotonic way and time limit is tight. [5] Matrix and Grid Traversal - Problems: Number of Islands, Rotting Oranges, Spiral Matrix, Rotate Image, Valid Sudoku - Keywords: 2D grid, visited set, boundaries, four directions - Trigger: Use when the problem is on a board or grid and you need to explore neighbors or layers. [6] Intervals and Timeline Scans - Problems: Merge Intervals, Meeting Rooms II, Best Time to Buy and Sell Stock, Best Time to Buy and Sell Stock II, Daily Temperatures - Keywords: sort by start, sweep line, prefix max, monotonic structure - Trigger: Use when you handle time ranges, bookings, or prices that evolve over a timeline. Check Comments as well..

In the last 15 years, I have interviewed 800+ Software Engineers across Google, Paytm, Amazon & various startups. Here are the most actionable tips I can give you on how to approach  solving coding problems in Interviews  (My DMs are always flooded with this particular question) 1. Use a Heap for K Elements      - When finding the top K largest or smallest elements, heaps are your best tool.      - They efficiently handle priority-based problems with O(log K) operations.      - Example: Find the 3 largest numbers in an array.   2. Binary Search or Two Pointers for Sorted Inputs      - Sorted arrays often point to Binary Search or Two Pointer techniques.      - These methods drastically reduce time complexity to O(log n) or O(n).      - Example: Find two numbers in a sorted array that add up to a target.   3. Backtracking    - Use Backtracking to explore all combinations or permutations.      - They’re great for generating subsets or solving puzzles.      - Example: Generate all possible subsets of a given set.   4. BFS or DFS for Trees and Graphs      - Trees and graphs are often solved using BFS for shortest paths or DFS for traversals.      - BFS is best for level-order traversal, while DFS is useful for exploring paths.      - Example: Find the shortest path in a graph.   5. Convert Recursion to Iteration with a Stack      - Recursive algorithms can be converted to iterative ones using a stack.      - This approach provides more control over memory and avoids stack overflow.      - Example: Iterative in-order traversal of a binary tree.   6. Optimize Arrays with HashMaps or Sorting      - Replace nested loops with HashMaps for O(n) solutions or sorting for O(n log n).      - HashMaps are perfect for lookups, while sorting simplifies comparisons.      - Example: Find duplicates in an array.   7. Use Dynamic Programming for Optimization Problems      - DP breaks problems into smaller overlapping sub-problems for optimization.      - It's often used for maximization, minimization, or counting paths.      - Example: Solve the 0/1 knapsack problem.   8. HashMap or Trie for Common Substrings      - Use HashMaps or Tries for substring searches and prefix matching.      - They efficiently handle string patterns and reduce redundant checks.      - Example: Find the longest common prefix among multiple strings.   9. Trie for String Search and Manipulation      - Tries store strings in a tree-like structure, enabling fast lookups.      - They’re ideal for autocomplete or spell-check features.      - Example: Implement an autocomplete system.   10. Fast and Slow Pointers for Linked Lists      - Use two pointers moving at different speeds to detect cycles or find midpoints.      - This approach avoids extra memory usage and works in O(n) time.      - Example: Detect if a linked list has a loop.   💡 Save this for your next interview prep!

Sorted Array. Constraint: O(n). Question: Pair Sum. If your brain didn't scream "Two Pointers" immediately, you are memorizing, not recognizing. DSA patterns are not meant to be memorized.  They are meant to be detected based on signals. Based on the "3-Prong Pattern Detection System," here is the technical breakdown of how to map signals to solutions: 1. The Input Signal (What data structure is this?) - Sorted Array: Immediately consider Two Pointers (for pair sums) or Binary Search (if you need to find a boundary or the search space shrinks). - Tree/Graph: If it's hierarchical, think Binary Tree/BST or Recursion. If it's about connections or reachability, think BFS/DFS. - Linked List: If you need in-place edits without index access, use the Fast & Slow Pointers technique. 2. The Question Signal (What is being asked?) - "Top K elements" or "Kth largest": This is a hard trigger for a Heap (Priority Queue). - "Subarray" or "Contiguous elements": This almost always points to a Sliding Window. - "Permutations," "Subsets," or "Explore all choices": You are looking at Backtracking. - "Shortest Path" in an unweighted graph: This is BFS. 3. The Constraint Signal (What is the speed limit?) - O(log n): You must cut the search space in half. Binary Search. - O(n): You likely need a single pass. Two Pointers, Sliding Window, or Hashing. - O(1) Lookup: You need a Hash Map or Set. If you see a problem asking for the "Longest substring with distinct characters," run the system: - Input: String. - Question: Longest substring (contiguous). - Constraint: Efficiency. - Pattern: Sliding Window. Stop guessing. Start detecting. What is the one pattern you struggle to identify the most? ♻️ Repost to save this technical framework for your next interview.