LeetCode #226: Invert Binary Tree
https://leetcode.com/problems/invert-binary-tree/ Invert Binary Tree is a famous algorithmic problem that involves modifying a binary tree. Given a binary tree, the…
Category: LeetCode Solutions
Step by step guide to LeetCode solutions.
LeetCode #23: Merge k Sorted Lists
https://leetcode.com/problems/merge-k-sorted-lists/description/ To solve this problem, we can use a min heap to keep track of the minimum element from each…
LeetCode #141: Linked List Cycle
https://leetcode.com/problems/linked-list-cycle/description/ To solve this problem, we can use the two-pointer technique. We will have two pointers, a slow pointer and…
LeetCode #19: Remove Nth Node From End of List
https://leetcode.com/problems/remove-nth-node-from-end-of-list/ The “Remove Nth Node From End of List” problem on LeetCode asks us to remove the nth node from…
LeetCode #143: Reorder List
https://leetcode.com/problems/reorder-list/ The “Reorder List” problem on LeetCode asks us to take a singly linked list and reorder it to have…
LeetCode #21: Merge Two Sorted Lists
https://leetcode.com/problems/merge-two-sorted-lists/ To solve this problem in Python 3, we can use a simple iterative approach that compares the values of…
LeetCode #206: Reverse Linked List
https://leetcode.com/problems/reverse-linked-list/ To solve this problem in Python 3, we can use a simple iterative approach that iterates through the linked…
LeetCode #33: Search in Rotated Sorted Array
https://leetcode.com/problems/search-in-rotated-sorted-array/ To solve this problem in Python 3, we can use a modified binary search algorithm to search for the…
LeetCode #153: Find Minimum in Rotated Sorted Array
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Solution: To solve this problem in Python 3, we can use a binary search algorithm to search for the…
LeetCode #20: Valid Parentheses
https://leetcode.com/problems/valid-parentheses/ To solve this problem in Python 3, we can use a stack data structure to keep track of the…