GoodTecher

Be a Good Techer and Tech for Good. www.goodtecher.com

Skip to content
Menu
  • Home
  • LeetCode
    • Array
    • Binary Search
    • Binary Tree
    • Depth First Search
    • Design
    • Dynamic Programming
    • Linked List
    • Math
    • Stack
    • String
    • Two Pointers
    • Union Find
  • Useful

Category: Binary Search

  • Posted on September 1, 2020February 3, 2021
  • Binary Search

LeetCode 852. Peak Index in a Mountain Array

Description https://leetcode.com/problems/peak-index-in-a-mountain-array/ Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length -…

Continue Reading
  • Posted on July 21, 2020July 21, 2020
  • Binary Search

LeetCode 240. Search a 2D Matrix II

Description https://leetcode.com/problems/search-a-2d-matrix-ii/ Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers…

Continue Reading
  • Posted on May 15, 2020August 20, 2021
  • Binary Search

LeetCode 162. Find Peak Element

Description https://leetcode.com/problems/find-peak-element/ A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find…

Continue Reading
  • Posted on April 19, 2020July 20, 2020
  • Binary Search

LeetCode 33. Search in Rotated Sorted Array

Description https://leetcode.com/problems/search-in-rotated-sorted-array/ Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).…

Continue Reading
  • Posted on August 4, 2018March 29, 2020
  • Binary Search

LeetCode 278. First Bad Version

Description You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version…

Continue Reading
  • Posted on November 5, 2017May 16, 2020
  • Binary Search

LeetCode 69. Sqrt(x)

Description Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the…

Continue Reading
  • Posted on October 1, 2017May 15, 2020
  • Binary Search

LeetCode 34. Find First and Last Position of Element in Sorted Array

Description Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s…

Continue Reading
  • Posted on September 17, 2017April 8, 2021
  • Binary Search

LeetCode 35. Search Insert Position

Description Given a sorted array of distinct integers and a target value, return the index if the target is found.…

Continue Reading
  • Posted on February 12, 2017January 27, 2018
  • Binary Search

LeetCode 4. Median of Two Sorted Arrays

Description https://leetcode.com/problems/median-of-two-sorted-arrays/ There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of…

Continue Reading

Posts navigation

Previous Page Page 1 Page 2

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (7)
  • LeetCode (588)
    • Array (185)
    • Backtracking (18)
    • Binary Search (19)
    • Binary Tree (63)
    • Bit Manipulation (15)
    • Database (40)
    • Depth First Search (6)
    • Design (10)
    • Dynamic Programming (17)
    • Graph (18)
    • Greedy (5)
    • Heap (1)
    • Linked List (26)
    • Math (36)
    • Recursion (3)
    • Sorting (11)
    • Stack (11)
    • String (95)
    • Two Pointers (12)
    • Union Find (2)
  • Machine Learning (7)
  • Technical Solutions (2)
  • Useful (3)
© Copyright 2025 – GoodTecher
Cell Theme by DesignOrbital ⋅ Powered by WordPress