Traverse a binary tree level by level using Breadth-First Search (BFS) with an ArrayDeque queue in Java.
Invert a binary tree by recursively swapping left and right child pointers.
Find two indices in an array of integers that add up to a specific target number using a single-pass HashMap in O(n) time.
Reverse strings in Java efficiently using StringBuilder and in-place char array two-pointer swapping.