My Practice
Ctrlk
  • Introduction
  • Chapter 1 Combination and Permutation
  • Chapter 2 Binary Search & Sorted Array
    • Summary 1: Binary Search Template
    • Pow & Sqrt
    • Problem 34: Search for a Range
    • Problem 35: Search Insert Position
    • Problem 74: Search a 2D Matrix
    • Problem 240: Search a 2D Matrix II
    • Problem 33: Search in Rotated Sorted Array
    • Problem 81: Search in Rotated Sorted Array II
    • Problem 278: First Bad Version
    • Problem 162: Find Peak Element
    • Sorted Array
      • Problem: Partition Array (LintCode)
      • Problem 26: Remove Duplicates from Sorted Array
      • Problem 80: Remove Duplicates from Sorted Array II
      • Problem 88: Merge Sorted Array
      • Problem: Merge Two Sorted Arrays II (LintCode)
      • Problem: Recover Rotated Sorted Array (LintCode)
      • Problem: Rotate String (LintCode)
      • Problem 4: Median of Two Sorted Arrays
    • Problem 215: Kth Largest Element in an Array
    • Problem 29: Divide Two Integers
    • Problem 287: Find the Duplicate Number
    • Problem 374: Guess Number Higher or Lower
  • Chapter 3 Binary Tree
  • Chapter 4 DFS & BFS
  • Chapter 5 Linked List
  • Chapter 6 Dynamic Programming
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structure
  • Chapter 9 High Frequency
  • Post Chapter 1 String
  • Post Chapter 2 Math
  • Post Chapter 3 Array
  • Facebook
  • Amazon
  • All Chapters Summary
  • Core Java Interview Questions
  • Basics of Sorting
  • Behavior Questions
Powered by GitBook
On this page

Was this helpful?

  1. Chapter 2 Binary Search & Sorted Array

Sorted Array

Problem: Partition Array (LintCode)Problem 26: Remove Duplicates from Sorted ArrayProblem 80: Remove Duplicates from Sorted Array IIProblem 88: Merge Sorted ArrayProblem: Merge Two Sorted Arrays II (LintCode)Problem: Recover Rotated Sorted Array (LintCode)Problem: Rotate String (LintCode)Problem 4: Median of Two Sorted Arrays
PreviousProblem 162: Find Peak ElementNextProblem: Partition Array (LintCode)

Last updated 6 years ago

Was this helpful?