How to Compute the N-th Tribonacci Number using Iterative Dynamic Programming Algorithm?
The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. …
How to Find the Largest Unique Number in Array (C++)?
Given an array of integers A, return the largest integer that only occurs once. If no integer occurs once, return -1. Example 1: Input: Output: 8 Explanation: The maximum …
How to Find the K-diff Pairs in an Array with Two Pointer or Hash Map?
Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as …
String Algorithm: Reverse the first k characters for every 2k characters
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are …
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 …
Algorithm to Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. You may assume that duplicates do not exist in the tree. For example, given preorder = inorder …