# LeetCode Delete Node in a Linked List: O(1) Time and Space

LeetCode Delete Node in a Linked List: We can solve it by swapping the current node and the next node in O(1) Time and Space.

Read More
Learn, Share and Inspire

LeetCode Delete Node in a Linked List: We can solve it by swapping the current node and the next node in O(1) Time and Space.

Read More
LeetCode Palindrome Linked List: use slow/fast pointers O(1) to get the middle of linked list, reverse the right half, compare reversed half and the left

Read More
LeetCode Reverse Linked List: Recursive solution takes O(N) time and O(N) space while Iterative Solution takes O(N) time and O(1) space.

Read More
PAT Advanced 1099 Build A Binary Search Tree: Sort the values, DFS (inorder travels) to insert the values into correct nodes, BFS to print in level order.

Read More
PAT Advanced 1098 Insertion or Heap Sort: O(N) Time Without Simulation, the challenge here is to find the next sorted sequences that differs from previous.

Read More