Python Algorithm – Next Greater Element
Python Algorithm - Next Greater Element - Stack - Given an array, print the Next Greater Element (NGE) for every element.
Delete a node in a Doubly Linked List
Delete a node in a Doubly Linked List - Doubly Linked List - If node to be deleted is head node, then change the head...
C++ Programming – Union and Intersection of two Linked Lists
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in...
Union and Intersection of two Linked Lists
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in...
Python Programming – Binary Tree in Vertical Order Hashmap based Method
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and...
C Programming – Union and Intersection of two Linked Lists
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in...
Cpp Algorithm – Next Greater Element
C++ Algorithm - Next Greater Element - Stack - Given an array, print the Next Greater Element (NGE) for every element. The...
C Algorithm – Next Greater Element
C Algorithm - Next Greater Element - Stack - Given an array, print the Next Greater Element (NGE) for every element. The...
C++ Programming – Find whether an array is subset of another array
Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not...
Sorted order printing of a given array that represents a BST
Sorted order printing of a given array that represents a BST - Binary Search Tree - Given an array that stores a complete...
