Author: ACMer
Given a binary tree root, return whether all leaves are at the same level. Constraints n ≤ 100,000 where n is the number of nodes in root Breadth First …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with …
Given a singly linked list node, and an integer target, delete the last occurrence of target in node. Constraints 0 ≤ n ≤ 100,000 where n is the number …
Teaching Kids Programming: Videos on Data Structures and Algorithms We know how to invert a binary tree. We also learned how to check if a binary tree is symmetric. …
You are given a string s containing “1”s and “0”s. Return the number of substrings that contain only “1”s. Mod the result by 10 ** 9 + 7. Constraints …