Leetcode 145: Binary Tree Postorder Traversal
Question
Given a binary tree, return the postorder traversal of its nodes’ values.
[Read More]
-
-
Leetcode 144: Binary Tree Preorder Traversal
Question Given a binary tree, return the preorder traversal of its nodes’ values. [Read More] -
Leetcode 143: Reorder List
Question Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… [Read More] -
Leetcode 142: Linked List Cycle II
Question Given a linked list, return the node where the cycle begins. If there is no cycle, return null. [Read More] -
Leetcode 141: Linked List Cycle
Question Given a linked list, determine if it has a cycle in it. [Read More] -
Leetcode 140: Word Break II
Question Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. [Read More] -
Leetcode 139: Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. [Read More] -
Leetcode 138: Copy List with Random Pointer
Question A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. [Read More] -
Leetcode 260: Single Number III
Question Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. [Read More] -
Leetcode 137: Single Number II
Question Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. [Read More] -
Leetcode 134: Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. [Read More] -
Leetcode 133: Clone Graph
Question Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. [Read More] -
Leetcode 132: Palindrome Partitioning II
Question Given a string s, partition s such that every substring of the partition is a palindrome. [Read More] -
Leetcode 131: Palindrome Partitioning
Question Given a string s, partition s such that every substring of the partition is a palindrome. [Read More] -
Leetcode 130: Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’. [Read More]