Python Algorithm to Determine an Armstrong Number
The k-digit number N is an Armstrong number if and only if the k-th power of each digit sums to N. Given a positive integer N, return true if …
Category: python
How to Generate Parentheses using Bruteforce or Depth First Search (Backtracking) Algorithms?
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: We can use the …
The Process Killing Algorithms using Depth First Search or Breadth First Search (Kill a Process)
Given n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or …
Two Pointer Algorithm to Find Maximum Two Sum Less Than K
June 30, 2019
algorithms, brute force, c / c++, data structure, Hash Map / Hash Set, python, Two Pointer
1 Comment
Given an array A of integers and integer K, return the maximum S such that there exists i < j with A + A = S and S < …
Coding Exercise: Sum of Digits in the Minimum Number
Given an array A of positive integers, let S be the sum of the digits of the minimal element of A. Return 0 if S is odd, otherwise return …