Java Programming – Egg Dropping Puzzle
Java Programming - Egg Dropping Puzzle - Dynamic Programming description of instance of this famous puzzle involving n=2...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2835 Articles
C Programming-Find the two non repeating elements in an array of repeating elements
Find the two non-repeating elements in an array of repeating elements - Bit Algorithm - Given an array in which all numbers...
Rotate bits of a number
Rotate bits of a number - Bit Algorithm - A rotation (or circular shift)is an operation similar to shift except that the...
Compute the minimum or maximum of two integers without branching
Compute the minimum or maximum of two integers without branching - Bit Algorithm - On some rare machines where branching is...
C Programming – Compute modulus division by a power of 2 number
Compute modulus division by a power of 2 number - Bit Algorithm - operators, where d is a power of 2 number.Let it bit from...
Python Programming – 0-1 Knapsack Problem
Python Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
Java Programming – 0-1 Knapsack Problem
Java Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
Cpp Programming – 0-1 Knapsack Problem
C++ Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
C Programming-Backtracking Set 2 (Rat in a Maze)
C Programming-Backtracking Set 2 - Backtracking - A Maze is given as N*N binary matrix of blocks where source block is the...
C Programming – 0-1 Knapsack Problem
C Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and calculate...
