LeetCode Questions
- 1 two sum
- 2 add two numbers
- 3 longest substring without repeating characters
- 4 median of two sorted arrays
- 5 longest palindromic substring
- 6 two sum
- 7 reverse integer
- 8 palindrome number
- 9 roman to integer
- 10 longest common prefix
- 11 container with most water
- 12 integer to roman
- 13 roman to integer
- 14 longest common prefix
- 15 3sum
- 16 3sum closest
- 17 letter combinations of a phone number
- 18 4sum
- 19 remove nth node from end of list
- 20 valid parentheses
- 21 merge two sorted lists
- 22 generate parentheses
- 23 merge k sorted lists
- 24 swap nodes in pairs
- 25 reverse nodes in k group
- 26 remove duplicates from sorted array
- 27 remove element
- 28 implement strstr
- 29 divide two integers
- 30 substring with concatenation of all words
- 31 next permutation
- 32 longest valid parentheses
- 33 search in rotated sorted array
- 34 find first and last position of element in sorted array
- 35 search insert position
- 36 valid sudoku
- 37 sudoku solver
- 38 count and say
- 39 combination sum
- 40 combination sum ii
- 41 first missing positive
- 42 trapping rain water
- 43 multiply strings
- 44 wildcard matching
- 45 jump game ii
- 46 permutations
- 47 permutations ii
- 48 rotate image
- 49 group anagrams
- 50 powx n
33. Search in Rotated Sorted Array
You are given an integer array nums sorted in ascending order, and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). You should search for target in nums and return its index if found, or -1 if not found.
Word Count: 0
