Coding questions Flashcards
A peak element is an element that is strictly greater than its neighbors.
Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.
You may imagine that nums[-1] = nums[n] = -∞.
You must write an algorithm that runs in O(log n) time.
nums = [1,2,3,1] output = 2
https://leetcode.com/problems/find-peak-element/
- Reverse Words in a String
https://leetcode.com/problems/reverse-words-in-a-string/
- 3Sum
https://leetcode.com/problems/3sum/
- Ways to Split Array Into Three Subarrays
https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/
- Circular Array Group
https://leetcode.com/problems/circular-array-loop/
- Split two strings to make it palindrome
https://leetcode.com/problems/split-two-strings-to-make-palindrome/
- Compare Version Numbers
https://leetcode.com/problems/compare-version-numbers/
- Valid Word Abbreviation
https://leetcode.com/problems/valid-word-abbreviation/
- 3Sum Closest
https://leetcode.com/explore/challenge/card/july-leetcoding-challenge-2021/611/week-4-july-22nd-july-28th/3828/
- 3Sum Smaller
https://leetcode.com/problems/3sum-smaller/
- Search in Rotated Sorted Array
https://leetcode.com/problems/search-in-rotated-sorted-array/
- Find Minimum in Rotated Sorted Array
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
- Find Minimum in Rotated Sorted Array II
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/
- Minimum Absolute Sum Difference
https://leetcode.com/problems/minimum-absolute-sum-difference/
- Minimum Size Subarray Sum
https://leetcode.com/problems/minimum-size-subarray-sum/
- Shortest Subarray with Sum at Least K
https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/
- Distinct Numbers in Each Subarray
https://leetcode.com/problems/distinct-numbers-in-each-subarray/
- Maximum Subarray
https://leetcode.com/problems/maximum-subarray/
