# Category - AlgorithmAnalysis of AlgorithmBacktrackingBit Algorithms:Branch and BoundDivide and ConquerDynamic ProgrammingGeometric AlgorithmsGraph AlgorithmsGreedy AlgorithmMathematical AlgorithmsRandomized AlgorithmsSearching and Sorting

## PYTHON programming Fleury’s Algorithm for printing Eulerian Path or Circuit

PYTHON 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...

## C++ programming Fleury’s Algorithm for printing Eulerian Path or Circuit

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...

## C Program Print BST keys in the given range

C Program Print BST keys in the given range - Binary Search Tree - Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree.

## Java Program Print BST keys in the given range

Java Program Print BST keys in the given range - Binary Search Tree - Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree.

## Cpp Algorithm – Length of the longest valid substring

C++ Algorithm - Length of the longest valid sub string - Stack - Given a string consisting of opening and closing parenthesis.

## C++ Programming – Check if an array can be divided into pairs whose sum is divisible by k

Given an array of integers and a number k, write a function that returns true if given array can be divided into pairs such that sum.

## Design a stack with operations on middle element

Design a stack with operations on middle element - Stack - The idea is to use Doubly Linked List (DLL). We can delete middle element in O(1) time

## Reverse a Doubly Linked List

Reverse a Doubly Linked List - Doubly Linked List - A simple method for reversing a Doubly Linked List. All we need to do is swap prev and next pointers.

## Java Program-Inorder Successor in Binary Search Tree

In order Successor in Binary Search Tree - Binary Search Tree - In order successor of a node is the next node in In order traversal of the Binary Tree.

## C Program-Inorder Successor in Binary Search Tree

C Program - In order Successor in Binary Search Tree - Binary Search Tree - In order Successor is NULL for the last node in In order traversal.