Mobile Numeric Keypad Problem
Mobile Numeric Keypad Problem - Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up,...
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.
2834 Articles
Minimum Cost Polygon Triangulation
Minimum Cost Polygon Triangulation - Dynamic Programming A triangulation of a convex polygon is formed by drawing diagonals...
C Programming – Count ways to reach the n’th stair
C Programming - Count ways to reach the n’th stair - Dynamic Programming There are n stairs, a person standing at the bottom...
Java Programming – Count ways to reach the n’th stair
Java Programming - Count ways to reach the n’th stair - Dynamic Programming There are n stairs, a person standing at the...
Boolean Parenthesization Problem
Boolean Parenthesization Problem - Dynamic Programming Count the number of ways we can parenthesize the expression so that...
Java Programming – Count number of binary strings without consecutive 1’s
Java Programming - Count number of binary strings without consecutive 1’s - Dynamic Programming Positive integer, count all...
C Programming – Maximum sum rectangle in a 2D matrix
C Programming - Maximum sum rectangle in a 2D matrix - Dynamic Programming Given a 2D array, find the maximum sum subarray...
BFS vs DFS for Binary Tree
BFS vs DFS for Binary Tree - A Tree is typically traversed in two ways: Breadth First Traversal (Or Level Order Traversal)
Maximum sum rectangle in a 2D matrix
Java Programming - Maximum sum rectangle in a 2D matrix - Dynamic Programming - Given a 2D array, find the maximum sum...
Eulerian path and circuit for undirected graph
PYTHON Programming - Eulerian path and circuit for undirected graph - Eulerian Path is a path in graph that visits every...
