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
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.
C++ programming Eulerian path and circuit – undirected graph. Eulerian Path is a path in graph that visits every edge exactly once.
Level Order Tree Traversal – Level Order Tree Travers – level order tree travesal – here are basically two functions in this method.
PYTHON programming – Bridges in a graph – An edge in an undirected connected graph is a bridge iff removing it disconnects the graph.
queue data structure – implement queue using stacks The problem is opposite of this post. We are given a stack data structure
C++ Programming Inorder predecessor and successor for a given key in BST – I recently encountered with a question in an interview at e-commerce company.
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,
JAVA programming – Bridges in a graph – An edge in an undirected connected graph is a bridge iff removing it disconnects the graph.
python Programming Inorder predecessor and successor for a given key in BST – I recently encountered with a question in an interview at e-commerce company.
C – Programming Tree Traversals (Inorder, Preorder and Postorder) – Tree – Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which