426. Convert Binary Search Tree to Sorted Doubly Linked List

2018-08-22

Problem description:

Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.

Readmore

124. Binary Tree Maximum Path Sum

2018-08-22

Problem description:

Given a non-empty binary tree, find the maximum path sum.

Readmore

560. Subarray Sum Equals K

2018-08-21

Problem description:

Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.

Readmore

543. Diameter of Binary Tree

2018-08-21

Problem description:

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Readmore

349. Intersection of Two Arrays

2018-08-21

Problem description:

Given two arrays, write a function to compute their intersection.

Readmore

215. Kth Largest Element in an Array

2018-08-21

Problem description:

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Readmore

143. Reorder List

2018-08-21

Problem description:

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

Readmore

438. Find All Anagrams in a String

2018-08-21

Problem description:

Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.

Readmore

76. Minimum Window Substring

2018-08-21

Problem description:

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

Readmore

297. Serialize and Deserialize Binary Tree

2018-08-21

Problem description:

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Readmore