How to Compute the Surface Area of 3D Shapes (Cubes Placed on Grid Cells)?
On a N * N grid, we place some 1 * 1 * 1 cubes. Each value v = grid represents a tower of v cubes placed on top …
How to Find the Longest Harmonious Subsequence?
We define a harmounious array as an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer array, you need …
How to Find the Length of Longest Fibonacci Subsequence using Bruteforce or Dynamic Programming Algorithm?
October 23, 2019
algorithms, brute force, c / c++, dynamic programming, programming languages
No Comments
A sequence X_1, X_2, …, X_n is fibonacci-like if: n >= 3 X_i + X_{i+1} = X_{i+2} for all i + 2 <= n Given a strictly increasing array …
How to Find the Length of the Longest Increasing Subsequence using Dynamic Programming Algorithm?
Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is , therefore the length is 4. …
Facing Heads Probabilties of Tossing Strange Coins using Dynamic Programming Algorithm
October 20, 2019
algorithms, c / c++, DFS, Dynamic Programming, dynamic programming, Knapsack Problems, math, probability
No Comments
You have some coins. The i-th coin has a probability prob of facing heads when tossed. Return the probability that the number of coins facing heads equals target if …
How to Find the Missing Number In Arithmetic Progression?
In some array arr, the values were in arithmetic progression: the values arr – arr are all equal for every 0 <= i < arr.length – 1. Then, a …