Recursion
No Link 0002 Add Two Numbers
Binary Search
No Link 0004 Median of Two Sorted Arrays 0033 Search in Rotated Sorted Array
Hash Table
No Link 0001 Two Sum 0003 Longest Substring without Repeating Characters
Linked List
No Link 0002 Add Two Numbers
Array
No Link 0001 Two Sum 0004 Median of Two Sorted Arrays
Leetcode 0004 Median of Two Sorted Arrays
Median of Two Sorted Arrays problem results Median of Two Sorted Arrays First Blood My first solution is so brute force and the run time complexity is not O(log(m+n)). But I think this solution...
Leetcode 0003 Longest Substring Without Repeating Characters
Longest Substring Without Repeating Characters problem results Longest Substring Without Repeating Characters When I was working, I occasionally heard about the common interview question about ...
Leetcode 0002 Add Two Numbers
ADD TWO NUMBERS problem results Add_Two_Numbers First Blood I feel very ashamed when solving this problem. How can I not even think about the Integer overflow issue? This should be a very basic...
Leetcode 0001 Two Sum
TWO SUM problem results Two_Sum First Blood Using “two loops” to solve the problem is not efficient. { class Solution { public: vector<int> twoSum(vector<int>& nums, int tar...