BFS vs DFS for Binary Tree – A Tree is typically traversed in two ways: Breadth First Traversal (Or Level Order Traversal)
Algorithm
263 Articles
263
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
Largest Independent Set Problem – Dynamic Programming subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset
C++ programming Eulerian path and circuit – undirected graph. Eulerian Path is a path in graph that visits every edge exactly once.
PYTHON programming – Bridges in a graph – An edge in an undirected connected graph is a bridge iff removing it disconnects the graph.
Optimal Binary Search Tree – Dynamic Programming Given a sorted array keys[0.. n-1] of search keys and an array freq[0.. n-1] of frequency counts,