Teaching Kids Programming: Videos on Data Structures and Algorithms You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in …
Given two sorted linked lists l0, and l1, return a new sorted linked list containing the intersection of the two lists. Constraints n ≤ 100,000 where n is the …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given an array of integers nums and an integer target, return indices of the two numbers such that they add …
Given two linked lists l0 and l1, return the two linked lists interleaved, starting with l0. If there are leftover nodes in a linked list, they should be added …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given two integers n and k, return all possible combinations of k numbers out of 1 … n. You may …
Given a string s, return the longest prefix of s that is not equal to s and exists as a suffix of s. Constraints n ≤ 100,000 where n …