141. Linked List Cycle

Problem description:

Given head, the head of a linked list, determine if the linked list has a cycle in it.

Readmore

94. Binary Tree Inorder Traversal

Problem description:

Given the root of a binary tree, return the inorder traversal of its nodes’ values.
Example 1:

Readmore

142. Linked List Cycle II

Problem description:

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Readmore

92. Reverse Linked List II

Problem description:

Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right, and return the reversed list.

Readmore

86. Partition List

Problem description:

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

Readmore

82. Remove Duplicates from Sorted List II

Problem description:

Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.

Readmore

61. Rotate List

Problem description:

Given the head of a linked list, rotate the list to the right by k places.

Readmore

234. Palindrome Linked List

Problem description:

Given the head of a singly linked list, return true if it is a palindrome.

Readmore

235. Lowest Common Ancestor of a Binary Search Tree

Problem description:

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

Readmore

70. Climbing Stairs

Problem description:

You are climbing a staircase. It takes n steps to reach the top.

Readmore