Skip to content
  • Home
  • Algorithms
  • DS
  • Salesforce
  • Courses
    • C Programming
    • Data Structures with C/C++
    • Algorithms and Interview questions
    • ACCOUNTS
      • TALLY ERP9 Course Structure
  • Submit your article
Search
Close

Tag: Dynamic Programming

Minimum cost to reach the end of the array using recursion and dynamic programming

GalleryJune 13, 2020June 20, 2020 KodeBinary

Given an array of different costs(which is positive integers) of size ‘N.’ And a maximum possible jump from the current index to other index is ‘K.’ We aim to find the minimum cost to reach the end of the array. Let’s take below example to understand this problem better. In the above example, starting fromRead More »

Longest palindromic subsequence length of a string

GalleryJune 7, 2020June 7, 2020 KodeBinary

Given an input string of size ‘N’ characters. We aim to find maximum length subsequence which is palindromic. A subsequence string is a sequence that is formed by another sequence by removing zero or more characters. Whereas a palindrome string is a string that can be read the same from the backward as forward. WeRead More »

Longest common subsequence length of given two strings

GalleryJune 6, 2020June 6, 2020 KodeBinary

A subsequence is a sequence formed by another sequence after removal of 0 or more items from it. The order that items appear won’t change in the subsequence. In strings, a subsequence string generates by removing 0 or more characters from the parent string. A common subsequence is a subsequence generated from two string. Let’sRead More »

Counting Subsets with Sum in Unsorted Array

GalleryJune 3, 2020January 20, 2023 KodeBinary

We are aiming to find the total number of subsets with a given sum in an array of unsorted integers of size ‘N.’ For example, given an array {1, 2, 3, 4} and a sum of 6, the subsets with sum 6 are {1, 2, 3} and {2, 4}, making the count of subsets 2.Read More »

House thief problem (using recursion and dynamic programming)

GalleryMay 30, 2020May 30, 2020 KodeBinary

A thief knows all gold reserves of a neighborhood that is in a single row. Thief want’s to have a plan earlier on which houses he wants to steal. To avoid a triggering alarm his condition is to avoid stealing any two houses which are right next to each other. Let’s understand this problem withRead More »

0/1 Knapsack problem example with recursion and dynamic programming solutions

GalleryMay 29, 2020January 19, 2023 KodeBinary

The farmer has a knapsack with a capacity of “N” kgs, and he has products which weigh more than N kgs. He wants to fill the knapsack in such a way that he can maximize the money he can make from selling the products in the knapsack. He cannot cut the products, but he hasRead More »

Coin change problem (Find all number of combinations that formed a sum amount with given denominations)

GalleryMay 27, 2020January 19, 2023 KodeBinary

Our objective is to find the number of different combinations of coin denominations that can be used to make up a given monetary amount. Given a set of coin denominations and the target amount, we aim to determine the various ways in which these coins can be arranged to reach the desired total. To betterRead More »

Fibonacci series using recursion and dynamic programming

GalleryMay 25, 2020June 7, 2020 KodeBinary

Fibonacci series is a series of Fibonacci numbers. A Fibonacci number is denoted as the sum of its two preceding numbers in the series. These numbers are starting from 0 and 1. Let’s see the mathematical formula for the Fibonacci number. There is an exponential number of real-world applications on the Fibonacci numbers. As perRead More »

Best complexity edit distance algorithm with an example

GalleryMay 22, 2020May 23, 2020 KodeBinary

Edit distance The minimum number of operations on a string (array of characters) to convert into another input string is called the edit distance between the two strings. The operations can be Insert a character, Remove a character, or Replace a character with another. We can solve this problem using recursion. Now let’s take aRead More »

Find a subset of the given array with a given sum

GalleryMarch 29, 2019June 2, 2020 KodeBinary

Given an input array and a sum value as inputs and the algorithm needs to find whether there exists a subset of the input array which sums up to a given sum. Let’s try to understand the problem with some example input values. The should be a recursive solution to this problem. Let’s write aRead More »

Subscribe to KodeBinary

Enter your email address to subscribe KodeBinary and receive notifications of new posts by email.

Join 1,772 other subscribers

Recent Posts

  • Find the sum of the largest increasing branch in an n-ary tree
  • The fizzbuzz program in python
  • Python program to add two numbers
  • Program to find factorial of a number in python
  • Armstrong number in python

Our Partners

Home, Car Loan EMI Calculator

Categories

  • accounts
  • Algorithms
  • autoCAD
  • C
  • C++
  • COVID 19
  • DS
  • HTML
  • Java
  • ms office
  • Python
  • Salesforce
  • TALLY
  • Tally Prime
  • Uncategorized

Tags

Accounts Algorithms Amazon Ancillary Rules Arrays assignment bill of materials Binary Search Tree C++ company contra voucher cost categories cost centers C Programming DataStructures debit Dynamic Programming Graphs GROUPS groups and ledgers gst Interview Questions INVENTORY ledgers Linked List Microsoft payment voucher Purchase Python Queue Quiz receipt voucher Recursion sales Sorting Stack STOCK ITEMS Strings tally tallyerp9 tally prime TALLY WITH GST Trees Voucher vouchers

Follow Us

  • Facebook
  • Tumblr
  • Instagram
  • LinkedIn
  • Twitter
Copyrights 2019 | KodeBinary.com.
Back to top