Introduction To Arrays
Introduction To Arrays
Subsets / Power-set Problem
In the Subsets problem, we find the power set of a given input using bitwise operations. In general, if we have n elements then the subsets are 2^n subsets.
Check Kth bit either '1' or '0'
Check Kth bit either '1' or '0'
Two Sum Problem
Two Sum problem is a classic problem. Let us solve this using five different types from brute force to an optimized approach using Hashtable.