C Programming – Maximum sum rectangle in a 2D matrix – Dynamic Programming Given a 2D array, find the maximum sum subarray in it.For example,
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.
BFS vs DFS for Binary Tree – A Tree is typically traversed in two ways: Breadth First Traversal (Or Level Order Traversal)
Java Programming – Maximum sum rectangle in a 2D matrix – Dynamic Programming – Given a 2D array, find the maximum sum subarray in it. For example
PYTHON Programming – Eulerian path and circuit for undirected graph – Eulerian Path is a path in graph that visits every edge exactly once.
C Programming – Subset Sum Problem – Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset
Print level order traversal line by line – Given a binary tree, print level order traversal in a way that nodes of all levels are printed in separate lines.
Java Programming – Subset Sum Problem – Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset
Python Program – Level Order Tree Traversal – Level order traversal of a tree is breadth first traversal for the tree. There are basically two functions
java program – Level Order Tree Traversal – Level order traversal of tree is breadth first traversal for the tree. There are basically two functions
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 tree data structure.