Given a list of coins and a target sum, find the number of ways to make that sum. Read the rest of this entry »

## Coin Change – HR

October 10, 2017## SPOJ – NSTEPS

October 8, 2017Starting from coordinate 0,0 if numbers are added to coordinates alternatively in diagonal (2 lines), find the number that is stored in x,y coordinate. If no number was stored, print “No Number”. Read the rest of this entry »

## SPOJ – HMRO

October 3, 2017Given transitive dependency of some string and duplication of the keys, use the keys that pertains to last value and the final value of the dependency to replace the original values. Read the rest of this entry »

## SPOJ – ONP

October 2, 2017Transform the expression to Reverse Polish Notation. Read the rest of this entry »

## Maximum SubArray – Leetcode

October 2, 2017Calculate the maximum sum between contiguous subarray. Read the rest of this entry »

## AIBOHP – SPOJ

September 28, 2017Find the minimum number of characters that needs to be added to a string to make is palindrome. Read the rest of this entry »

## ACMAKER – SPOJ

September 28, 2017Given a line that starts with acronym and has bunch of insignificant words. How many ways the acronym can be formed using significant (not insignificant) words so that each word has at least one char contributing to the acronym. Read the rest of this entry »

## SAMER08D – DNA Sequences – SPOJ

September 26, 2017Given two string, find the longest subsequence matching substrings of at least k sizes. Read the rest of this entry »

## Square Brackets – SPOJ

September 24, 2017Given n integers and k values <= 2n. Find the number of proper bracket expressions (proper starting and ending brackets) with “[” enforced in each p[k] positions. Read the rest of this entry »

## Create all possible combinations

September 24, 2017This was an attempt to solve SPOJ – SQRBR, but gives TLE. It explores all the options recursively, and without the use of dynamic programming. This technique can be used to generate all the combination of certain values. Read the rest of this entry »