Cracking The Code.Did You Know Efficient & Working Code Really Matters: Dynamic Programming

"Coding is just like talking to a unknown girl. Once you talked to her with guts, the next time you'll never afraid",Really? Yes , try it Now !!! Everything here is for education and learning purpose only , individual holds rights on outer posts/links etc. Team Cracking The Code

About Me

You have N guards in a line each with a demand of coins.You can skip paying a guard only if his demand is lesser than what you have totally paid before reaching him.Find the least number of coins you spend to cross all guards

Maximum Sum Subsequence in an unsorted array of size n

Given an array of length n, print all sub arrays of length r

How fast can robots can complete the given sequence

Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

Given Table of Cities , Find Minimum Number of Hopes Required to Fly From One to Other City

Provide an efficient algorithm to solve the question "Can I buy N items?

Coin Denomination Problem

You must partition the cities into two subsequences (not necessarily contiguous) such that person A visits all cities in the first subsequence (in order), person B visits all cities in the second subsequence (in order), and such that the sum of the total distances travelled by A and B is minimized.

Design An Algorithm to Exhibit Did You Mean Feature of Google Search Engine

Design an algorithm such that maximum number of jobs can be performed in that given time interval.

Painter Partition Problem

Find The Number of Unique Path in Maze Where Robot is Sitting at Top-Left Corner & Can Move According to Given Constraints

Avid TV Watcher

Design an algorithm to find the maximum number of apples you can collect ?

Yuckdonald's is considering opening a series of restaurants along Quaint Valley Highway (QVH).Give an efficient algorithm to compute the maximum expected total profit subject to the given constraints.

Write an algorithm that loots the maximum amount of money from row of houses.efficiently

You have a list of jobs that need to be scheduled. For each job, you know when it should start and when it should end. You need to come up with an algorithm to schedule the maximum number of jobs possible."

Given a positive integer n, find the minimum number of steps that takes n to 1 eg: 1.)For n = 1 , output: 0 2.) For n = 4 , output: 2 ( 4 /2 = 2 /2 = 1 ) 3.) For n = 7 , output: 3 ( 7 -1 = 6 /3 = 2 /2 = 1 )

Find the number of ways of writing a number as the sum of positive integers?