Algorithm

LeetCode-3Sum

Given an integer array nums, return all the triplets numsi, numsj, numsk such that i != j, i != k, and j != k, and numsi + numsj + numsk == 0

LeetCode-Two Sum

Given an array of integers nums and an integer target, return _indices of the two numbers such that they add up to target

LeetCode-Palindrome Pairs Solution

Given a list of unique words, return all the pairs of the _distinct_ indices (i, j) in the given list, so that the concatenation of the two words words[i] +…

LeetCode-Word Search II Solution

LeetCode-Word Search II Solution - Given an m x n board of characters and a list of strings words, return _all words on the board

LeetCode-Maximum XOR of Two Numbers in an Array

Given an integer array nums, return _the maximum result of nums[i] XOR nums[j]_, where 0 ≤ i ≤ j < n. Follow up: Could you do this in O(n) runtime? Example 1…

LeetCode- Add and Search Word - Data structure design Solution

LeetCode- Add and Search Word - Data structure design Solution - leetcode Trie的添加及搜索

LeetCode- Replace Words Solution

In English, we have a concept called root, which can be followed by some other word to form another longer word - let's call this word successor. For example…

LeetCode- Map Sum Pairs Solution

LeetCode- Map Sum Pairs Solution - Implement a MapSum class with insert, and sum methods

LeetCode – Populating Next Right Pointers in Each Node Solution

LeetCode – Populating Next Right Pointers in Each Node Solution - You are given a perfect binary tree where all leaves are on the same level, and every parent…

LeetCode –Populating Next Right Pointers in Each Node II

Given a binary tree