Search Results for: programming
Given a binary search tree root, an integer lo, and another an integer hi, remove all nodes that are not between inclusive. Constraints n ≤ 100,000 where n is …
Given a binary search tree root containing unique values, and an integer t, return the value of the inorder successor of t. That is, return the smallest value greater …
Given two sorted linked lists node0, and node, return a new sorted linked list containing the union of the two lists. Constraints 0 ≤ n ≤ 100,000 where n …
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 …
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. …