Back to Topics
Search & Sort
36 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Find first and last positions of an element in a sorted array
|
Medium | 0 | ||||
| 2 |
Find a Fixed Point (Value equal to index) in a given array
|
Medium | 0 | ||||
| 3 |
Search in a rotated sorted array
|
Easy | 0 | ||||
| 4 |
square root of an integer
|
Medium | 0 | ||||
| 5 |
Maximum and minimum of an array using minimum number of comparisons
|
Medium | 0 | ||||
| 6 |
Optimum location of point to minimize total distance
|
Medium | 0 | ||||
| 7 |
Find the repeating and the missing
|
Medium | 0 | ||||
| 8 |
find majority element
|
Medium | 0 | ||||
| 9 |
Searching in an array where adjacent differ by at most k
|
Medium | 0 | ||||
| 10 |
find a pair with a given difference
|
Medium | 0 | ||||
| 11 |
find four elements that sum to a given value
|
Medium | 0 | ||||
| 12 |
maximum sum such that no 2 elements are adjacent
|
Medium | 0 | ||||
| 13 |
Count triplet with sum smaller than a given value
|
Medium | 0 | ||||
| 14 |
merge 2 sorted arrays
|
Medium | 0 | ||||
| 15 |
print all subarrays with 0 sum
|
Medium | 0 | ||||
| 16 |
Product array Puzzle
|
Medium | 0 | ||||
| 17 |
Sort array according to count of set bits
|
Medium | 0 | ||||
| 18 |
minimum no. of swaps required to sort the array
|
Medium | 0 | ||||
| 19 |
Bishu and Soldiers
|
Medium | 0 | ||||
| 20 |
Rasta and Kheshtak
|
Medium | 0 | ||||
| 21 |
Kth smallest number again
|
Medium | 0 | ||||
| 22 |
Find pivot element in a sorted array
|
Medium | 0 | ||||
| 23 |
K-th Element of Two Sorted Arrays
|
Medium | 0 | ||||
| 24 |
Aggressive cows
|
Medium | 0 | ||||
| 25 |
Book Allocation Problem
|
Medium | 0 | ||||
| 26 |
EKOSPOJ:
|
Medium | 0 | ||||
| 27 |
Job Scheduling Algo
|
Medium | 0 | ||||
| 28 |
Missing Number in AP
|
Medium | 0 | ||||
| 29 |
Smallest number with atleastn trailing zeroes infactorial
|
Medium | 0 | ||||
| 30 |
Painters Partition Problem:
|
Medium | 0 | ||||
| 31 |
ROTI-Prata SPOJ
|
Medium | 0 | ||||
| 32 |
DoubleHelix SPOJ
|
Medium | 0 | ||||
| 33 |
Subset Sums
|
Medium | 0 | ||||
| 34 |
Find the inversion count
|
Medium | 0 | ||||
| 35 |
Implement Merge-sort in-place
|
Medium | 0 | ||||
| 36 |
Partitioning and Sorting Arrays with Many Repeated Entries
|
Hard | 0 |