0 like 0 dislike
840 views
in FAANG | 840 views

0 like 0 dislike

Solve all these problems and you can clear any coding interview problem on this topic :-)

Stack Implementation using a Linked List
Implement a stack using the queue data structure
Implement a queue using the stack data structure
Design a stack that returns the minimum element in constant time
Design a stack that returns a minimum element without using an auxiliary stack
Implement two stacks in a single array
Recursive solution to sort a stack
Reverse a stack using recursion
Reverse a string using a stack data structure
Check if an expression is balanced or not
Find duplicate parenthesis in an expression
Evaluate a postfix expressio
Decode a given sequence to construct a minimum number without repeated digits
Merging Overlapping Intervals
Convert an infix expression into a postfix expression
Find the next greater element for every element in a circular array
Find the next greater element for every array element
Find the previous smaller element for each array element
Reverse an array in C++
Longest Increasing Subsequence Problem
Find all elements in an array that are greater than all elements to their right
Iterative Implementation of Quicksort
Find all binary strings that can be formed from a wildcard pattern
Find the length of the longest balanced parenthesis in a string
Reverse text without reversing individual words
Reverse a string without using recursion
Inorder Tree Traversal
Preorder Tree Traversal
Postorder Tree Traversal
Check if two binary trees are identical or not
Find ancestors of a given node in a binary tree
Iteratively print the leaf to root path for every leaf node in a binary tree
Find preorder traversal of a binary tree from its inorder and postorder sequence
Construction of an expression tree
Print complete Binary Search Tree (BST) in increasing order
Depth First Search (DFS)
Check whether the leaf traversal of given binary trees is the same or not
Reverse level order traversal of a binary tree
Invert Binary Tree
Invert alternate levels of a perfect binary tree
Depth-First Search (DFS) vs Breadth-First Search (BFS)

by Expert (19,320 points)