## Minimum Cost Path (DP Example)

Dynamic programming is a method for solving complex problems by breaking them down into simpler sub-problems. It is applicable to problems exhibiting the proper...

Skip to content
# Tag: programming

## Minimum Cost Path (DP Example)

Dynamic programming is a method for solving complex problems by breaking them down into simpler sub-problems. It is applicable to problems exhibiting the proper...

## Best Code to find n to the power k(n^k)

## Tips & Tweaks when programming Math !

To find n^k,using brute force, ALGORITHM- Initialize result to 1. Iterate from 1 to k and multiply n to result. Return result. CODE- result=1; for(i=1;i<=k;i...

In this post,I am going to tell you some tips and tricks which you should know & you can implement in your codes if required.You dont need to require long c...