Collections binary search java

Collections binary search java

Easy problems on Searching algorithms

  • Find the Missing Number
  • Find the first repeating element in an array of integers
  • Find the missing and repeating number
  • Count 1’s in a sorted binary array
  • Two elements whose sum is closest to zero
  • Find a pair with the given difference
  • Kth smallest element in a row-wise and column-wise sorted 2D array
  • Find common elements in three sorted arrays
  • Ceiling in a sorted array
  • Floor in a Sorted Array
  • Find the maximum element in an array which is first increasing and then decreasing
  • Given Array of size n and a number k, find all elements that appear more than n/k times

Medium problems on Searching algorithms

  • Find all triplets with zero sum
  • Find the element before which all the elements are smaller than it, and after which all are greater
  • Find the largest pair sum in an unsorted array
  • K’th Smallest/Largest Element in Unsorted Array
  • Search an element in a sorted and rotated Array
  • Find the Minimum element in a Sorted and Rotated Array
  • Find a Fixed Point (Value equal to index) in a given array
  • Find the k most frequent words from a file
  • Find k closest elements to a given value
  • Given a sorted array and a number x, find the pair in array whose sum is closest to x
  • Find the closest pair from two sorted arrays
  • Find three closest elements from given three sorted arrays
  • Binary Search for Rational Numbers without using floating point arithmetic
Читайте также:  Kotlin byte array init

Hard problems on Searching algorithms

Источник

Оцените статью