Java Algorithm – Check whether a given graph is Bipartite or not – Graph Algorithm – A Bipartite Graph is a graph whose vertices can be divided
JAVA
113 Articles
113
Java Programming – Longest Bitonic Subsequence – Dynamic Programming Array arr[0.n-1] containing positive integers, a subsequence of arr[] is called Bitonic
Java 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.
Java Programming – Cutting a Rod – Dynamic Programming A rod of length n inches and an array of prices that contains prices of all pieces of size small
JAVA Programming-Find the Number Occurring Odd Number of Times – Bit Algorithm – Given an array of positive integers. All numbers occur even number of times
Java Programming – Longest Palindromic Subsequence – Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence
Java Programming – Egg Dropping Puzzle – Dynamic Programming description of instance of this famous puzzle involving n=2 eggs and building with k=36 floors
Java Programming – Program for nth Catalan Number – Mathematical Algorithms – Catalan numbers are a sequence of natural numbers that occurs in many interest
Java Programming – 0-1 Knapsack Problem – Dynamic Programming simple solution is to consider all subsets of items and calculate the total weight and value