摘要：
Number of Steps to Reduce a Number to Zero (E) 题目 Given a non-negative integer num, return the number of steps to reduce it to zero. If the current nu 阅读全文
摘要：
Valid Anagram (E) 题目 Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Input: s = "anagram", t = "nagaram" 阅读全文
摘要：
Copy List with Random Pointer (M) 题目 A linked list is given such that each node contains an additional random pointer which could point to any node in 阅读全文
摘要：
Convert BST to Greater Tree (M) 题目 Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST 阅读全文
摘要：
Shortest Distance to a Character (E) 题目 Given a string s and a character c that occurs in s, return an array of integers answer where answer.length == 阅读全文
摘要：
Binary Tree Right Side View (M) 题目 Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see 阅读全文
摘要：
Simplify Path (M) 题目 Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, co 阅读全文
摘要：
Longest Harmonious Subsequence (E) 题目 We define a harmonious array as an array where the difference between its maximum value and its minimum value is 阅读全文
摘要：
Linked List Cycle (E) 题目 Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos 阅读全文
摘要：
Trim a Binary Search Tree (M) 题目 Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that a 阅读全文