C Programming – Subset Sum Problem
C Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine if...
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
Print level order traversal line by line
Print level order traversal line by line - Given a binary tree, print level order traversal in a way that nodes of all...
Java Programming – Subset Sum Problem
Java Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine...
Python program – Level Order Tree Traversal
Python Program - Level Order Tree Traversal - Level order traversal of a tree is breadth first traversal for the tree. There...
java program – Level Order Tree Traversal
java program - Level Order Tree Traversal - Level order traversal of tree is breadth first traversal for the tree. There are...
C program to check if a binary tree is BST or not
C program to check if a binary tree is BST or not - Binary Search Tree - A binary search tree (BST) is a node based binary...
Largest Independent Set Problem
Largest Independent Set Problem - Dynamic Programming subset of all tree nodes is an independent set if there is no edge...
C++ programming Eulerian path and circuit for undirected graph
C++ programming Eulerian path and circuit - undirected graph. Eulerian Path is a path in graph that visits every edge...
C program -Level Order Tree Traversal
Level Order Tree Traversal - Level Order Tree Travers - level order tree travesal - here are basically two functions in this...
PYTHON programming Bridges in a graph
PYTHON programming - Bridges in a graph - An edge in an undirected connected graph is a bridge iff removing it disconnects...
