Using binary search
- Time complexity:
$$O((m+n)\ log\ n)$$
Peculiar Erhisohwode PeculiarE
PeculiarE
/ candySwapBinarySearch.md
Created
March 12, 2026 22:04
Fair Candy Swap - LeetCode - Days 71 & 72
PeculiarE
/ smallestLetter.md
Created
March 11, 2026 22:34
Find Smallest Letter Greater Than Target - LeetCode - Day 70
- Time complexity:
$$O(log\ n)$$
PeculiarE
/ rotatedSortedArrayII.md
Created
March 10, 2026 12:16
Search in Rotated Sorted Array II - LeetCode - Day 69
- Time complexity:
$$O(n)$$
PeculiarE
/ findMinimum.md
Last active
March 9, 2026 23:51
Find Minimum in Rotated Sorted Array - LeetCode - Day 68
- Time complexity:
$$O(log\ n)$$
Classic binary search problem
- Time complexity:
$$O(log\ n)$$
- Time complexity:
$$O(log\ n)$$
PeculiarE
/ guessNumber.md
Created
March 6, 2026 22:28
Guess Number Higher Or Lower - LeetCode - Day 65
- Time complexity:
$$O(log \ n)$$
- Time complexity:
$$O(log \ n)$$
PeculiarE
/ intersectionOfTwoArraysII.md
Last active
March 4, 2026 23:26
Intersection of Two Arrays II - LeetCode - Days 62 & 63
- Time complexity:
$$O(n \log n + m \log m)$$
PeculiarE
/ intersectionOfTwoArrays.md
Created
March 2, 2026 22:58
Intersection of Two Arrays - LeetCode - Day 61
- Time complexity:
$$O(n + m)$$
NewerOlder