All Posts

Leetcode 226: Invert Binary Tree

Given the root of a binary tree, invert the tree by swapping the left and right subtrees of every node, and return its root.

Oct 15, 2024 - 4 min read

Leetcode 230: Kth Smallest Element in a BST

Given the root of a binary search tree and an integer k, your task is to return the kth smallest value in the tree (1-indexed).

Oct 15, 2024 - 5 min read

Leetcode 235: Lowest Common Ancestor of a Binary Search Tree

Given a Binary Search Tree (BST), find the lowest common ancestor (LCA) of two given nodes. The lowest common ancestor is the deepest node that is an ancestor of both nodes. An ancestor of a node is a node itself or any node in its path up to the root.

Oct 14, 2024 - 6 min read

Leetcode 236: Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes. The lowest common ancestor is defined as the lowest node that is an ancestor of both nodes p and q. A node can be a descendant of itself.

Oct 14, 2024 - 5 min read

Leetcode 310: Minimum Height Trees

You are given a tree with ’n’ nodes labeled from 0 to n-1, represented by ’n-1’ edges. Your task is to find all roots that minimize the height of the tree. The height of a tree is defined as the number of edges in the longest downward path from the root to any leaf.

Oct 7, 2024 - 7 min read

Leetcode 341: Flatten Nested List Iterator

You are given a nested list of integers nestedList, where each element can either be an integer or a sublist containing integers or other sublists. Implement an iterator to flatten this nested list.

Oct 3, 2024 - 6 min read