## Merging Overlapping Intervals

Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.

Read More Merging Overlapping IntervalsCoding made easy

Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.

Read More Merging Overlapping IntervalsGiven a sequence consisting of ‘I’ and ‘D’ where ‘I’ denotes increasing sequence and ‘D’ denotes the decreasing sequence. Decode the given sequence to construct minimum number without repeated digits.

Read More Decode the given sequence to construct minimum number without repeated digitsGiven a binary tree, find all ancestors of given node in it.

Read More Find ancestors of given node in a Binary TreeGiven a binary tree, write iterative and recursive solution to traverse the tree using in-order traversal. Unlike linked lists, one-dimensional arrays and other linear data structures, which are traversed in linear order, trees may be traversed in multiple ways in depth-first order (in-order, pre-order and post-order) or breadth-first order (level order traversal). Beyond these …

Read More Inorder Tree Traversal | Iterative & RecursiveGiven a binary tree, write iterative and recursive solution to traverse the tree using pre-order traversal. Unlike linked lists, one-dimensional arrays and other linear data structures, which are traversed in linear order, trees may be traversed in multiple ways in depth-first order (pre-order, pre-order and pre-order) or breadth-first order (level order traversal). Beyond these …

Read More Preorder Tree Traversal | Iterative & RecursiveGiven a binary tree, write iterative and recursive solution to traverse the tree using post-order traversal. Unlike linked lists, one-dimensional arrays and other linear data structures, which are traversed in linear order, trees may be traversed in multiple ways in depth-first order (post-order, pre-order and post-order) or breadth-first order (level order traversal). Beyond these …

Read More Postorder Tree Traversal | Iterative & RecursiveWrite an efficient algorithm to check if two binary trees are identical or not. i.e. if they have identical structure & their contents are also same. The idea is to traverse both trees and compare value at their root node. If the value matches, we recursively check if left subtree of first tree …

Read More Check if two binary trees are identical or not | Iterative & RecursiveGiven a line of text, reverse the text without reversing the individual words.

Read More Reverse text without reversing the individual wordsGiven a binary pattern that contains ‘?’ wildcard character at few positions, find all possible combinations of binary strings that can be formed by replacing the wildcard character by either 0 or 1.

Read More Find all binary strings that can be formed from given wildcard patternWrite iterative version of recursive Quicksort algorithm.

Read More Iterative Implementation of QuicksortWrite code to efficiently evaluate given postfix expression.

Read More Evaluate given postfix expressionGiven an balanced expression that can contain opening and closing parenthesis, check if the expression contains any duplicate parenthesis or not.

Read More Find duplicate parenthesis in an expressionGiven an expression containing opening and closing braces, check if it is balanced or not.

Read More Check if given expression is balanced expression or notFriends, this article lists some the of best courses available online on Data Structures and Algorithms. We recommend to go through them to have strong basics. Remember Learning Today, Building a Solid Foundation for a Brighter Tomorrow. Data Structures and Algorithms by Dr. Naveen Garg Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, …

Read More Best online courses for Data Structures And Algorithms