Compute the Deepest Leaves Sum of a Binary Tree using BFS or DFS Algorithms
Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = Output: 15 Constraints: The number of nodes in the tree is …
Category: algorithms
Find Out the Longest Arithmetic Sequence in Array Using Dynamic Programming Algorithm
Given an array A of integers, return the length of the longest arithmetic subsequence in A. Recall that a subsequence of A is a list A, A, …, A …
Find Numbers with Even Number of Digits using the Reduce Function in Javascript, C++ and Python
Given an array nums of integers, return how many of them contain an even number of digits. Example 1: Input: nums = Output: 2 Explanation: 12 contains 2 digits …
The Combination Function and Iterator using Depth First Search Algorithm
The combination algorithm returns the sequence for a list or string without considering the order. For example, the Combination of string “abc” with two characters would be “ab”, “ac” …
Compute the Sequential Digits within a Range using DFS, BFS, or Bruteforce Algorithms
An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers …