C++ Programming – Longest Bitonic Subsequence – Dynamic Programming Array arr[0.n-1] containing positive integers, a subsequence of arr[] is called Bitonic
Coding
Latest Articles and Errors& Fixes fo popular programming languages like HTML,CSS, PHP, Javascript, Angularjs and more
C Programming – Longest Bitonic Subsequence – Dynamic Programming Array arr[0..n-1] containing n positive integers, a subsequence of arr[] is called Bitonic
C Programming – Replace all ‘0’ with ‘5’ in an input Integer – Mathematical Algorithms – The idea is simple, we get the last digit using mod operator ‘%’.
Count set bits in an integer in C Programming – Bit Algorithm – Simple Method Loop through all bits in an integer, check if bit is set and if then increment
C Programming – Maximum Sum Increasing Subsequence – Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum
C++ Programming – Maximum Sum Increasing Subsequence – Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum
Java Programming – Maximum Sum Increasing Subsequence – Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum
Python Programming – Maximum Sum Increasing Subsequence – Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum
Java Programming – Count ways to reach the n stair – Mathematical Algorithms – The time complexity of above solution is exponential.
C Programming – Count ways to reach the n stair – Mathematical Algorithms – There are n stairs, a person standing at the bottom wants to reach the top.