Files

Algorithms
- 01 Matrix
- 3Sum Closest
- 3Sum
- 4Sum II
- 4Sum
- Add Binary
- Add Digits
- Add Strings
- Add Two Numbers II
- Add Two Numbers
- Add and Search Word - Data structure design
- Additive Number
- Arithmetic Slices
- Arranging Coins
- Assign Cookies
- Average of Levels in Binary Tree
- Balanced Binary Tree
- Base 7
- Basic Calculator II
- Basic Calculator
- Battleships in a Board
- Beautiful Arrangement
- Best Time to Buy and Sell Stock II
- Best Time to Buy and Sell Stock III
- Best Time to Buy and Sell Stock with Cooldown
- Best Time to Buy and Sell Stock
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal
- Binary Tree Paths
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Right Side View
- Binary Tree Tilt
- Binary Tree Zigzag Level Order Traversal
- Binary Watch
- Bitwise AND of Numbers Range
- Bulb Switcher
- Bulls and Cows
- Climbing Stairs
- Clone Graph
- Coin Change
- Combination Sum II
- Combination Sum III
- Combination Sum IV
- Combination Sum
- Combinations
- Compare Version Numbers
- Complex Number Multiplication
- Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct the Rectangle
- Container With Most Water
- Contains Duplicate II
- Contains Duplicate III
- Contains Duplicate
- Continuous Subarray Sum
- Convert BST to Greater Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert a Number to Hexadecimal
- Copy List with Random Pointer
- Count Complete Tree Nodes
- Count Numbers with Unique Digits
- Count Primes
- Count and Say
- Count of Range Sum
- Count of Smaller Numbers After Self
- Counting Bits
- Course Schedule II
- Course Schedule
- Daily Temperatures
- Decode String
- Decode Ways
- Degree of an Array
- Delete Node in a Linked List
- Detect Capital
- Diagonal Traverse
- Diameter of Binary Tree
- Different Ways to Add Parentheses
- Distribute Candies
- Divide Two Integers
- Encode and Decode TinyURL
- Excel Sheet Column Number
- Excel Sheet Column Title
- Factorial Trailing Zeroes
- Find All Anagrams in a String
- Find All Duplicates in an Array
- Find All Numbers Disappeared in an Array
- Find Bottom Left Tree Value
- Find K Pairs with Smallest Sums
- Find Largest Value in Each Tree Row
- Find Median from Data Stream
- Find Minimum in Rotated Sorted Array II
- Find Minimum in Rotated Sorted Array
- Find Mode in Binary Search Tree
- Find Peak Element
- Find Right Interval
- Find the Difference
- Find the Duplicate Number
- First Bad Version
- First Missing Positive
- First Unique Character in a String
- Fizz Buzz
- Flatten Binary Tree to Linked List
- Flatten Nested List Iterator
- Fraction to Recurring Decimal
- Friend Circles
- Game of Life
- Generate Parentheses
- Gray Code
- Group Anagrams
- Guess Number Higher or Lower II
- Guess Number Higher or Lower
- H-Index II
- H-Index
- Hamming Distance
- Happy Number
- Heaters
- House Robber II
- House Robber III
- House Robber
- IPO
- Implement Queue using Stacks
- Implement Stack using Queues
- Implement Trie (Prefix Tree)
- Implement strStr()
- Increasing Subsequences
- Increasing Triplet Subsequence
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Insert Interval
- Insertion Sort List
- Integer Break
- Integer Replacement
- Integer to Roman
- Intersection of Two Arrays II
- Intersection of Two Arrays
- Intersection of Two Linked Lists
- Invert Binary Tree
- Is Subsequence
- Island Perimeter
- Isomorphic Strings
- Jump Game II
- Jump Game
- K-diff Pairs in an Array
- Keyboard Row
- Kth Largest Element in an Array
- Kth Smallest Element in a BST
- Kth Smallest Element in a Sorted Matrix
- LRU Cache
- Largest Divisible Subset
- Largest Number
- Largest Rectangle in Histogram
- Length of Last Word
- Letter Combinations of a Phone Number
- Lexicographical Numbers
- License Key Formatting
- Linked List Cycle II
- Linked List Cycle
- Linked List Random Node
- Lonely Pixel I
- Lonely Pixel II
- Longest Absolute File Path
- Longest Common Prefix
- Longest Consecutive Sequence
- Longest Increasing Subsequence
- Longest Palindrome
- Longest Palindromic Substring
- Longest Substring Without Repeating Characters
- Longest Substring with At Least K Repeating Characters
- Longest Uncommon Subsequence I
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree
- Magical String
- Majority Element II
- Majority Element
  - README.md
  - majority-element.js
- Matchsticks to Square
- Max Consecutive Ones
- Maximal Rectangle
- Maximal Square
- Maximum Depth of Binary Tree
- Maximum Gap
- Maximum Product Subarray
- Maximum Product of Word Lengths
- Maximum Subarray
- Maximum XOR of Two Numbers in an Array
- Median of Two Sorted Arrays
- Merge Intervals
- Merge Sorted Array
- Merge Two Sorted Lists
- Merge k Sorted Lists
- Minesweeper
- Mini Parser
- Minimum Absolute Difference in BST
- Minimum Depth of Binary Tree
- Minimum Genetic Mutation
- Minimum Moves to Equal Array Elements II
- Minimum Moves to Equal Array Elements
- Minimum Number of Arrows to Burst Balloons
- Minimum Path Sum
- Minimum Size Subarray Sum
- Minimum Time Difference
- Missing Number
- Most Frequent Subtree Sum
- Move Zeroes
- Multiply Strings
- N-Queens II
- N-Queens
- Next Greater Element I
- Next Greater Element II
- Next Permutation
- Nim Game
- Non-overlapping Intervals
- Nth Digit
- Number Complement
- Number of 1 Bits
- Number of Boomerangs
- Number of Digit One
- Number of Islands
- Number of Segments in a String
- Odd Even Linked List
- Ones and Zeroes
- Pacific Atlantic Water Flow
- Palindrome Linked List
- Palindrome Number
- Palindrome Pairs
- Palindrome Partitioning II
- Palindrome Partitioning
- Partition List
- Pascal's Triangle II
- Pascal's Triangle
- Patching Array
- Path Sum II
- Path Sum III
- Path Sum
- Perfect Number
- Perfect Squares
- Permutation Sequence
- Permutations II
- Permutations
- Plus One
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node
- Pow(x, n)
- Power of Four
- Power of Three
- Power of Two
- Predict the Winner
- Product of Array Except Self
- Queue Reconstruction by Height
- Random Pick Index
- Range Sum Query - Immutable
- Range Sum Query - Mutable
- Range Sum Query 2D - Immutable
- Ransom Note
- Reconstruct Original Digits from English
- Rectangle Area
- Regular Expression Matching
- Relative Ranks
- Remove Duplicates from Sorted Array II
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted List II
- Remove Duplicates from Sorted List
- Remove Element
- Remove K Digits
- Remove Linked List Elements
- Remove Nth Node From End of List
- Reorder List
- Repeated DNA Sequences
- Repeated Substring Pattern
- Restore IP Addresses
- Reverse Bits
- Reverse Integer
- Reverse Linked List II
- Reverse Linked List
- Reverse Nodes in k-Group
- Reverse String II
- Reverse String
- Reverse Vowels of a String
- Reverse Words in a String III
- Reverse Words in a String
- Roman to Integer
- Rotate Array
- Rotate Function
- Rotate Image
- Rotate List
- Same Tree
- Search Insert Position
- Search a 2D Matrix II
- Search a 2D Matrix
- Search for a Range
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array
- Self Crossing
- Set Matrix Zeroes
- Shortest Palindrome
- Shuffle an Array
- Simplify Path
- Single Number II
- Single Number III
- Single Number
- Sliding Window Median
- Sort Characters By Frequency
- Sort Colors
- Sort List
- Spiral Matrix II
- Spiral Matrix
- Sqrt(x)
- String to Integer (atoi)
- Subsets II
- Subsets
- Sum Root to Leaf Numbers
- Sum of Left Leaves
- Sum of Square Numbers
- Sum of Two Integers
- Summary Ranges
- Super Pow
- Super Ugly Number
- Swap Nodes in Pairs
- Symmetric Tree
- Target Sum
- Teemo Attacking
- Third Maximum Number
- Top K Frequent Elements
- Total Hamming Distance
- Trapping Rain Water
- Triangle
- Two Sum II - Input array is sorted
- Two Sum
- UTF-8 Validation
- Ugly Number II
- Ugly Number
- Unique Binary Search Trees II
- Unique Binary Search Trees
- Unique Paths II
- Unique Paths
- Valid Anagram
- Valid Number
- Valid Palindrome
- Valid Parentheses
- Valid Perfect Square
- Valid Sudoku
- Valid Word Abbreviation
- Validate Binary Search Tree
- Validate IP Address
- Verify Preorder Serialization of a Binary Tree
- Wiggle Subsequence
- Word Break
- Word Pattern
- Word Search
- ZigZag Conversion
.gitignore
CONTRIBUTING.md
generate.js
package.json
readme.md

README.md

Apr 23, 2016

badae61 · Apr 23, 2016

Use the array hash to calculate the time one element appears. For instance, hash[i] means the time i appears. And when hash[i] > len / 2, we can say that i is the answer.