LeetCode 142. Linked List Cycle II
Description https://leetcode.com/problems/linked-list-cycle-ii/ Given a linked list, return the node where the cycle begins. If there is no cycle, return null. There…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/linked-list-cycle-ii/ Given a linked list, return the node where the cycle begins. If there is no cycle, return null. There…
Description https://leetcode.com/problems/reorder-list/ You are given the head of a singly linked-list. The list can be represented as: L0 → L1…
Description https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the…
Description https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ Given the root of a binary tree, flatten the tree into a “linked list”: The “linked list” should use the…
Description https://leetcode.com/problems/permutations-ii/ Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums…
Description https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/ Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place. You can think of the left and right pointers…
Description https://leetcode.com/problems/reverse-linked-list-ii/ Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from…
Description https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the…
Description https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/ Given the head of a linked list, find all the values that appear more than once in the list and delete the…
Description https://leetcode.com/problems/remove-linked-list-elements/ Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val…