Coding

=**Spoj Problem pages: **= =**List of problems: **= > > > >
 * **[|13046. The Glittering Caves of Aglarond] **
 * **[|2157. Anti-Blot System] **
 * **[|4. Transform the Expression] **
 * **[|5. The Next Palindrome] **
 * 1) Convert an infix notation to reverse polish notation.
 * 2) Find the next bigger palindrome of a number.
 * 3) Coin-change problems.
 * 4) Find the number of ways a change can be made using a given denominations of currencies.
 * 5) Find the least number of coins required to make a change given a few denominations.
 * 6) Find a change such that no denomination is repeated.
 * 7) Significance of Pascals Identity
 * 8) nCr = (n-1)Cr +(n-1)C(r-1)
 * 9) Print all the anagrams together for a given number of words
 * 10) Union-find
 * 11) Dynamic connectivity problems.
 * 12) Quick-find
 * 13) Quick-union
 * 14) Weighted quick-union
 * 15) Path compression with weighted quick-union
 * 16) Add two numbers represented by a linked list.
 * 17) Reservoir sampling.
 * 18) Given an array of numbers, WAP to randomly select k numbers 1<=k<=n.
 * 19) Generate all permutations of a f=given array of values.
 * 20) Convert a number from base 2 to base 4,8,16 ......
 * 21) Given sorted circular linked list. Insert an element.
 * 22) Given two BSTs. Print all the common elements.
 * 23) Find if a binary tree is balanced.
 * 24) Remove duplicate elements from a string in O(n) time and O(1) space.
 * 25) Merge two sorted arrays into a single sorted array.
 * 26) Given an array, find all pairs whose sum is k.
 * 27) Find all pairs whose sum is >=k.
 * 28) Given an array find the maximum contiguous sub-array with maximum.
 * 29) Find LCA of two nodes in a BST.
 * 30) Given a sorted array which has been rotated an unknown number of times. Find the smallest element in O(log n) time.
 * 31) Box stacking.
 * 32) Given n boxes. Find the stack of maximum height such that length and breadth of any lower box is bigger than a given box in the stack.
 * 33) Longest increasing sub-sequence in an array.
 * 34) Union-find
 * 35) Dynamic connectivity problems.
 * 1) Union-find
 * 2) Dynamic connectivity problems.
 * 1) Union-find
 * 2) Dynamic connectivity problems.
 * 1) Union-find problem