Home

The TODO list of problems

• Implement ABS without Conditional Branching
• All Subsets Generator using Backtracking
• Bidirectional Multiplied Array
• Bits Counter Methods
• Various Bitwise Manipulation exercises → First implementation provided, but this needs to be reorganized and cleaned: it’s too messy now
• Change Coins with Dynamic Programming
• Fibonacci (in 4 different flavours)
• First non-repeated Char in a String → Available in 2 versions
• Given a 2D Array of Int i = [0-9], find the largest Square-Sub-Array of Int of the same value
• Pascal’s Triangle Generator
• Polite Merge Sort → Added a for-fun version where I allocate a 1M random elements Int array and order it
• Prime Numbers Generator
• Mask out the bits of an Int that are not in a given range
• String Matching by Hashing → Useful to understand that naive string matching is so-slow
• Sudoku Solver → First implementation provided, but this needs clean up an a better next item selection logic
• Find the first common element in two sets