- Minimum number greater than the maximum of array which cannot be formed using the numbers in the array
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Minimum number of edges between two vertices of a graph using DFS
- Sum of all the Boundary Nodes of a Binary Tree
- Iterative Method To Print Left View of a Binary Tree
- Count the number of nodes at a given level in a tree using DFS
- Print Leaf Nodes at a given Level
- Reverse zigzag Traversal of a Binary Tree
- Print Stack Elements from Bottom to Top
- Print the first shortest root to leaf path in a Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Reverse Level Order traversal in spiral form
- Anti Clockwise spiral traversal of a binary tree
- Maximum length of the sub-array whose first and last elements are same
- Count the Number of Binary Search Trees present in a Binary Tree
- Minimum sum path between two leaves of a binary tree
- Check if two nodes in a Binary Tree are siblings
- Sum of nodes in top view of binary tree
- Sum of nodes in bottom view of Binary Tree
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Print leaf nodes in binary tree from left to right using one stack
- Reverse Anti Clockwise Spiral Traversal of a Binary Tree
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Count nodes with two children at level L in a Binary Tree
- Minimum value to add to arr[i] so that an array can be split at index i with equal sum
- Count the number of non-increasing subarrays
- Reverse Clockwise spiral traversal of a binary tree
- Kth node in Diagonal Traversal of Binary Tree
- Iterative approach to check if a Binary Tree is Perfect
- Iterative approach to check for children sum property in a Binary Tree
- Recursive Program to Print extreme nodes of each level of Binary Tree in alternate order
- Print all leaf nodes of a binary tree from right to left
- Maximum sum possible for a sub-sequence such that no two elements appear at a distance < K in the array
- Count of sub-strings that do not contain all the characters from the set {'a', 'b', 'c'} at the same time
- Count the number of pairs (i, j) such that either arr[i] is divisible by arr[j] or arr[j] is divisible by arr[i]
- Find the sum of the diagonal elements of the given N X N spiral matrix
- Program to count Number of connected components in an undirected graph
- Find the number of elements greater than k in a sorted array
- Minimum sub-array such that number of 1's in concatenation of binary representation of its elements is at least K
- Find number of unique triangles among given N triangles
- Check if the given Binary Expressions are valid
- Divide array into two parts with equal sum according to the given constraints
- Find the kth node in vertical order traversal of a Binary Tree
- Maximum length cycle that can be formed by joining two nodes of a binary tree
- Minimum length of the sub-string whose characters can be used to form a palindrome of length K
- Find minimum positive integer x such that a(x^2) + b(x) + c >= k
- Print 2-D co-ordinate points in ascending order followed by their frequencies
- Given a string and an integer k, find the kth sub-string when all the sub-strings are sorted according to the given condition
- Find the kth element in the series generated by the given N ranges
- Find the nth term of the given series
- Find the minimum of maximum length of a jump required to reach the last island in exactly k jumps
- Number of times the given string occurs in the array in the range [l, r]
- Minimum number of elements to be removed such that the sum of the remaining elements is equal to k
- Minimum time required to transport all the boxes from source to the destination under the given constraints
- Print the final string when minimum value strings get concatenated in every operation
- Kth largest node among all directly connected nodes to the given node in an undirected graph
- Check if it is possible to form string B from A under the given constraints

Sakshi_Srivastava hasn't improved any 'Articles' yet!