Search for a command to run...
Series
In this series we will be exploring interview problems asked by various companies. This will be a complete random series and topics will vary from one Data structure to other. Stay tuned!!
Problem Statement Note: Your solution should have only one BST traversal and O(1) extra space complexity, since this is what you will be asked to accomplish in an interview. A tree is considered a binary search tree (BST) if for each of its nodes the...
Problem Statement: Given two binary trees t1 and t2, determine whether the second tree is a subtree of the first tree. Output for the above example is true. boolean isSubTree(Tree<Integer> t1, Tree<Integer> t2) { if (t2 == null) // Empty tree w...
Problem Statement: Given the inorder and preorder traversals of a binary tree t, but not t itself, restore t and return it. We can start by taking the first element of preorder array and set it as root, and then we can recursively make its left and ...
Problem Statement - Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. The output should be printed in sorted increasing order of strings Problem Link - https://practice.geeksforgee...
Problem Statement: Given a sorted integer array that does not contain any duplicates, return a summary of the number ranges it contains. Example For nums = [-1, 0, 1, 2, 6, 7, 9], the output should besolution(nums) = ["-1->2", "6->7", "9"]. String[] ...
Problem Link - https://leetcode.com/problems/generate-parentheses/ and https://www.interviewbit.com/problems/generate-all-parentheses-ii/ Method 1: Iterative solution using BFS class Solution { public List<String> generateParenthesis(int n) { ...
![Generate All Parentheses [Two Solutions]](https://cdn.hashnode.com/res/hashnode/image/upload/v1683060523830/a5d3c566-e94c-460c-8263-29f229224255.png)