Last active
October 30, 2021 18:24
-
-
Save KumarManoj-S/cd6fb09dd28b46eb63deeefc5a3f335c to your computer and use it in GitHub Desktop.
Important Interview Problems
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Convert a Binary Tree into its Mirror Tree | |
Print Right View of a Binary Tree | |
Print Left View of a Binary Tree | |
Print Bottom View of a Binary Tree | |
Print Top View of a Binary Tree | |
Topological sort | |
Permutation of a string | |
Trapping rain water problem | |
Check if a BT is a BST | |
Largest BST in a BT | |
Check if a BT is a subtree of another BT | |
Stock Span Problem | |
Lowest common ancestor in a BT | |
Find distance between two nodes in a BT | |
Next greatest element in an array | |
Print all interleavings of given two strings | |
Add two numbers represented by linked lists | |
Largest sum contiguous subarray | |
Diameter of a binary tree | |
Edit distance | |
BT/BST to DLL | |
Word ladder | |
Word search | |
LRU cache with Search O(1) TC | |
Find kth largest element in a number stream | |
Find the number of islands | |
Longest Possible Chunked Palindrome | |
0/1 Knapsack problem | |
Subset sum problem | |
Partition sum problem | |
Largest Sum Contiguous Subarray | |
Find smallest element in the rotated sorted array | |
Connect nodes at same level (Binary tree) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment