C++ Programming – Maximum Sum Increasing Subsequence – Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum
C++ programming
94 Articles
94
C++ Programming Multiply two polynomials – Mathematical Algorithms – A simple solution is to one by one consider every term of first polynomial and multiply
C++ Programming – How to check if an instance of 8 puzzle is solvable – Given a 3×3 board with 8 tiles (every tile has one number from 1 to 8) and one empty
C++ Programming – Cutting a Rod – Dynamic Programming Given a rod of length n inches and an array of prices that contains prices of all pieces of size small
C++ Programming-Find the Number Occurring Odd Number of Times – Bit Algorithm – Given an array of positive integers. All numbers occur even number of times
C++ Programming – Longest Palindromic Subsequence – Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence
C++ Programming – Egg Dropping Puzzle – Dynamic Programming description of instance of this famous puzzle involving n=2 eggs and a building with k=36 floors
C++ Programming – Find next greater number with same set of digits – Mathematical Algorithms – find the smallest number that has same set of digits as n
C++ Programming – Excel column name – Mathematical Algorithms – MS Excel columns has a pattern like A, B, C, … ,Z, AA, AB, AC,…. ,AZ, BA, BB, … ZZ, AAA, AAB
C++ Programming Program for nth Catalan Number – Mathematical Algorithms – Catalan numbers are a sequence of natural numbers that occurs in many interesting