Objective: Write an algorithm to find The Longest Sequence Of Prefix Shared By All The Words In A String. This interesting problem was asked in the Google interview for software engineer. This problem is...
- Print Stack in reverse order.
- Sort a given stack – Using Recursion
- Given an array, Print sum of all subsets
- Determine the given routing number belong to which bank
- Check if interval is covered in given coordinates
- Lexicographically previous permutation With One swap
- Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N
- Number’s Complement – 2 Approaches
- Print all subsets of an array with a sum equal to zero
- Social Network Problem
Subscribe ( No Spams!!)