~/lc-grind

Traverse a binary tree level by level, collecting node values left to right in nested lists, using BFS for an efficient solution.

Master the art of tree traversal with this Hard problem: find the maximum path sum in a binary tree, where a path can start and end at any node, using clever DFS and dynamic programming techniques.

Flip a binary tree by swapping every left and right subtree, turning it into its mirror image—solved with simple DFS or BFS traversal.

Check if two binary trees are identical in structure and node values using DFS or BFS—a fundamental tree traversal problem for beginners!

Learn how to find the maximum depth of a binary tree using DFS or BFS in this easy LeetCode problem—perfect for mastering tree traversal fundamentals!

Count all contiguous palindromic substrings in a given string using efficient two-pointer or dynamic programming techniques.

Master the art of finding the longest palindromic substring in a given string using efficient techniques like two pointers or dynamic programming—perfect for sharpening your string manipulation skills!

Check if a string is a palindrome by ignoring cases and non-alphanumeric characters, using efficient two-pointer traversal.

Check if a string of parentheses is valid by ensuring every opening bracket is properly closed in the correct order, using a stack for efficient validation.

Group anagrams from a list of strings by sorting characters or using frequency counts, efficiently leveraging hash tables to map and cluster words with identical letter compositions.