Given a binary tree root, find the value of the deepest node. If there’s more than one deepest node, then return the leftmost one. Constraints n ≤ 100,000 where …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a singly linked list l0 and another linked list l1, each representing a number with least significant digits first, …
You are given a list of lowercase alphabet strings words where each string is of the same length. Return whether there’s two strings that differ only in one index. …
Teaching Kids Programming: Videos on Data Structures and Algorithms An array is monotonic if it is either monotone increasing or monotone decreasing. An array A is monotone increasing if …
Given a list of integers nums and an integer target, return the number of triples i < j < k that exist such that nums + nums + nums …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given Two Linked Lists, compute the Intersection Node: For example: 1 - 2 - 3 - 4 - 5 | …