Search Results for: programming
Given a binary search tree root, convert it to a singly linked list using level order traversal. Constraints 1 ≤ n ≤ 100,000 where n is the number of …
You are given two binary search trees a and b and an integer target. Return whether there’s a number in a and a number in b such that their …
Given a list of integers nums and an integer k, let’s create a new set of possible elements { nums, nums], nums]], … } stopping before it’s out of …
Given an integer n, return whether its prime factors only include 2, 3 or 5. Constraints n ≤ 2**31 -1 Example 1 Input n = 10 Output true Explanation …
Given a positve integer n, find the length of its Collatz sequence. The Collatz sequence is generated sequentially where: n = n / 2 if n is even n …