6d ago · 18 min read · TLDR: Binary search has five patterns beyond the classic "find the target": leftmost position, rightmost position, rotated array search, minimum in rotated array, and 2D matrix search. The root of every off-by-one bug is a mismatched loop condition a...
Join discussionFeb 25 · 4 min read · Algorithms rarely fail because they are incorrect.They fail because assumptions that look valid mathematically do not survive contact with real machines. Ternary search is a classic example. Yet binary search remains the default — in standard librari...
Join discussionFeb 14 · 4 min read · My Initial Understanding of Binary Search In my problem-solving journey as an aspiring problem solver and software developer, I came across the Binary Search algorithm — just like many other developers. Initially, whenever I read a problem statement ...
Join discussion
Dec 16, 2025 · 1 min read · Problem Description Given a m x n integer matrix. Each row of the matrix is non-decreasing. The first element of each row is greater than the last element of the previous row.Given an integer target, return true if and only if target is in the matrix...
Join discussionOct 21, 2025 · 13 min read · Binary Search is used on sorted Arrays. 🧩 Binary Search works if : There exists a monotonic relationship in your search space —that is, a point divides the domain into two consistent halves: The left half satisfies one condition (e.g., false), Th...
Join discussionOct 5, 2025 · 161 min read · The first step in optimization always begins with reducing time complexity — and what better way to start than with an algorithm that runs in O(log n)? So lets start with Binary search !!! What is Binary Search? Binary Search is a super handy algorit...
Join discussion
Aug 21, 2025 · 4 min read · 1. Introduction to Binary Search Binary Search is one of the most fundamental algorithms in computer science. It is a highly efficient method to find the position of a target value within a sorted array. Instead of scanning the entire array linearly,...
Join discussion
Aug 1, 2025 · 1 min read · 🧠 Problem Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 🏷️ Tags array, binary search, divide an...
Join discussionAug 1, 2025 · 1 min read · 🧠 Problem Median of Two Sorted Arrays 🏷️ Tags array, binary search, divide and conquer 📊 Difficulty Hard ✅ Success Rate: 34%📥 Submissions: 3,941,694📈 Accepted: 1,340,565 ❤️ Reactions 👍 Likes: 15987👎 Dislikes: 1964 💡 Hints 🔁 Similar Ques...
Join discussionJul 14, 2025 · 4 min read · Problem Description 540 Single Element in a Sorted Array The "Single Element in a Sorted Array" problem asks you to find the single element that appears exactly once in a sorted array where all other elements appear exactly twice. Key Constraints: ...
Join discussion
