Stories, Tutorials
& Life Tips
Deep dives on coding, health, recipes, travel and everything in between.
Given a linked list, remove the nth node from the end of the list and return its head. For example, Given linked list: 1->2->3->4->5, an…
📍 Explore Reading Paths
Follow curated journeys from beginner to expert
N-ary Tree Postorder Traversal - Tree - Easy - LeetCode
Given an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null v…
N-ary Tree Preorder Traversal - Tree - Easy - LeetCode
Given an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in…
Subtree of Another Tree - Tree - Easy - LeetCode
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a sub…
Binary Tree Tilt - Tree - Easy - LeetCode
Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference be…
Maximum Depth of N-ary Tree - Tree - Easy - LeetCode
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the roo…
Diameter of Binary Tree - Tree - Easy - LeetCode
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the le…
Minimum Absolute Difference in BST - Tree - Easy - LeetCode
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two node…
Find Mode in Binary Search Tree - Tree - Easy - LeetCode
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the giv…
Sum of Left Leaves - Tree - Easy - LeetCode
Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 …
Binary Tree Paths - Tree - Easy - LeetCode
Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Input: &nbs…
Path Sum - Tree - Easy - LeetCode
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along th…
Minimum Depth of Binary Tree - Tree - Easy - LeetCode
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the r…
Balanced Binary Tree - Tree - Easy - LeetCode
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: …
Convert Sorted Array to Binary Search Tree - Tree - Easy - LeetCode
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a he…
Binary Tree Level Order Traversal II - Tree - Easy - LeetCode
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by …