Horje
Name Category Sub Category
Space Optimized DP Solution for 0-1 Knapsack Problem in Java Space Optimized DP Solution for 0-1 Knapsack Problem in Java Coding Tutorial
Minimize steps for Knight to collect maximum points (Knight in Geekland) Minimize steps for Knight to collect maximum points (Knight in Geekland) Coding Tutorial
Count paths with maximum sum from top-left to bottom-right cell (Adventure in a Maze) Count paths with maximum sum from top-left to bottom-right cell (Adventure in a Maze) Coding Tutorial
Minimum powers of P and Q to represent N Minimum powers of P and Q to represent N Coding Tutorial
Maximum profit using M money and reducing half price of at most K stocks Maximum profit using M money and reducing half price of at most K stocks Coding Tutorial
Find maximum number of people who can attend meeting Find maximum number of people who can attend meeting Coding Tutorial
Arrangements of N and M items of two types when max X and Y items of each can be consecutive Arrangements of N and M items of two types when max X and Y items of each can be consecutive Coding Tutorial
Minimize swap between same indexed elements to make given Arrays strictly increasing Minimize swap between same indexed elements to make given Arrays strictly increasing Coding Tutorial
Divide and Conquer Optimization in Dynamic Programming Divide and Conquer Optimization in Dynamic Programming Coding Tutorial
Knuth's Optimization in Dynamic Programming Knuth's Optimization in Dynamic Programming Coding Tutorial

Next>>


 

Horje