QPrep Concept: Stack & Queue
M2: Evaluate Expression M3: Binary Tree Inorder Traversal M8: Subarray Sum Zero M4: Next Large Element M13: Connect Ropes M5: Binary Tree Zig Zag Level Order Traversal M14: Merge K-Sorted List M7: Permutation Pallindrome M11: Continous Median M9: First Lone Superstar M10: Kth Largest Element In Array M6: Kth Multiple M1: Validate Parenthesis M12: Frequent Words
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| About the QPrep Concept: Stack & Queue category |
|
1 | 16 | May 14, 2020 |
| Mock1 access of QPrep-Stack Queues |
|
4 | 26 | July 14, 2020 |
| Python: Using tuple in heap is a problem |
|
4 | 40 | June 20, 2020 |
| Couldn't able to write my code |
|
2 | 47 | June 13, 2020 |
| Hint regarding comparator for heap |
|
4 | 34 | June 11, 2020 |
| Failing base testcases |
|
13 | 44 | June 9, 2020 |
| Doubt regarding time complexity |
|
4 | 39 | June 1, 2020 |
| How to get the next greater element in order? |
|
6 | 49 | May 28, 2020 |
| Regards Improvement in the TestCases |
|
4 | 44 | May 28, 2020 |
| Test Cases Failing abruptly even after using the crio suggested approach (In Python) |
|
4 | 42 | May 25, 2020 |