C++ programming Fleury’s Algorithm for printing Eulerian Path or Circuit – learn in 30 sec from microsoft awarded MVP,Eulerian Path is a path in graph that visits every edge exactly once.
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.
write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST).
The Celebrity Problem – Stack – In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes
Heaps are mainly used for implementing priority queue. We have discussed below heaps in previous posts. Binary Heap Binomial Heap In terms of Time Complexity, Fibonacci Heap beats both Binary…
Practice questions for Linked List and Recursion – Linked List – Assume the structure of a Linked List node is as follows.
Cpp Algorithm-Point arbit pointer to greatest value right side node in a linked list-Linked list
Given singly linked list with every node
Detect cycle in an undirected graph-Graph cycle-The time complexity of the union-find algorithm is O(ELogV). Like directed graphs.
Python Algorithm – Pairwise swap elements of a given linked list – Linked List – Given a singly linked list, write a function to swap elements pairwise
Java Algorithm – Pairwise swap elements of a given linked list – Linked List – Given a singly linked list, write a function to swap elements pairwise
Cpp Algorithm – Pairwise swap elements of a given linked list – Linked List – Given a singly linked list, write a function to swap elements pairwise