Posts

Bitwise Operation Link

Uva 11360 Solution

Uva 10057 Work Running

Uva 231 Solution

Longest Increasing Subsequence(N log N)

Uva 12531 Solution

Circular Array

Uva 11093 Solution

Uva 417 Solution

Uva 10855 Solution

STL accumulate() With Example

STL accumulate()

Uva 10905 Solution

Uva 10880 Solution

Uva 11136 Solution

Multiset Erase Function

Uva 11849 Solution

Uva 10226 Solution

Uva 11572 Solution

Uva 11286 Solution

Uva 230 Work Running

Uva 11239 Solution

Uva 12541 Solution

Uva 665 Solution

Uva 10295 Solution

Longest Increasing Subsequence Print

Longest Increasing Subsequence By Dynamic Programming

Longest Increasing Subsequence By Recursion

Uva 10815 Work running

Uva 12592 Solution

Uva 484 Solution

Uva 119 Solution

Uva 12157 Solution

Uva 12478 Solution

Uva 12554 Solution

gcd(a, b) + lcm(a, b) = x then a = ? and b = ?

Uva 12503 Solution

uva 10114 Work running

Minimum number of jumps to reach end of the array(By DP)

Minimum number of jumps to reach end of the array(By Recursion)

Binary Search Tree(Unorder input)

Uva 10003 Solution