{"status":{"code":200,"success":true,"message":"Sheet fetched successfully","error":null},"data":{"sheet":{"config":{"topicOrder":["Arrays","Arrays Part-II","Arrays Part-III","Arrays Part-IV","Linked List","Linked List Part-II","Linked List and Arrays","Greedy Algorithm","Recursion","Recursion and Backtracking","Binary Search","Heaps","Stack and Queue","Stack and Queue Part-II","String","String Part-II","Binary Tree","Binary Tree part-II","Binary Tree part-III","Binary Search Tree","Binary Search Tree Part-II","Binary Trees[Miscellaneous]","Graph","Graph Part-II","Dynamic Programming","Dynamic Programming Part-II","Trie"],"subTopicOrder":{},"questionOrder":["66e769be8a15c1adcdf77a4c","66e769be8a15c1adcdf77a50","66e769be8a15c1adcdf77a54","66e769be8a15c1adcdf77a58","66e769be8a15c1adcdf77a5c","66e769be8a15c1adcdf77a60","66e769be8a15c1adcdf77a64","66e769be8a15c1adcdf77a68","66e769be8a15c1adcdf77a6c","66e769be8a15c1adcdf77a70","66e769be8a15c1adcdf77a74","66e769be8a15c1adcdf77a78","66e769be8a15c1adcdf77a7c","66e769be8a15c1adcdf77a80","66e769be8a15c1adcdf77a84","66e769be8a15c1adcdf77a88","66e769be8a15c1adcdf77a8c","66e769be8a15c1adcdf77a90","66e769be8a15c1adcdf77a94","66e769be8a15c1adcdf77a98","66e769be8a15c1adcdf77a9c","66e769be8a15c1adcdf77aa0","66e769be8a15c1adcdf77aa4","66e769be8a15c1adcdf77aa8","66e769be8a15c1adcdf77aac","66e769be8a15c1adcdf77ab0","66e769be8a15c1adcdf77ab4","66e769be8a15c1adcdf77ab8","66e769be8a15c1adcdf77abc","66e769be8a15c1adcdf77ac0","66e769be8a15c1adcdf77ac4","66e769be8a15c1adcdf77ac8","66e769be8a15c1adcdf77acc","66e769be8a15c1adcdf77ad0","66e769be8a15c1adcdf77ad4","66e769be8a15c1adcdf77ad8","66e769be8a15c1adcdf77adc","66e769be8a15c1adcdf77ae0","66e769bf8a15c1adcdf77ae4","66e769bf8a15c1adcdf77ae8","66e769bf8a15c1adcdf77aec","66e769bf8a15c1adcdf77af0","66e769bf8a15c1adcdf77af4","66e769bf8a15c1adcdf77af8","66e769bf8a15c1adcdf77afc","66e769bf8a15c1adcdf77b01","66e769bf8a15c1adcdf77b05","66e769bf8a15c1adcdf77b09","66e769bf8a15c1adcdf77b0d","66e769bf8a15c1adcdf77b11","66e769bf8a15c1adcdf77b15","66e769bf8a15c1adcdf77b19","66e769bf8a15c1adcdf77b1d","66e769bf8a15c1adcdf77b21","66e769bf8a15c1adcdf77b25","66e769bf8a15c1adcdf77b29","66e769bf8a15c1adcdf77b2d","66e769bf8a15c1adcdf77b31","66e769bf8a15c1adcdf77b37","66e769bf8a15c1adcdf77b3b","66e769bf8a15c1adcdf77b3f","66e769bf8a15c1adcdf77b43","66e769bf8a15c1adcdf77b47","66e769bf8a15c1adcdf77b4b","66e769bf8a15c1adcdf77b4f","66e769bf8a15c1adcdf77b53","66e769bf8a15c1adcdf77b57","66e769bf8a15c1adcdf77b5b","66e769bf8a15c1adcdf77b5f","66e769bf8a15c1adcdf77b63","66e769bf8a15c1adcdf77b67","66e769bf8a15c1adcdf77b6b","66e769bf8a15c1adcdf77b6f","66e769bf8a15c1adcdf77b73","66e769bf8a15c1adcdf77b77","66e769bf8a15c1adcdf77b7b","66e769bf8a15c1adcdf77b7f","66e769bf8a15c1adcdf77b83","66e769bf8a15c1adcdf77b87","66e769bf8a15c1adcdf77b8b","66e769bf8a15c1adcdf77b8f","66e769bf8a15c1adcdf77b93","66e769bf8a15c1adcdf77b97","66e769bf8a15c1adcdf77b9b","66e769bf8a15c1adcdf77b9f","66e769bf8a15c1adcdf77ba3","66e769bf8a15c1adcdf77ba7","66e769bf8a15c1adcdf77bab","66e769bf8a15c1adcdf77baf","66e769bf8a15c1adcdf77bb3","66e769bf8a15c1adcdf77bb7","66e769bf8a15c1adcdf77bbd","66e769bf8a15c1adcdf77bc1","66e769bf8a15c1adcdf77bc5","66e769bf8a15c1adcdf77bc9","66e769bf8a15c1adcdf77bcd","66e769bf8a15c1adcdf77bd1","66e769bf8a15c1adcdf77bd5","66e769bf8a15c1adcdf77bd9","66e769bf8a15c1adcdf77bdd","66e769bf8a15c1adcdf77be1","66e769bf8a15c1adcdf77be5","66e769bf8a15c1adcdf77bea","66e769bf8a15c1adcdf77bee","66e769bf8a15c1adcdf77bf2","66e769bf8a15c1adcdf77bf6","66e769bf8a15c1adcdf77bfa","66e769bf8a15c1adcdf77bfe","66e769bf8a15c1adcdf77c02","66e769bf8a15c1adcdf77c06","66e769bf8a15c1adcdf77c0a","66e769bf8a15c1adcdf77c0e","66e769bf8a15c1adcdf77c12","66e769bf8a15c1adcdf77c16","66e769bf8a15c1adcdf77c1a","66e769bf8a15c1adcdf77c1e","66e769bf8a15c1adcdf77c22","66e769bf8a15c1adcdf77c26","66e769bf8a15c1adcdf77c2a","66e769bf8a15c1adcdf77c2e","66e769bf8a15c1adcdf77c32","66e769bf8a15c1adcdf77c36","66e769bf8a15c1adcdf77c3a","66e769bf8a15c1adcdf77c3e","66e769bf8a15c1adcdf77c42","66e769bf8a15c1adcdf77c46","66e769bf8a15c1adcdf77c4a","66e769bf8a15c1adcdf77c4e","66e769bf8a15c1adcdf77c52","66e769bf8a15c1adcdf77c56","66e769bf8a15c1adcdf77c5a","66e769bf8a15c1adcdf77c5e","66e769bf8a15c1adcdf77c62","66e769bf8a15c1adcdf77c66","66e769bf8a15c1adcdf77c6a","66e769bf8a15c1adcdf77c6e","66e769bf8a15c1adcdf77c72","66e769bf8a15c1adcdf77c76","66e769bf8a15c1adcdf77c7a","66e769bf8a15c1adcdf77c7e","66e769bf8a15c1adcdf77c82","66e769bf8a15c1adcdf77c86","66e769bf8a15c1adcdf77c8a","66e769bf8a15c1adcdf77c8e","66e769bf8a15c1adcdf77c92","66e769bf8a15c1adcdf77c96","66e769bf8a15c1adcdf77c9a","66e769bf8a15c1adcdf77c9e","66e769bf8a15c1adcdf77ca2","66e769bf8a15c1adcdf77ca6","66e769bf8a15c1adcdf77caa","66e769bf8a15c1adcdf77cae","66e769bf8a15c1adcdf77cb2","66e769bf8a15c1adcdf77cb6","66e769bf8a15c1adcdf77cba","66e769bf8a15c1adcdf77cbe","66e769bf8a15c1adcdf77cc2","66e769bf8a15c1adcdf77cc6","66e769bf8a15c1adcdf77cca","66e769bf8a15c1adcdf77cce","66e769bf8a15c1adcdf77cd3","66e769bf8a15c1adcdf77cd7","66e769bf8a15c1adcdf77cdb","66e769bf8a15c1adcdf77cdf","66e769bf8a15c1adcdf77ce3","66e769bf8a15c1adcdf77ce7","66e769bf8a15c1adcdf77ceb","66e769bf8a15c1adcdf77cef","66e769bf8a15c1adcdf77cf3","66e769bf8a15c1adcdf77cf7","66e769bf8a15c1adcdf77cfb","66e769bf8a15c1adcdf77cff","66e769bf8a15c1adcdf77d03","66e769bf8a15c1adcdf77d07","66e769c08a15c1adcdf77d0b","66e769c08a15c1adcdf77d0f","66e769c08a15c1adcdf77d13","66e769c08a15c1adcdf77d17","66e76a768a15c1adcdf77de2","66e76a768a15c1adcdf77e55","66e76a768a15c1adcdf77e5f","66e76a768a15c1adcdf77ea3","66e76a778a15c1adcdf77ee0","66e76a778a15c1adcdf77ee4","66e7713b8a15c1adcdf784e2","66e7713b8a15c1adcdf78520","66e7713b8a15c1adcdf78530","66e7713b8a15c1adcdf78534","66e7713b8a15c1adcdf78550","66e7713b8a15c1adcdf785cc","66e7713b8a15c1adcdf785e0"]},"forkedFrom":null,"forkedCount":0,"isPremium":false,"_id":"66e769b48a15c1adcdf77a47","author":"admin@codolio.com","link":"https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/","session":"ik34sv","name":"Striver SDE Sheet","description":"Striver SDE Sheet contains very handily crafted and picked top coding interview questions from different topics of Data Structures & Algorithms. These questions are one of the most asked coding interview questions in coding interviews of companies like Google, Amazon, Microsoft, Facebook, Swiggy, Flipkart, etc, and cover almost all of the concepts related to Data Structure & Algorithms.\n\nNote :  Due to legal and compliance requirements of TakeUForward (TUF), Codolio has updated the links to mirror the latest official TUF sheets. We made sure that your progress and notes remain fully intact , only the external links are updated","visibility":"public","followers":11388,"tag":["popular"],"createdAt":"2024-09-15T23:11:48.137Z","updatedAt":"2026-04-03T20:17:52.907Z","__v":5330,"banner":"https://d3hr337ydpgtsa.cloudfront.net/assets/banners/striver-sde-sheet.png","slug":"striver-sde-sheet","isFeaturedOnExplore":true,"isFollowing":false},"questions":[{"_id":"66e769be8a15c1adcdf77a4c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab320e","id":"73","platform":"leetcode","slug":"set-matrix-zeroes","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.620Z","description":"","difficulty":"Medium","name":"Set Matrix Zeroes","problemUrl":"https://leetcode.com/problems/set-matrix-zeroes","topics":["Arrays","HashMap and Set"],"updatedAt":"2026-03-29T00:06:17.590Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba08","66e093cd9e7bc1146bab4578"]},"topic":"Arrays","title":"Set Matrix Zeros","subTopic":null,"resource":"https://youtu.be/N0MgLvceX7M","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.708Z","updatedAt":"2024-09-15T23:11:58.708Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a50","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab341f","slug":"pascals-triangle","id":"118","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.827Z","description":"","difficulty":"Easy","name":"Pascal's Triangle","problemUrl":"https://leetcode.com/problems/pascals-triangle","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:09:49.214Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba60","66e093cd9e7bc1146bab45e1"]},"topic":"Arrays","title":"Pascal's Triangle","subTopic":null,"resource":"https://youtu.be/bR7mQgwQ_o8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.721Z","updatedAt":"2024-09-15T23:11:58.721Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a54","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab301f","id":"31","platform":"leetcode","slug":"next-permutation","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.430Z","description":"","difficulty":"Medium","name":"Next Permutation","problemUrl":"https://leetcode.com/problems/next-permutation","topics":["Arrays","Two Pointers"],"updatedAt":"2026-03-29T00:02:59.527Z","verified":true,"similarQuestions":["66e094169e7bc1146bac63d7","66e093cd9e7bc1146bab4613"]},"topic":"Arrays","title":"Next Permutation","subTopic":null,"resource":"https://youtu.be/JDOXKqF60RQ","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.729Z","updatedAt":"2024-09-15T23:11:58.729Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a58","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3120","id":"53","platform":"leetcode","slug":"maximum-subarray","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.529Z","description":"","difficulty":"Medium","name":"Maximum Subarray","problemUrl":"https://leetcode.com/problems/maximum-subarray","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:04:43.960Z","verified":true,"similarQuestions":["66e094149e7bc1146bac5a93","689b7f1d75f6e73b0388bd49","68cdd0a875f6e73b0375db78","66e094159e7bc1146bac5fcd","68cdd10d75f6e73b0375e03c","66e093cd9e7bc1146bab4515"]},"topic":"Arrays","title":"Kadane's Algorithm","subTopic":null,"resource":"https://youtu.be/AHZpyENo7k4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.737Z","updatedAt":"2024-09-15T23:11:58.737Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a5c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3226","id":"75","platform":"leetcode","slug":"sort-colors","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.627Z","description":"","difficulty":"Medium","name":"Sort Colors","problemUrl":"https://leetcode.com/problems/sort-colors","topics":["Arrays","Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:06:26.930Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba01","66e093ce9e7bc1146bab4c28"]},"topic":"Arrays","title":"Sort an array of 0's, 1's and 2's","subTopic":null,"resource":"https://www.youtube.com/watch?v=tp8JIuCXBaU&list=PLgUwDviBIf0oF6QL8m22w1hIDC1vJ_BHz&index=20","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.744Z","updatedAt":"2024-09-15T23:11:58.744Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a60","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3442","slug":"best-time-to-buy-and-sell-stock","id":"121","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.838Z","description":"","difficulty":"Easy","name":"Best Time to Buy and Sell Stock","problemUrl":"https://leetcode.com/problems/best-time-to-buy-and-sell-stock","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:10:03.503Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab428a"]},"topic":"Arrays","title":"Stock Buy and Sell","subTopic":null,"resource":"https://youtu.be/excAOvwF_Wk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.751Z","updatedAt":"2024-09-15T23:11:58.751Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a64","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab30e5","id":"48","platform":"leetcode","slug":"rotate-image","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.510Z","description":"","difficulty":"Medium","name":"Rotate Image","problemUrl":"https://leetcode.com/problems/rotate-image","topics":["Arrays"],"updatedAt":"2026-03-29T00:04:20.327Z","verified":true},"topic":"Arrays Part-II","title":"Rotate Matrix","subTopic":null,"resource":"https://youtu.be/Z0R2u6gd3GU","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.757Z","updatedAt":"2024-09-15T23:11:58.757Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a68","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3142","id":"56","platform":"leetcode","slug":"merge-intervals","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.539Z","description":"","difficulty":"Medium","name":"Merge Intervals","problemUrl":"https://leetcode.com/problems/merge-intervals","topics":["Arrays","Sorting"],"updatedAt":"2026-03-29T00:04:57.932Z","verified":true,"similarQuestions":["66e74d73013a40fbd1e32c7e","689b7f1c75f6e73b0388b9b9","66e093cd9e7bc1146bab4536"]},"topic":"Arrays Part-II","title":"Merge Overlapping Subintervals","subTopic":null,"resource":"https://youtu.be/IexN60k62jo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.763Z","updatedAt":"2024-09-15T23:11:58.763Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a6c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab32be","id":"88","platform":"leetcode","slug":"merge-sorted-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.679Z","description":"","difficulty":"Easy","name":"Merge Sorted Array","problemUrl":"https://leetcode.com/problems/merge-sorted-array","topics":["Arrays","Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:07:27.965Z","verified":true},"topic":"Arrays Part-II","title":"Merge two sorted arrays without extra space","subTopic":null,"resource":"https://youtu.be/n7uwj04E0I4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.769Z","updatedAt":"2024-09-15T23:11:58.769Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a70","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3bdc","slug":"find-the-duplicate-number","id":"287","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.637Z","description":"","difficulty":"Medium","name":"Find the Duplicate Number","problemUrl":"https://leetcode.com/problems/find-the-duplicate-number","topics":["Arrays","Two Pointers","Binary Search","Bit Manipulation"],"updatedAt":"2026-03-29T00:21:19.719Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bcb3"]},"topic":"Arrays Part-II","title":"Find the duplicate in an array of N+1 integers","subTopic":null,"resource":"https://www.youtube.com/watch?v=32Ll35mhWg0&list=PLgUwDviBIf0rPG3Ictpu74YWBQ1CaBkm2&index=1","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.777Z","updatedAt":"2024-09-15T23:11:58.777Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a74","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab4555","id":60,"platform":"interviewbit","slug":"repeat-and-missing-number-array","__v":0,"companyTags":["Amazon"],"createdAt":"2024-09-10T18:45:33.491Z","description":"","difficulty":"Medium","name":"Repeat and Missing Number Array","problemUrl":"https://www.interviewbit.com/problems/repeat-and-missing-number-array","topics":["Arrays"],"updatedAt":"2026-03-29T00:04:57.890Z","verified":true,"similarQuestions":["66e093d89e7bc1146babc25e"]},"topic":"Arrays Part-II","title":"Repeat and Missing Number","subTopic":null,"resource":"https://youtu.be/2D0D8HE6uak","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.784Z","updatedAt":"2024-09-15T23:11:58.784Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a78","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab321b","id":"74","platform":"leetcode","slug":"search-a-2d-matrix","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.624Z","description":"","difficulty":"Medium","name":"Search a 2D Matrix","problemUrl":"https://leetcode.com/problems/search-a-2d-matrix","topics":["Arrays","Binary Search"],"updatedAt":"2026-03-29T00:06:22.216Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4df4"]},"topic":"Arrays Part-III","title":"Search in a 2 D matrix","subTopic":null,"resource":"https://youtu.be/JXU4Akft7yk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.790Z","updatedAt":"2024-09-15T23:11:58.790Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a7c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab30fd","id":"50","platform":"leetcode","slug":"powx-n","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.518Z","description":"","difficulty":"Medium","name":"Pow(x, n)","problemUrl":"https://leetcode.com/problems/powx-n","topics":[],"updatedAt":"2026-03-29T00:04:29.740Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb27","689b7f9b75f6e73b0388f20e","66e093ce9e7bc1146bab4e52"]},"topic":"Arrays Part-III","title":"Pow(x, n)","subTopic":null,"resource":"https://youtu.be/l0YC3876qxg","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.796Z","updatedAt":"2024-09-15T23:11:58.796Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a80","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab367d","id":"169","platform":"leetcode","slug":"majority-element","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.077Z","description":"","difficulty":"Easy","name":"Majority Element","problemUrl":"https://leetcode.com/problems/majority-element","topics":["Arrays","HashMap and Set","Sorting"],"updatedAt":"2026-03-29T00:13:32.588Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bac6","66e093cd9e7bc1146bab41c0"]},"topic":"Arrays Part-III","title":"Majority Element (>n/2 times)","subTopic":null,"resource":"https://youtu.be/nP_ns3uSh80","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.802Z","updatedAt":"2024-09-15T23:11:58.802Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a84","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab393a","slug":"majority-element-ii","id":"229","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.329Z","description":"","difficulty":"Medium","name":"Majority Element II","problemUrl":"https://leetcode.com/problems/majority-element-ii","topics":["Arrays","HashMap and Set","Sorting"],"updatedAt":"2026-03-29T00:17:25.946Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb24"]},"topic":"Arrays Part-III","title":"Majority Element (n/3 times)","subTopic":null,"resource":"https://youtu.be/vwZj1K0e9U8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.811Z","updatedAt":"2024-09-15T23:11:58.811Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a88","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab318a","id":"62","platform":"leetcode","slug":"unique-paths","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.562Z","description":"","difficulty":"Medium","name":"Unique Paths","problemUrl":"https://leetcode.com/problems/unique-paths","topics":["Dynamic Programming"],"updatedAt":"2026-03-29T00:05:26.092Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab4225"]},"topic":"Arrays Part-III","title":"Grid Unique Paths","subTopic":null,"resource":"https://youtu.be/t_f0nwwdg5o","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.817Z","updatedAt":"2024-09-15T23:11:58.817Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a8c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab46af","id":"493","platform":"leetcode","slug":"reverse-pairs","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.604Z","description":"","difficulty":"Hard","name":"Reverse Pairs","problemUrl":"https://leetcode.com/problems/reverse-pairs","topics":["Arrays","Binary Search","Sorting"],"updatedAt":"2026-03-29T00:33:47.148Z","verified":true,"similarQuestions":["689b7f9b75f6e73b0388f2d8","689b7f1d75f6e73b0388bda0"]},"topic":"Arrays Part-III","title":"Reverse Pairs (Leetcode)","subTopic":null,"resource":"https://youtu.be/0e4bZaP3MDI","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.823Z","updatedAt":"2024-09-15T23:11:58.823Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a90","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ec9","platform":"leetcode","slug":"two-sum","id":"1","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.311Z","description":"","difficulty":"Easy","name":"Two Sum","problemUrl":"https://leetcode.com/problems/two-sum","topics":["Arrays","HashMap and Set"],"updatedAt":"2026-03-29T00:00:35.694Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b942","66e094159e7bc1146bac5c60","66e093cd9e7bc1146bab4886","66e093cd9e7bc1146bab4b79"]},"topic":"Arrays Part-IV","title":"2Sum Problem","subTopic":null,"resource":"https://youtu.be/UXDSeD9mN-k","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.829Z","updatedAt":"2024-09-15T23:11:58.829Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a94","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f8a","id":"18","platform":"leetcode","slug":"4sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.379Z","description":"","difficulty":"Medium","name":"4Sum","problemUrl":"https://leetcode.com/problems/4sum","topics":["Arrays","Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:02:02.096Z","verified":true},"topic":"Arrays Part-IV","title":"4-Sum Problem","subTopic":null,"resource":"https://youtu.be/eD95WRfh81c","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.835Z","updatedAt":"2024-09-15T23:11:58.835Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a98","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3494","platform":"leetcode","slug":"longest-consecutive-sequence","id":"128","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.866Z","description":"","difficulty":"Medium","name":"Longest Consecutive Sequence","problemUrl":"https://leetcode.com/problems/longest-consecutive-sequence","topics":["Arrays","HashMap and Set","Union & Find"],"updatedAt":"2026-03-29T00:10:39.265Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5c09","689b7f1c75f6e73b0388ba79","66e093cd9e7bc1146bab4b35"]},"topic":"Arrays Part-IV","title":"Longest Consecutive Sequence","subTopic":null,"resource":"https://www.youtube.com/watch?v=oO5uLE7EUlM&list=PLgUwDviBIf0oF6QL8m22w1hIDC1vJ_BHz&index=28","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.842Z","updatedAt":"2024-09-15T23:11:58.842Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77a9c","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375db64","platform":"tuf","slug":"longest-subarray-with-sum-k","createdAt":"2025-09-19T21:52:41.192Z","description":"","difficulty":"Medium","id":"longest-subarray-with-sum-k","name":"Longest Subarray with Sum K","problemUrl":"https://takeuforward.org/plus/dsa/problems/longest-subarray-with-sum-k","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094149e7bc1146bac5b29"]},"topic":"Arrays Part-IV","title":"Largest Subarray with K sum","subTopic":null,"resource":"https://youtu.be/frf7qxiN2qU","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.848Z","updatedAt":"2025-09-21T19:29:50.780Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77aa0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab5d94","id":12036,"platform":"interviewbit","slug":"subarray-with-given-xor","__v":0,"companyTags":["dunzo"],"createdAt":"2024-09-10T18:45:35.457Z","description":"","difficulty":"Medium","name":"Subarray with given XOR","problemUrl":"https://www.interviewbit.com/problems/subarray-with-given-xor","topics":["HashMap and Set"],"updatedAt":"2026-03-29T00:30:45.967Z","verified":true},"topic":"Arrays Part-IV","title":"Count number of subarrays with given xor K","subTopic":null,"resource":"https://youtu.be/eZr-6p0B7ME","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.854Z","updatedAt":"2024-09-15T23:11:58.854Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77aa4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ee1","id":"3","platform":"leetcode","slug":"longest-substring-without-repeating-characters","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.321Z","description":"","difficulty":"Medium","name":"Longest Substring Without Repeating Characters","problemUrl":"https://leetcode.com/problems/longest-substring-without-repeating-characters","topics":["HashMap and Set"],"updatedAt":"2026-03-29T00:00:46.353Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b944","66e093ce9e7bc1146bab4bb8"]},"topic":"Arrays Part-IV","title":"Longest Substring without repeat","subTopic":null,"resource":"https://www.youtube.com/watch?v=qtVh-XEpsJo&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=26","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.860Z","updatedAt":"2024-09-15T23:11:58.860Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77aa8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab382e","id":"206","platform":"leetcode","slug":"reverse-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.225Z","description":"","difficulty":"Easy","name":"Reverse Linked List","problemUrl":"https://leetcode.com/problems/reverse-linked-list","topics":["Linked Lists"],"updatedAt":"2026-03-29T00:15:55.833Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5bfc"]},"topic":"Linked List","title":"Reverse a LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=iRtLEoL-r-g&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=27","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.868Z","updatedAt":"2024-09-15T23:11:58.868Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77aac","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab5f33","id":"876","platform":"leetcode","slug":"middle-of-the-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:35.597Z","description":"","difficulty":"Easy","name":"Middle of the Linked List","problemUrl":"https://leetcode.com/problems/middle-of-the-linked-list","topics":["Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:53:12.396Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bfa7","66e094159e7bc1146bac5bc0"]},"topic":"Linked List","title":"Find the middle of LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=sGdwSH8RK-o&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=28","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.877Z","updatedAt":"2024-09-15T23:11:58.877Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ab0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2faa","id":"21","platform":"leetcode","slug":"merge-two-sorted-lists","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.391Z","description":"","difficulty":"Easy","name":"Merge Two Sorted Lists","problemUrl":"https://leetcode.com/problems/merge-two-sorted-lists","topics":["Linked Lists"],"updatedAt":"2026-03-29T00:02:16.212Z","verified":true,"similarQuestions":["66e094159e7bc1146bac620f","689b7f1c75f6e73b0388b969"]},"topic":"Linked List","title":"Merge two sorted Linked List (use method used in mergeSort)","subTopic":null,"resource":"https://www.youtube.com/watch?v=Xb4slcp1U38&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=29","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.883Z","updatedAt":"2024-09-15T23:11:58.883Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ab4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f97","id":"19","platform":"leetcode","slug":"remove-nth-node-from-end-of-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.385Z","description":"","difficulty":"Medium","name":"Remove Nth Node From End of List","problemUrl":"https://leetcode.com/problems/remove-nth-node-from-end-of-list","topics":["Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:02:06.771Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab4408"]},"topic":"Linked List","title":"Remove N-th node from back of LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=Lhu3MsXZy-Q&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=30","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.889Z","updatedAt":"2024-09-15T23:11:58.889Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ab8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ed3","id":"2","platform":"leetcode","slug":"add-two-numbers","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.316Z","description":"","difficulty":"Medium","name":"Add Two Numbers","problemUrl":"https://leetcode.com/problems/add-two-numbers","topics":["Linked Lists"],"updatedAt":"2026-03-29T00:00:40.896Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b929","66e093cd9e7bc1146bab43fb"]},"topic":"Linked List","title":"Add two numbers as LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=LBVsXSMOIk4&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=32","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.895Z","updatedAt":"2024-09-15T23:11:58.895Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77abc","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3999","id":"237","platform":"leetcode","slug":"delete-node-in-a-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.363Z","description":"","difficulty":"Medium","name":"Delete Node in a Linked List","problemUrl":"https://leetcode.com/problems/delete-node-in-a-linked-list","topics":["Linked Lists"],"updatedAt":"2026-03-29T00:17:57.164Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5f8e","689b7f1c75f6e73b0388bb2c"]},"topic":"Linked List","title":"Delete a given Node when a node is given.(0(1) solution)","subTopic":null,"resource":"https://www.youtube.com/watch?v=icnp4FJdZ_c&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=31","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.901Z","updatedAt":"2024-09-15T23:11:58.901Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ac0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3618","id":"160","platform":"leetcode","slug":"intersection-of-two-linked-lists","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.040Z","description":"","difficulty":"Easy","name":"Intersection of Two Linked Lists","problemUrl":"https://leetcode.com/problems/intersection-of-two-linked-lists","topics":["HashMap and Set","Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:12:58.063Z","verified":true},"topic":"Linked List Part-II","title":"Find intersection point of Y LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=u4FWXfgS8jw&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=33","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.909Z","updatedAt":"2024-09-15T23:11:58.909Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ac4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab352c","slug":"linked-list-cycle","id":"141","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.937Z","description":"","difficulty":"Easy","name":"Linked List Cycle","problemUrl":"https://leetcode.com/problems/linked-list-cycle","topics":["HashMap and Set","Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:11:42.528Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba91","66e093cd9e7bc1146bab4451"]},"topic":"Linked List Part-II","title":"Detect a cycle in Linked List","subTopic":null,"resource":"https://www.youtube.com/watch?v=354J83hX7RI&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=34","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.918Z","updatedAt":"2024-09-15T23:11:58.918Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ac8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2fd8","id":"25","platform":"leetcode","slug":"reverse-nodes-in-k-group","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.408Z","description":"","difficulty":"Hard","name":"Reverse Nodes in k-Group","problemUrl":"https://leetcode.com/problems/reverse-nodes-in-k-group","topics":["Linked Lists"],"updatedAt":"2026-03-29T00:02:32.175Z","verified":true},"topic":"Linked List Part-II","title":"Reverse a LinkedList in groups of size k.","subTopic":null,"resource":"https://www.youtube.com/watch?v=Of0HPkk3JgI&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=34","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.928Z","updatedAt":"2024-09-15T23:11:58.928Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77acc","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3972","id":"234","platform":"leetcode","slug":"palindrome-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.349Z","description":"","difficulty":"Easy","name":"Palindrome Linked List","problemUrl":"https://leetcode.com/problems/palindrome-linked-list","topics":["Linked Lists","Two Pointers","Queue and Stacks"],"updatedAt":"2026-03-29T00:17:45.560Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab557a"]},"topic":"Linked List Part-II","title":"Check if a LinkedList is palindrome or not.","subTopic":null,"resource":"https://www.youtube.com/watch?v=-DtNInqFUXs&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=36","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.940Z","updatedAt":"2024-09-15T23:11:58.940Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ad0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3539","id":"142","platform":"leetcode","slug":"linked-list-cycle-ii","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.941Z","description":"","difficulty":"Medium","name":"Linked List Cycle II","problemUrl":"https://leetcode.com/problems/linked-list-cycle-ii","topics":["HashMap and Set","Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:11:46.520Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bae0","66e093ce9e7bc1146bab513c"]},"topic":"Linked List Part-II","title":"Find the starting point of the Loop of LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=QfbOhn0WZ88&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=37","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.958Z","updatedAt":"2024-09-15T23:11:58.958Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ad4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbf6","platform":"tuf","slug":"flattening-of-ll","createdAt":"2025-09-19T21:52:41.676Z","description":"","difficulty":"Medium","id":"flattening-of-ll","name":"Flattening a Linked List","problemUrl":"https://takeuforward.org/plus/dsa/problems/flattening-of-ll","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab42d6"]},"topic":"Linked List Part-II","title":"Flattening of a LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=ysytSSXpAI0&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=38","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.965Z","updatedAt":"2025-09-21T19:29:50.778Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ad8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3180","id":"61","platform":"leetcode","slug":"rotate-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.559Z","description":"","difficulty":"Medium","name":"Rotate List","problemUrl":"https://leetcode.com/problems/rotate-list","topics":["Linked Lists","Two Pointers"],"updatedAt":"2026-03-29T00:05:21.388Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b9c9"]},"topic":"Linked List and Arrays","title":"Rotate a LinkedList","subTopic":null,"resource":"https://www.youtube.com/watch?v=9VPm6nEbVPA&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=39","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.971Z","updatedAt":"2024-09-15T23:11:58.971Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77adc","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab350b","platform":"leetcode","slug":"copy-list-with-random-pointer","id":"138","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.917Z","description":"","difficulty":"Medium","name":"Copy List with Random Pointer","problemUrl":"https://leetcode.com/problems/copy-list-with-random-pointer","topics":["HashMap and Set","Linked Lists"],"updatedAt":"2026-03-29T00:11:29.136Z","verified":true,"similarQuestions":["66e74d74013a40fbd1e32ea8","66e093ce9e7bc1146bab4b93"]},"topic":"Linked List and Arrays","title":"Clone a Linked List with random and next pointer","subTopic":null,"resource":"https://youtu.be/q570bKdrnlw?si=epZtpWvtNwuTf23o","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.980Z","updatedAt":"2024-09-15T23:11:58.980Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769be8a15c1adcdf77ae0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f65","id":"15","platform":"leetcode","slug":"3sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.366Z","description":"","difficulty":"Medium","name":"3Sum","problemUrl":"https://leetcode.com/problems/3sum","topics":["Arrays","Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:01:48.195Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b94f","66e094159e7bc1146bac5c1f","66e093ce9e7bc1146bab4c03"]},"topic":"Linked List and Arrays","title":"3 sum","subTopic":null,"resource":"https://youtu.be/DhFh8Kw7ymk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:58.990Z","updatedAt":"2024-09-15T23:11:58.990Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ae4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab30a0","id":"42","platform":"leetcode","slug":"trapping-rain-water","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.488Z","description":"","difficulty":"Hard","name":"Trapping Rain Water","problemUrl":"https://leetcode.com/problems/trapping-rain-water","topics":["Arrays","Two Pointers","Dynamic Programming","Queue and Stacks"],"updatedAt":"2026-03-29T00:03:51.295Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b9c6","66e093cd9e7bc1146bab448d"]},"topic":"Linked List and Arrays","title":"Trapping Rainwater","subTopic":null,"resource":"https://youtu.be/1_5VuquLbXg?si=NFG6df318_6OtGvg","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.001Z","updatedAt":"2024-09-15T23:11:59.001Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ae8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2fe5","id":"26","platform":"leetcode","slug":"remove-duplicates-from-sorted-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.411Z","description":"","difficulty":"Easy","name":"Remove Duplicates from Sorted Array","problemUrl":"https://leetcode.com/problems/remove-duplicates-from-sorted-array","topics":["Arrays","Two Pointers"],"updatedAt":"2026-03-29T00:02:36.019Z","verified":true},"topic":"Linked List and Arrays","title":"Remove Duplicate from Sorted array","subTopic":null,"resource":"https://youtu.be/37E9ckMDdTk?t=1888","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.011Z","updatedAt":"2024-09-15T23:11:59.011Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77aec","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab4635","id":"485","platform":"leetcode","slug":"max-consecutive-ones","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.568Z","description":"","difficulty":"Easy","name":"Max Consecutive Ones","problemUrl":"https://leetcode.com/problems/max-consecutive-ones","topics":["Arrays"],"updatedAt":"2026-03-29T00:33:21.438Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab52d9"]},"topic":"Linked List and Arrays","title":"Max consecutive ones","subTopic":null,"resource":"https://youtu.be/bYWLJb3vCWY?t=1124","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.021Z","updatedAt":"2024-09-15T23:11:59.021Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77af0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc03","platform":"tuf","slug":"n-meetings-in-one-room","createdAt":"2025-09-19T21:52:41.750Z","description":"","difficulty":"Easy","id":"n-meetings-in-one-room","name":"N meetings in one room","problemUrl":"https://takeuforward.org/plus/dsa/problems/n-meetings-in-one-room","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5cc4","66e093d19e7bc1146bab7996"]},"topic":"Greedy Algorithm","title":"N meetings in one room","subTopic":null,"resource":"https://youtu.be/mKfhTotEguk?si=2RELeq18mpmIIN3Q","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.031Z","updatedAt":"2025-09-21T19:29:50.779Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77af4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbfb","platform":"tuf","slug":"minimum-number-of-platforms-required-for-a-railway","createdAt":"2025-09-19T21:52:41.744Z","description":"","difficulty":"Medium","id":"minimum-number-of-platforms-required-for-a-railway","name":"Minimum Platforms","problemUrl":"https://takeuforward.org/plus/dsa/problems/minimum-number-of-platforms-required-for-a-railway","topics":[],"updatedAt":"2025-09-19T21:52:41.744Z","verified":true},"topic":"Greedy Algorithm","title":"Minimum number of platforms required for a railway","subTopic":null,"resource":"https://youtu.be/AsGzwR_FWok?si=165acXU_dtqOHuo9","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.037Z","updatedAt":"2025-09-21T19:29:50.777Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77af8","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc0c","platform":"tuf","slug":"job-sequencing-problem","createdAt":"2025-09-19T21:52:41.753Z","description":"","difficulty":"Medium","id":"job-sequencing-problem","name":"Job Sequencing Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/job-sequencing-problem","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5dca","66e093d19e7bc1146bab744f"]},"topic":"Greedy Algorithm","title":"Job sequencing Problem","subTopic":null,"resource":"https://youtu.be/QbwltemZbRg?si=wvcemJ5BLPlTRmkG","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.043Z","updatedAt":"2025-09-21T19:29:50.919Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77afc","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc01","platform":"tuf","slug":"fractional-knapsack","createdAt":"2025-09-19T21:52:41.751Z","description":"","difficulty":"Medium","id":"fractional-knapsack","name":"Fractional Knapsack","problemUrl":"https://takeuforward.org/plus/dsa/problems/fractional-knapsack","topics":[],"updatedAt":"2025-09-19T21:52:41.751Z","verified":true},"topic":"Greedy Algorithm","title":"Fractional Knapsack Problem","subTopic":null,"resource":"https://youtu.be/1ibsQrnuEEg?si=8R2By3wpHo0zZVHE","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.051Z","updatedAt":"2025-09-21T19:29:50.951Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b01","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbff","platform":"tuf","slug":"minimum-coins","createdAt":"2025-09-19T21:52:41.746Z","description":"","difficulty":"Easy","id":"minimum-coins","name":"Find Minimum Number Of Coins That Make A Change","problemUrl":"https://takeuforward.org/plus/dsa/problems/minimum-coins","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cc9e7bc1146bab3d78"]},"topic":"Greedy Algorithm","title":"Greedy algorithm to find minimum number of coins","subTopic":null,"resource":"https://www.youtube.com/watch?v=mVg9CfJvayM&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=48","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.058Z","updatedAt":"2025-09-21T19:29:50.956Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b05","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab446a","platform":"leetcode","slug":"assign-cookies","id":"455","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.422Z","description":"","difficulty":"Easy","name":"Assign Cookies","problemUrl":"https://leetcode.com/problems/assign-cookies","topics":["Arrays","Two Pointers","Greedy Algorithms","Sorting"],"updatedAt":"2026-03-29T00:31:43.084Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bcd1"]},"topic":"Greedy Algorithm","title":"Assign Cookies","subTopic":null,"resource":"https://youtu.be/DIX2p7vb9co?si=6G7JzMZ2TSP_LWSG","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.066Z","updatedAt":"2024-09-15T23:11:59.066Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b09","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc64","platform":"tuf","slug":"subset-sum-equals-to-target","createdAt":"2025-09-19T21:52:41.989Z","description":"","difficulty":"Medium","id":"subset-sum-equals-to-target","name":"Subset Sum Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/subset-sum-equals-to-target","topics":[],"updatedAt":"2025-09-19T21:52:41.989Z","verified":true},"topic":"Recursion","title":"Subset Sums","subTopic":null,"resource":"https://www.youtube.com/watch?v=rYkfBRtMJr8&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=52","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.078Z","updatedAt":"2025-09-21T19:29:50.956Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b0d","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab32d4","id":"90","platform":"leetcode","slug":"subsets-ii","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.687Z","description":"","difficulty":"Medium","name":"Subsets II","problemUrl":"https://leetcode.com/problems/subsets-ii","topics":["Arrays","Backtracking","Bit Manipulation"],"updatedAt":"2026-03-29T00:07:37.439Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba1a","689b7f9b75f6e73b0388f252","66e093cd9e7bc1146bab4acc"]},"topic":"Recursion","title":"Subset-II","subTopic":null,"resource":"https://www.youtube.com/watch?v=RIn3gOkbhQE&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=53","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.085Z","updatedAt":"2024-09-15T23:11:59.085Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b11","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab307e","id":"39","platform":"leetcode","slug":"combination-sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.477Z","description":"","difficulty":"Medium","name":"Combination Sum","problemUrl":"https://leetcode.com/problems/combination-sum","topics":["Arrays","Backtracking"],"updatedAt":"2026-03-29T00:03:37.107Z","verified":true,"similarQuestions":["66e74d73013a40fbd1e32dcc","66e093cd9e7bc1146bab4a31"]},"topic":"Recursion","title":"Combination sum-1","subTopic":null,"resource":"https://www.youtube.com/watch?v=OyZFFqQtu98&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=49","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.099Z","updatedAt":"2024-09-15T23:11:59.099Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b15","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3087","id":"40","platform":"leetcode","slug":"combination-sum-ii","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.480Z","description":"","difficulty":"Medium","name":"Combination Sum II","problemUrl":"https://leetcode.com/problems/combination-sum-ii","topics":["Arrays","Backtracking"],"updatedAt":"2026-03-29T00:03:41.760Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b989","66e093cd9e7bc1146bab4a6f"]},"topic":"Recursion","title":"Combination sum-2","subTopic":null,"resource":"https://www.youtube.com/watch?v=G1fRTGRxXU8&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=50","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.111Z","updatedAt":"2024-09-15T23:11:59.111Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b19","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab34b6","slug":"palindrome-partitioning","id":"131","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.877Z","description":"","difficulty":"Medium","name":"Palindrome Partitioning","problemUrl":"https://leetcode.com/problems/palindrome-partitioning","topics":["Dynamic Programming","Backtracking"],"updatedAt":"2026-03-29T00:10:55.493Z","verified":true,"similarQuestions":["68cdd10d75f6e73b0375e031","66e093cd9e7bc1146bab4afd"]},"topic":"Recursion","title":"Palindrome Partitioning","subTopic":null,"resource":"https://www.youtube.com/watch?v=WBgsABoClE0&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=51","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.117Z","updatedAt":"2024-09-15T23:11:59.117Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b1d","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3173","id":"60","platform":"leetcode","slug":"permutation-sequence","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.554Z","description":"","difficulty":"Hard","name":"Permutation Sequence","problemUrl":"https://leetcode.com/problems/permutation-sequence","topics":[],"updatedAt":"2026-03-29T00:05:16.729Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b9d7","66e093ce9e7bc1146bab54a6"]},"topic":"Recursion","title":"K-th permutation Sequence","subTopic":null,"resource":"https://www.youtube.com/watch?v=wT7gcXLYoao&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=55","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.123Z","updatedAt":"2024-09-15T23:11:59.123Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b21","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab30d0","id":"46","platform":"leetcode","slug":"permutations","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.504Z","description":"","difficulty":"Medium","name":"Permutations","problemUrl":"https://leetcode.com/problems/permutations","topics":["Arrays","Backtracking"],"updatedAt":"2026-03-29T00:04:10.922Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bd9a","689b7f1c75f6e73b0388b990","66e093cd9e7bc1146bab4a4f"]},"topic":"Recursion and Backtracking","title":"Print all permutations of a string/array","subTopic":null,"resource":"https://www.youtube.com/watch?v=f2ic2Rsc9pU&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=52","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.129Z","updatedAt":"2024-09-15T23:11:59.129Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b25","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3106","id":"51","platform":"leetcode","slug":"n-queens","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.521Z","description":"","difficulty":"Hard","name":"N-Queens","problemUrl":"https://leetcode.com/problems/n-queens","topics":["Arrays","Backtracking"],"updatedAt":"2026-03-29T00:04:34.442Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab4a7c"]},"topic":"Recursion and Backtracking","title":"N queens Problem","subTopic":null,"resource":"https://www.youtube.com/watch?v=i05Ju7AftcM&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=57","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.136Z","updatedAt":"2024-09-15T23:11:59.136Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b29","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3065","id":"37","platform":"leetcode","slug":"sudoku-solver","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.457Z","description":"","difficulty":"Hard","name":"Sudoku Solver","problemUrl":"https://leetcode.com/problems/sudoku-solver","topics":["Arrays","HashMap and Set","Backtracking"],"updatedAt":"2026-03-29T00:03:27.776Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab4a98"]},"topic":"Recursion and Backtracking","title":"Sudoko Solver","subTopic":null,"resource":"https://www.youtube.com/watch?v=FWAIf_EVUKE&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=58","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.142Z","updatedAt":"2024-09-15T23:11:59.142Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b2d","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbcb","platform":"tuf","slug":"m-coloring-problem","createdAt":"2025-09-19T21:52:41.590Z","description":"","difficulty":"Medium","id":"m-coloring-problem","name":"M-Coloring Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/m-coloring-problem","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093d09e7bc1146bab6439"]},"topic":"Recursion and Backtracking","title":"M Coloring Problem","subTopic":null,"resource":"https://www.youtube.com/watch?v=wuVwUK25Rfc&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=59","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.149Z","updatedAt":"2025-09-21T19:29:51.005Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b31","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbbf","platform":"tuf","slug":"rat-in-a-maze","createdAt":"2025-09-19T21:52:41.512Z","description":"","difficulty":"Medium","id":"rat-in-a-maze","name":"Rat in a Maze Problem - I","problemUrl":"https://takeuforward.org/plus/dsa/problems/rat-in-a-maze","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5c40","66e093cd9e7bc1146bab4681","689b7f1d75f6e73b0388bd26"]},"topic":"Recursion and Backtracking","title":"Rat in a Maze","subTopic":null,"resource":"https://www.youtube.com/watch?v=bLGZhJlt4y0&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=60","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.155Z","updatedAt":"2025-09-21T19:29:51.239Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b37","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375db93","slug":"matrix-median","platform":"tuf","createdAt":"2025-09-19T21:52:41.351Z","description":"","difficulty":"Hard","id":"matrix-median","name":"Median in a row-wise sorted Matrix","problemUrl":"https://takeuforward.org/plus/dsa/problems/matrix-median","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac66b0"]},"topic":"Binary Search","title":"Matrix Median","subTopic":null,"resource":"https://youtu.be/Q9wXgdxJq48?si=ScI_0uzJh7yg8nrX","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.166Z","updatedAt":"2025-09-21T19:29:51.265Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b3b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab49b7","id":"540","platform":"leetcode","slug":"single-element-in-a-sorted-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.858Z","description":"","difficulty":"Medium","name":"Single Element in a Sorted Array","problemUrl":"https://leetcode.com/problems/single-element-in-a-sorted-array","topics":["Arrays","Binary Search"],"updatedAt":"2026-03-29T00:36:19.408Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bd71"]},"topic":"Binary Search","title":"Find the element that appears once in a sorted array, and the rest element appears twice (Binary search)","subTopic":null,"resource":"https://www.youtube.com/watch?v=PzszoiY5XMQ&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=64","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.172Z","updatedAt":"2024-09-15T23:11:59.172Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b3f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3035","id":"33","platform":"leetcode","slug":"search-in-rotated-sorted-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.439Z","description":"","difficulty":"Medium","name":"Search in Rotated Sorted Array","problemUrl":"https://leetcode.com/problems/search-in-rotated-sorted-array","topics":["Arrays","Binary Search"],"updatedAt":"2026-03-29T00:03:08.845Z","verified":true},"topic":"Binary Search","title":"Search element in a sorted and rotated array/ find pivot where it is rotated","subTopic":null,"resource":"https://www.youtube.com/watch?v=r3pMQ8-Ad5s&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=64","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.179Z","updatedAt":"2024-09-15T23:11:59.179Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b43","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2eeb","id":"4","platform":"leetcode","slug":"median-of-two-sorted-arrays","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.325Z","description":"","difficulty":"Hard","name":"Median of Two Sorted Arrays","problemUrl":"https://leetcode.com/problems/median-of-two-sorted-arrays","topics":["Arrays","Binary Search"],"updatedAt":"2026-03-29T00:00:51.994Z","verified":true},"topic":"Binary Search","title":"Median of 2 sorted arrays","subTopic":null,"resource":"https://youtu.be/C2rRzz-JDk8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.188Z","updatedAt":"2024-09-15T23:11:59.188Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b47","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbf2","platform":"tuf","slug":"kth-element-of-2-sorted-arrays","createdAt":"2025-09-19T21:52:41.354Z","description":"","difficulty":"Medium","id":"kth-element-of-2-sorted-arrays","name":"K-th element of two  Arrays","problemUrl":"https://takeuforward.org/plus/dsa/problems/kth-element-of-2-sorted-arrays","topics":[],"updatedAt":"2025-09-19T21:52:41.354Z","verified":true},"topic":"Binary Search","title":"K-th element of two sorted arrays","subTopic":null,"resource":"https://www.youtube.com/watch?v=nv7F4PiLUzo&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=66","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.197Z","updatedAt":"2025-09-21T19:29:51.266Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b4b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab52ad","slug":"allocate-books","id":270,"platform":"interviewbit","__v":0,"companyTags":["Google","Flipkart"],"createdAt":"2024-09-10T18:45:34.649Z","description":"","difficulty":"Medium","name":"Allocate Books","problemUrl":"https://www.interviewbit.com/problems/allocate-books","topics":["Binary Search"],"updatedAt":"2026-03-29T00:19:38.173Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab4199"]},"topic":"Binary Search","title":"Allocate Minimum Number of Pages","subTopic":null,"resource":"https://www.youtube.com/watch?v=gYmWHvRHu-s&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=69","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.205Z","updatedAt":"2024-09-15T23:11:59.205Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b4f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e735c2aacdf227e1071480","id":"2lq516","slug":"AGGRCOW","name":"AGGRCOW","platform":"spoj","difficulty":"Hard","topics":[],"companyTags":[],"problemUrl":"https://www.spoj.com/problems/AGGRCOW/","verified":false,"createdAt":"2024-09-15T19:30:10.705Z","updatedAt":"2024-09-15T19:30:10.705Z","__v":0},"topic":"Binary Search","title":"Aggressive Cows","subTopic":null,"resource":"https://youtu.be/R_Mfw4ew-Vo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.212Z","updatedAt":"2024-09-15T23:11:59.212Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b53","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3895","id":"215","platform":"leetcode","slug":"kth-largest-element-in-an-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.272Z","description":"","difficulty":"Medium","name":"Kth Largest Element in an Array","problemUrl":"https://leetcode.com/problems/kth-largest-element-in-an-array","topics":["Arrays","Sorting"],"updatedAt":"2026-03-29T00:16:30.838Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab5206"]},"topic":"Heaps","title":"Kth Largest Element","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.218Z","updatedAt":"2024-09-15T23:11:59.218Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b57","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab5ad5","id":11051,"platform":"interviewbit","slug":"maximum-sum-combinations","__v":0,"companyTags":["Amazon","Liv.ai"],"createdAt":"2024-09-10T18:45:35.263Z","description":"","difficulty":"Medium","name":"Maximum Sum Combinations","problemUrl":"https://www.interviewbit.com/problems/maximum-sum-combinations","topics":["Heaps and Maps"],"updatedAt":"2026-03-29T00:28:16.077Z","verified":true},"topic":"Heaps","title":"Maximum Sum Combination","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.224Z","updatedAt":"2024-09-15T23:11:59.224Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b5b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3c37","slug":"find-median-from-data-stream","id":"295","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.671Z","description":"","difficulty":"Hard","name":"Find Median from Data Stream","problemUrl":"https://leetcode.com/problems/find-median-from-data-stream","topics":["Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:21:50.843Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4e12"]},"topic":"Heaps","title":"Find Median from Data Stream","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.230Z","updatedAt":"2024-09-15T23:11:59.230Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b5f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3e9b","id":"347","platform":"leetcode","slug":"top-k-frequent-elements","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.901Z","description":"","difficulty":"Medium","name":"Top K Frequent Elements","problemUrl":"https://leetcode.com/problems/top-k-frequent-elements","topics":["Arrays","HashMap and Set","Sorting"],"updatedAt":"2026-03-29T00:25:15.030Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bc01","68cdd0a875f6e73b0375db51"]},"topic":"Heaps","title":"K most frequent elements","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.235Z","updatedAt":"2024-09-15T23:11:59.235Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b63","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbdc","slug":"implement-stack-using-arrays","platform":"tuf","createdAt":"2025-09-19T21:52:41.597Z","description":"","difficulty":"Easy","id":"implement-stack-using-arrays","name":"Implement stack using array","problemUrl":"https://takeuforward.org/plus/dsa/problems/implement-stack-using-arrays","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5f1a","66e093cc9e7bc1146bab3909"]},"topic":"Stack and Queue","title":"Implement Stack using Arrays","subTopic":null,"resource":"https://youtu.be/tqQ5fTamIN4?si=ofLt8Zt1ZvhikZ6w","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.242Z","updatedAt":"2025-09-21T19:29:51.439Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b67","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbe2","platform":"tuf","slug":"implement-queue-using-arrays","createdAt":"2025-09-19T21:52:41.672Z","description":"","difficulty":"Basic","id":"implement-queue-using-arrays","name":"Queue Using Array","problemUrl":"https://takeuforward.org/plus/dsa/problems/implement-queue-using-arrays","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac60ef"]},"topic":"Stack and Queue","title":"Implement Queue using Arrays","subTopic":null,"resource":"https://youtu.be/tqQ5fTamIN4?si=ofLt8Zt1ZvhikZ6w","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.248Z","updatedAt":"2025-09-21T19:29:51.463Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b6b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3909","id":"225","platform":"leetcode","slug":"implement-stack-using-queues","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.313Z","description":"","difficulty":"Easy","name":"Implement Stack using Queues","problemUrl":"https://leetcode.com/problems/implement-stack-using-queues","topics":["Queue and Stacks","Queue and Stacks"],"updatedAt":"2026-03-29T00:17:10.215Z","verified":true,"similarQuestions":["68cdd0a875f6e73b0375dbdc"]},"topic":"Stack and Queue","title":"Implement Stack using Queue (using single queue)","subTopic":null,"resource":"https://youtu.be/tqQ5fTamIN4?si=ofLt8Zt1ZvhikZ6w","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.255Z","updatedAt":"2024-09-15T23:11:59.255Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b6f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab395f","id":"232","platform":"leetcode","slug":"implement-queue-using-stacks","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.342Z","description":"","difficulty":"Easy","name":"Implement Queue using Stacks","problemUrl":"https://leetcode.com/problems/implement-queue-using-stacks","topics":["Queue and Stacks","Queue and Stacks"],"updatedAt":"2026-03-29T00:17:37.644Z","verified":true,"similarQuestions":["66e094169e7bc1146bac6418"]},"topic":"Stack and Queue","title":"Implement Queue using Stack (0(1) amortized method)","subTopic":null,"resource":"https://youtu.be/tqQ5fTamIN4?si=ofLt8Zt1ZvhikZ6w","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.263Z","updatedAt":"2024-09-15T23:11:59.263Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b73","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2fa0","id":"20","platform":"leetcode","slug":"valid-parentheses","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.388Z","description":"","difficulty":"Easy","name":"Valid Parentheses","problemUrl":"https://leetcode.com/problems/valid-parentheses","topics":["Queue and Stacks"],"updatedAt":"2026-03-29T00:02:11.526Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b957","66e093cf9e7bc1146bab5c45"]},"topic":"Stack and Queue","title":"Check for balanced parentheses","subTopic":null,"resource":"https://youtu.be/xwjS0iZhw4I?si=UoyKpFn4Q3nf5h2R","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.272Z","updatedAt":"2024-09-15T23:11:59.272Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b77","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab46e6","id":"496","platform":"leetcode","slug":"next-greater-element-i","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.622Z","description":"","difficulty":"Easy","name":"Next Greater Element I","problemUrl":"https://leetcode.com/problems/next-greater-element-i","topics":["Arrays","HashMap and Set","Queue and Stacks"],"updatedAt":"2026-03-29T00:33:56.749Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab523a"]},"topic":"Stack and Queue","title":"Next Greater Element","subTopic":null,"resource":"https://youtu.be/e7XQLtOQM3I?si=QdcHpTtx6gAHsext","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.279Z","updatedAt":"2024-09-15T23:11:59.279Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b7b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dbb1","platform":"tuf","slug":"sort-a-stack","createdAt":"2025-09-19T21:52:41.505Z","description":"","difficulty":"Medium","id":"sort-a-stack","name":"Sort a stack","problemUrl":"https://takeuforward.org/plus/dsa/problems/sort-a-stack","topics":[],"updatedAt":"2025-09-19T21:52:41.505Z","verified":true},"topic":"Stack and Queue","title":"Sort a Stack","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.285Z","updatedAt":"2025-09-21T19:28:14.732Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b7f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab558a","slug":"nearest-smaller-element","id":332,"platform":"interviewbit","__v":0,"companyTags":["Amazon","Microsoft"],"createdAt":"2024-09-10T18:45:34.877Z","description":"","difficulty":"Easy","name":"Nearest Smaller Element","problemUrl":"https://www.interviewbit.com/problems/nearest-smaller-element","topics":["Queue and Stacks"],"updatedAt":"2026-03-29T00:22:43.633Z","verified":true},"topic":"Stack and Queue Part-II","title":"Next Smaller Element","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.290Z","updatedAt":"2024-09-15T23:11:59.290Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b83","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3569","id":"146","platform":"leetcode","slug":"lru-cache","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.960Z","description":"","difficulty":"Medium","name":"LRU Cache","problemUrl":"https://leetcode.com/problems/lru-cache","topics":["HashMap and Set","Linked Lists"],"updatedAt":"2026-03-29T00:12:01.959Z","verified":true,"similarQuestions":["66e094159e7bc1146bac62d4","689b7f1c75f6e73b0388baa0","68cdd0a875f6e73b0375dc15","66e093ce9e7bc1146bab50b3"]},"topic":"Stack and Queue Part-II","title":"LRU cache (IMPORTANT)","subTopic":null,"resource":"https://youtu.be/z9bJUPxzFOw?si=IUo_d35rXBD0CBAF","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.296Z","updatedAt":"2024-09-15T23:11:59.296Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b87","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab44b2","platform":"leetcode","slug":"lfu-cache","id":"460","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.443Z","description":"","difficulty":"Hard","name":"LFU Cache","problemUrl":"https://leetcode.com/problems/lfu-cache","topics":["HashMap and Set","Linked Lists"],"updatedAt":"2026-03-29T00:31:59.102Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bcd9"]},"topic":"Stack and Queue Part-II","title":"LFU cache","subTopic":null,"resource":"https://www.youtube.com/watch?v=0PSB9y8ehbk&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=79","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.301Z","updatedAt":"2024-09-15T23:11:59.301Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b8b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab328e","id":"84","platform":"leetcode","slug":"largest-rectangle-in-histogram","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.662Z","description":"","difficulty":"Hard","name":"Largest Rectangle in Histogram","problemUrl":"https://leetcode.com/problems/largest-rectangle-in-histogram","topics":["Arrays","Queue and Stacks"],"updatedAt":"2026-03-29T00:07:09.097Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba5a","66e093cd9e7bc1146bab44ad"]},"topic":"Stack and Queue Part-II","title":"Largest rectangle in a histogram","subTopic":null,"resource":"https://youtu.be/Bzat9vgD0fs?si=DiBlLejXcr6EJoyB","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.307Z","updatedAt":"2024-09-15T23:11:59.307Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b8f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab39b0","id":"239","platform":"leetcode","slug":"sliding-window-maximum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.375Z","description":"","difficulty":"Hard","name":"Sliding Window Maximum","problemUrl":"https://leetcode.com/problems/sliding-window-maximum","topics":["Arrays","Queue and Stacks"],"updatedAt":"2026-03-29T00:18:05.062Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb33"]},"topic":"Stack and Queue Part-II","title":"Sliding Window maximum","subTopic":null,"resource":"https://youtu.be/NwBvene4Imo?si=eU1PY-bcQfk5wdog","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.314Z","updatedAt":"2024-09-15T23:11:59.314Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b93","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab35d4","id":"155","platform":"leetcode","slug":"min-stack","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.003Z","description":"","difficulty":"Medium","name":"Min Stack","problemUrl":"https://leetcode.com/problems/min-stack","topics":["Queue and Stacks"],"updatedAt":"2026-03-29T00:12:38.349Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bab3","66e094159e7bc1146bac5df3","66e093cd9e7bc1146bab44db"]},"topic":"Stack and Queue Part-II","title":"Implement Min Stack","subTopic":null,"resource":"https://youtu.be/NdDIaH91P0g?si=4_Jbsq5trFvfSdUY","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.320Z","updatedAt":"2024-09-15T23:11:59.320Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b97","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d09e7bc1146bab66e5","slug":"rotting-oranges","id":"994","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:36.205Z","description":"","difficulty":"Medium","name":"Rotting Oranges","problemUrl":"https://leetcode.com/problems/rotting-oranges","topics":["Arrays","BFS"],"updatedAt":"2026-03-29T00:57:58.368Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388c045"]},"topic":"Stack and Queue Part-II","title":"Rotten Orange (Using BFS)","subTopic":null,"resource":"https://www.youtube.com/watch?v=yf3oUhkvqA0","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.325Z","updatedAt":"2024-09-15T23:11:59.325Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b9b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab60c9","id":"901","platform":"leetcode","slug":"online-stock-span","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:35.733Z","description":"","difficulty":"Medium","name":"Online Stock Span","problemUrl":"https://leetcode.com/problems/online-stock-span","topics":["Queue and Stacks"],"updatedAt":"2026-03-29T00:54:12.091Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bfd3"]},"topic":"Stack and Queue Part-II","title":"Stock span problem","subTopic":null,"resource":"https://youtu.be/eay-zoSRkVc?si=deNNe5i38BOAntha","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.330Z","updatedAt":"2024-09-15T23:11:59.330Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77b9f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e02a","platform":"tuf","slug":"maximum-of-minimums-for-every-window-size","createdAt":"2025-09-19T21:54:22.611Z","description":"","difficulty":"Hard","id":"maximum-of-minimums-for-every-window-size","name":"Maximum of minimum for every window size","problemUrl":"https://takeuforward.org/plus/dsa/problems/maximum-of-minimums-for-every-window-size","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66c1ce6bfe3d5bc2dbe3c0a3"]},"topic":"Stack and Queue Part-II","title":"Find the maximum of minimums of every window size","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.336Z","updatedAt":"2025-09-21T19:28:14.731Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ba3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab35a1","platform":"leetcode","slug":"reverse-words-in-a-string","id":"151","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.982Z","description":"","difficulty":"Medium","name":"Reverse Words in a String","problemUrl":"https://leetcode.com/problems/reverse-words-in-a-string","topics":["Two Pointers"],"updatedAt":"2026-03-29T00:12:21.121Z","verified":true,"similarQuestions":["689b7f9b75f6e73b0388f225"]},"topic":"String","title":"Reverse Words in a String","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.345Z","updatedAt":"2024-09-15T23:11:59.345Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ba7","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ef3","id":"5","platform":"leetcode","slug":"longest-palindromic-substring","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.328Z","description":"","difficulty":"Medium","name":"Longest Palindromic Substring","problemUrl":"https://leetcode.com/problems/longest-palindromic-substring","topics":["Two Pointers","Dynamic Programming"],"updatedAt":"2026-03-29T00:00:57.411Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5c14","66e093cd9e7bc1146bab499c"]},"topic":"String","title":"Longest Palindrome in a string","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.354Z","updatedAt":"2024-09-15T23:11:59.354Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bab","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f4e","id":"13","platform":"leetcode","slug":"roman-to-integer","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.358Z","description":"","difficulty":"Easy","name":"Roman to Integer","problemUrl":"https://leetcode.com/problems/roman-to-integer","topics":["HashMap and Set"],"updatedAt":"2026-03-29T00:01:38.783Z","verified":true},"topic":"String","title":"Roman Number to Integer and vice versa","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.364Z","updatedAt":"2024-09-15T23:11:59.364Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77baf","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f14","id":"8","platform":"leetcode","slug":"string-to-integer-atoi","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.339Z","description":"","difficulty":"Medium","name":"String to Integer (atoi)","problemUrl":"https://leetcode.com/problems/string-to-integer-atoi","topics":[],"updatedAt":"2026-03-29T00:01:13.731Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4cfa"]},"topic":"String","title":"Implement ATOI/STRSTR","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.373Z","updatedAt":"2024-09-15T23:11:59.373Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bb3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2f5b","id":"14","platform":"leetcode","slug":"longest-common-prefix","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.362Z","description":"","difficulty":"Easy","name":"Longest Common Prefix","problemUrl":"https://leetcode.com/problems/longest-common-prefix","topics":["Arrays"],"updatedAt":"2026-03-29T00:01:43.512Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5c69","66e093ce9e7bc1146bab4ca3"]},"topic":"String","title":"Longest Common Prefix","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.381Z","updatedAt":"2024-09-15T23:11:59.381Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bb7","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab531b","platform":"leetcode","slug":"repeated-string-match","id":"686","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.678Z","description":"","difficulty":"Medium","name":"Repeated String Match","problemUrl":"https://leetcode.com/problems/repeated-string-match","topics":[],"updatedAt":"2026-03-29T00:44:15.885Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388be4d"]},"topic":"String","title":"Rabin Karp","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.388Z","updatedAt":"2024-09-15T23:11:59.388Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bbd","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab568b","id":363,"platform":"interviewbit","slug":"minimum-characters-required-to-make-a-string-palindromic","__v":0,"companyTags":["Amazon","Microsoft"],"createdAt":"2024-09-10T18:45:34.946Z","description":"","difficulty":"Medium","name":"Minimum Characters required to make a String Palindromic","problemUrl":"https://www.interviewbit.com/problems/minimum-characters-required-to-make-a-string-palindromic","topics":["Strings"],"updatedAt":"2026-03-29T00:23:52.356Z","verified":true,"similarQuestions":["66e093d19e7bc1146bab77b6"]},"topic":"String Part-II","title":"Minimum characters needed to be inserted in the beginning to make it palindromic","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.398Z","updatedAt":"2024-09-15T23:11:59.398Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bc1","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab39d5","id":"242","platform":"leetcode","slug":"valid-anagram","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.401Z","description":"","difficulty":"Easy","name":"Valid Anagram","problemUrl":"https://leetcode.com/problems/valid-anagram","topics":["HashMap and Set","Sorting"],"updatedAt":"2026-03-29T00:18:16.662Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb38","66e094179e7bc1146bac7190"]},"topic":"String Part-II","title":"Check for Anagrams","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.403Z","updatedAt":"2024-09-15T23:11:59.403Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bc5","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab306f","id":"38","platform":"leetcode","slug":"count-and-say","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.461Z","description":"","difficulty":"Medium","name":"Count and Say","problemUrl":"https://leetcode.com/problems/count-and-say","topics":[],"updatedAt":"2026-03-29T00:03:32.413Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b99e","689b7f9b75f6e73b0388f227","66e093ce9e7bc1146bab4d58"]},"topic":"String Part-II","title":"Count and say","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.409Z","updatedAt":"2024-09-15T23:11:59.409Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bc9","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3650","slug":"compare-version-numbers","id":"165","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.062Z","description":"","difficulty":"Medium","name":"Compare Version Numbers","problemUrl":"https://leetcode.com/problems/compare-version-numbers","topics":["Two Pointers"],"updatedAt":"2026-03-29T00:13:17.218Z","verified":true,"similarQuestions":["689b7f9b75f6e73b0388f228","66e093ce9e7bc1146bab4d1f"]},"topic":"String Part-II","title":"Compare version numbers","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.415Z","updatedAt":"2024-09-15T23:11:59.415Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bcd","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3304","id":"94","platform":"leetcode","slug":"binary-tree-inorder-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.704Z","description":"","difficulty":"Easy","name":"Binary Tree Inorder Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-inorder-traversal","topics":["Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:07:56.361Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab53a9"]},"topic":"Binary Tree","title":"Inorder Traversal","subTopic":null,"resource":"https://www.youtube.com/watch?v=Z_NEgBgbRVI&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=7","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.420Z","updatedAt":"2024-09-15T23:11:59.420Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bd1","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3551","slug":"binary-tree-preorder-traversal","id":"144","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.949Z","description":"","difficulty":"Easy","name":"Binary Tree Preorder Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-preorder-traversal","topics":["Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:11:54.249Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4f90"]},"topic":"Binary Tree","title":"Preorder Traversal","subTopic":null,"resource":"https://youtu.be/RlUu72JrOCQ","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.426Z","updatedAt":"2024-09-15T23:11:59.426Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bd5","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab355c","platform":"leetcode","slug":"binary-tree-postorder-traversal","id":"145","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.954Z","description":"","difficulty":"Easy","name":"Binary Tree Postorder Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-postorder-traversal","topics":["Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:11:58.166Z","verified":true,"similarQuestions":["66e094169e7bc1146bac6687","689b7f1c75f6e73b0388ba9c","66e094199e7bc1146bac80ca","68cdd0a875f6e73b0375dc23","66e093ce9e7bc1146bab5003"]},"topic":"Binary Tree","title":"Postorder Traversal","subTopic":null,"resource":"https://youtu.be/COQOU6klsBg","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.435Z","updatedAt":"2024-09-15T23:11:59.435Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bd9","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3304","id":"94","platform":"leetcode","slug":"binary-tree-inorder-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.704Z","description":"","difficulty":"Easy","name":"Binary Tree Inorder Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-inorder-traversal","topics":["Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:07:56.361Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab53a9"]},"topic":"Binary Tree","title":"Morris Inorder Traversal","subTopic":null,"resource":"https://www.youtube.com/watch?v=80Zug6D1_r4&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=38","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.444Z","updatedAt":"2024-09-15T23:11:59.444Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bdd","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e020","platform":"tuf","slug":"right-left-view-of-bt","createdAt":"2025-09-19T21:54:22.607Z","description":"","difficulty":"Easy","id":"right-left-view-of-bt","name":"Left View of Binary Tree","problemUrl":"https://takeuforward.org/plus/dsa/problems/right-left-view-of-bt","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bae2"]},"topic":"Binary Tree","title":"LeftView Of Binary Tree","subTopic":null,"resource":"https://www.youtube.com/watch?v=KV4mRzTjlAk&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=25","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.455Z","updatedAt":"2025-09-21T19:28:14.910Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77be1","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc6d","platform":"tuf","slug":"bottom-view-of-bt","createdAt":"2025-09-19T21:52:41.992Z","description":"","difficulty":"Medium","id":"bottom-view-of-bt","name":"Bottom View of Binary Tree","problemUrl":"https://takeuforward.org/plus/dsa/problems/bottom-view-of-bt","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5d73"]},"topic":"Binary Tree","title":"Bottom View of Binary Tree","subTopic":null,"resource":"https://youtu.be/0FtVY6I4pB8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.461Z","updatedAt":"2025-09-21T19:29:51.630Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77be5","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc72","platform":"tuf","slug":"top-view-of-bt","createdAt":"2025-09-19T21:52:41.994Z","description":"","difficulty":"Medium","id":"top-view-of-bt","name":"Top View of Binary Tree","problemUrl":"https://takeuforward.org/plus/dsa/problems/top-view-of-bt","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5bb3"]},"topic":"Binary Tree","title":"Top View of Binary Tree","subTopic":null,"resource":"https://youtu.be/Et9OCDNvJ78","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.467Z","updatedAt":"2025-09-21T19:29:51.631Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bea","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d09e7bc1146bab666c","id":"987","platform":"leetcode","slug":"vertical-order-traversal-of-a-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:36.170Z","description":"","difficulty":"Hard","name":"Vertical Order Traversal of a Binary Tree","problemUrl":"https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree","topics":["HashMap and Set","Trees","DFS","BFS","Sorting"],"updatedAt":"2026-03-29T00:57:41.903Z","verified":true},"topic":"Binary Tree","title":"Vertical order traversal","subTopic":null,"resource":"https://youtu.be/q_a6lpbKJdw","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.475Z","updatedAt":"2024-09-15T23:11:59.475Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bee","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc29","platform":"tuf","slug":"print-root-to-note-path-in-bt","createdAt":"2025-09-19T21:52:41.829Z","description":"","difficulty":"Medium","id":"print-root-to-note-path-in-bt","name":"Root to Leaf Paths","problemUrl":"https://takeuforward.org/plus/dsa/problems/print-root-to-note-path-in-bt","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac684c","66e093cc9e7bc1146bab3a84"]},"topic":"Binary Tree","title":"Root to Node Path in Binary Tree","subTopic":null,"resource":"https://youtu.be/fmflMqVOC7k","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.481Z","updatedAt":"2025-09-21T19:29:51.762Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bf2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab51a9","platform":"leetcode","slug":"maximum-width-of-binary-tree","id":"662","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.580Z","description":"","difficulty":"Medium","name":"Maximum Width of Binary Tree","problemUrl":"https://leetcode.com/problems/maximum-width-of-binary-tree","topics":["Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:42:58.914Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388be15"]},"topic":"Binary Tree","title":"Max width of a Binary Tree","subTopic":null,"resource":"https://youtu.be/ZbybYvcVLks","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.487Z","updatedAt":"2024-09-15T23:11:59.487Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bf6","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab335e","id":"102","platform":"leetcode","slug":"binary-tree-level-order-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.738Z","description":"","difficulty":"Medium","name":"Binary Tree Level Order Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-level-order-traversal","topics":["Trees","BFS"],"updatedAt":"2026-03-29T00:08:33.773Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4eb3"]},"topic":"Binary Tree part-II","title":"Level order Traversal / Level order traversal in spiral form","subTopic":null,"resource":"https://youtu.be/EoAsWbO7sqg","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.492Z","updatedAt":"2024-09-15T23:11:59.492Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bfa","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3373","id":"104","platform":"leetcode","slug":"maximum-depth-of-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.745Z","description":"","difficulty":"Easy","name":"Maximum Depth of Binary Tree","problemUrl":"https://leetcode.com/problems/maximum-depth-of-binary-tree","topics":["Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:08:43.201Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba4f","66e093ce9e7bc1146bab4f9c"]},"topic":"Binary Tree part-II","title":"Height of a Binary Tree","subTopic":null,"resource":"https://youtu.be/eD3tmO66aBA","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.500Z","updatedAt":"2024-09-15T23:11:59.500Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77bfe","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab49f1","id":"543","platform":"leetcode","slug":"diameter-of-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.882Z","description":"","difficulty":"Easy","name":"Diameter of Binary Tree","problemUrl":"https://leetcode.com/problems/diameter-of-binary-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:36:29.034Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab56f3"]},"topic":"Binary Tree part-II","title":"Diameter of Binary Tree","subTopic":null,"resource":"https://youtu.be/Rezetez59Nk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.507Z","updatedAt":"2024-09-15T23:11:59.507Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c02","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab33be","slug":"balanced-binary-tree","id":"110","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.770Z","description":"","difficulty":"Easy","name":"Balanced Binary Tree","problemUrl":"https://leetcode.com/problems/balanced-binary-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:09:11.457Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4fba"]},"topic":"Binary Tree part-II","title":"Check if the Binary tree is height-balanced or not","subTopic":null,"resource":"https://youtu.be/Yt50Jfbd8Po","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.513Z","updatedAt":"2024-09-15T23:11:59.513Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c06","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab398b","id":"236","platform":"leetcode","slug":"lowest-common-ancestor-of-a-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.357Z","description":"","difficulty":"Medium","name":"Lowest Common Ancestor of a Binary Tree","problemUrl":"https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:17:53.185Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb2f","66e093ce9e7bc1146bab4f4d"]},"topic":"Binary Tree part-II","title":"LCA in Binary Tree","subTopic":null,"resource":"https://youtu.be/_-QHfMDde90","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.519Z","updatedAt":"2024-09-15T23:11:59.519Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c0a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3349","id":"100","platform":"leetcode","slug":"same-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.731Z","description":"","difficulty":"Easy","name":"Same Tree","problemUrl":"https://leetcode.com/problems/same-tree","topics":["Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:08:24.478Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba4d","66e093ce9e7bc1146bab5019"]},"topic":"Binary Tree part-II","title":"Check if two trees are identical or not","subTopic":null,"resource":"https://youtu.be/BhuvF_-PWS0","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.525Z","updatedAt":"2024-09-15T23:11:59.525Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c0e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3368","id":"103","platform":"leetcode","slug":"binary-tree-zigzag-level-order-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.742Z","description":"","difficulty":"Medium","name":"Binary Tree Zigzag Level Order Traversal","problemUrl":"https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal","topics":["Trees","BFS"],"updatedAt":"2026-03-29T00:08:38.449Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba47","66e093ce9e7bc1146bab503d"]},"topic":"Binary Tree part-II","title":"Zig Zag Traversal of Binary Tree","subTopic":null,"resource":"https://youtu.be/3OXWEdlIGl4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.530Z","updatedAt":"2024-09-15T23:11:59.530Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c12","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab4a10","id":"545","platform":"leetcode","slug":"boundary-of-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.891Z","description":"","difficulty":"Medium","name":"Boundary of Binary Tree","problemUrl":"https://leetcode.com/problems/boundary-of-binary-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:36:35.432Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bd85"]},"topic":"Binary Tree part-II","title":"Boundary Traversal of Binary Tree","subTopic":null,"resource":"https://youtu.be/0ca1nvR0be4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.538Z","updatedAt":"2024-09-15T23:11:59.538Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c16","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3464","id":"124","platform":"leetcode","slug":"binary-tree-maximum-path-sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.850Z","description":"","difficulty":"Hard","name":"Binary Tree Maximum Path Sum","problemUrl":"https://leetcode.com/problems/binary-tree-maximum-path-sum","topics":["Dynamic Programming","Trees","DFS"],"updatedAt":"2026-03-29T00:10:17.548Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba72"]},"topic":"Binary Tree part-III","title":"Maximum path sum","subTopic":null,"resource":"https://youtu.be/WszrfSwMz58","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.549Z","updatedAt":"2024-09-15T23:11:59.549Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c1a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3382","id":"105","platform":"leetcode","slug":"construct-binary-tree-from-preorder-and-inorder-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.749Z","description":"","difficulty":"Medium","name":"Construct Binary Tree from Preorder and Inorder Traversal","problemUrl":"https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal","topics":["Arrays","HashMap and Set","Trees"],"updatedAt":"2026-03-29T00:08:47.898Z","verified":true,"similarQuestions":["66e094159e7bc1146bac6126"]},"topic":"Binary Tree part-III","title":"Construct Binary Tree from inorder and preorder","subTopic":null,"resource":"https://youtu.be/aZNaLrVebKQ","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.558Z","updatedAt":"2024-09-15T23:11:59.558Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c1e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab338b","id":"106","platform":"leetcode","slug":"construct-binary-tree-from-inorder-and-postorder-traversal","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.752Z","description":"","difficulty":"Medium","name":"Construct Binary Tree from Inorder and Postorder Traversal","problemUrl":"https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal","topics":["Arrays","HashMap and Set","Trees"],"updatedAt":"2026-03-29T00:08:52.609Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba46","66e093ce9e7bc1146bab4fad"]},"topic":"Binary Tree part-III","title":"Construct Binary Tree from Inorder and Postorder","subTopic":null,"resource":"https://youtu.be/LgLRTaEMRVc","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.566Z","updatedAt":"2024-09-15T23:11:59.566Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c22","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3353","id":"101","platform":"leetcode","slug":"symmetric-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.734Z","description":"","difficulty":"Easy","name":"Symmetric Tree","problemUrl":"https://leetcode.com/problems/symmetric-tree","topics":["Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:08:29.139Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba33","66e093ce9e7bc1146bab4ff2"]},"topic":"Binary Tree part-III","title":"Symmetric Binary Tree","subTopic":null,"resource":"https://youtu.be/nKggiEpBE","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.574Z","updatedAt":"2024-09-15T23:11:59.574Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c26","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab33ef","id":"114","platform":"leetcode","slug":"flatten-binary-tree-to-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.805Z","description":"","difficulty":"Medium","name":"Flatten Binary Tree to Linked List","problemUrl":"https://leetcode.com/problems/flatten-binary-tree-to-linked-list","topics":["Linked Lists","Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:09:30.357Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba5b","66e093ce9e7bc1146bab4f71"]},"topic":"Binary Tree part-III","title":"Flatten Binary Tree to LinkedList","subTopic":null,"resource":"https://youtu.be/sWf7k1x9XR4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.588Z","updatedAt":"2024-09-15T23:11:59.588Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c2a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e035","platform":"tuf","slug":"check-for-symmetrical-bts","createdAt":"2025-09-19T21:54:22.840Z","description":"","difficulty":"Easy","id":"check-for-symmetrical-bts","name":"Mirror Tree","problemUrl":"https://takeuforward.org/plus/dsa/problems/check-for-symmetrical-bts","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba33"]},"topic":"Binary Tree part-III","title":"Check if Binary Tree is the mirror of itself or not","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.597Z","updatedAt":"2025-09-21T19:28:14.911Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c2e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc11","platform":"tuf","slug":"children-sum-property-in-binary-tree","createdAt":"2025-09-19T21:52:41.824Z","description":"","difficulty":"Medium","id":"children-sum-property-in-binary-tree","name":"Children Sum in a Binary Tree","problemUrl":"https://takeuforward.org/plus/dsa/problems/children-sum-property-in-binary-tree","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac61cf"]},"topic":"Binary Tree part-III","title":"Check for Children Sum Property","subTopic":null,"resource":"https://youtu.be/fnmisPM6cVo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.602Z","updatedAt":"2025-09-21T19:29:51.813Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c32","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3406","slug":"populating-next-right-pointers-in-each-node","id":"116","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.818Z","description":"","difficulty":"Medium","name":"Populating Next Right Pointers in Each Node","problemUrl":"https://leetcode.com/problems/populating-next-right-pointers-in-each-node","topics":["Linked Lists","Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:09:39.776Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab5065"]},"topic":"Binary Search Tree","title":"Populate Next Right pointers of Tree","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.608Z","updatedAt":"2024-09-15T23:11:59.608Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c36","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab5401","slug":"search-in-a-binary-search-tree","id":"700","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.739Z","description":"","difficulty":"Easy","name":"Search in a Binary Search Tree","problemUrl":"https://leetcode.com/problems/search-in-a-binary-search-tree","topics":["Trees"],"updatedAt":"2026-03-29T00:45:01.157Z","verified":true},"topic":"Binary Search Tree","title":"Search given Key in BST","subTopic":null,"resource":"https://youtu.be/KcNt6v_56cc","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.613Z","updatedAt":"2024-09-15T23:11:59.613Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c3a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab33a5","slug":"convert-sorted-array-to-binary-search-tree","id":"108","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.760Z","description":"","difficulty":"Easy","name":"Convert Sorted Array to Binary Search Tree","problemUrl":"https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree","topics":["Arrays","Trees"],"updatedAt":"2026-03-29T00:09:02.058Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba41","66e093ce9e7bc1146bab4fd0"]},"topic":"Binary Search Tree","title":"Construct BST from given keys","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.618Z","updatedAt":"2024-09-15T23:11:59.618Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c3e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d09e7bc1146bab67c2","platform":"leetcode","slug":"construct-binary-search-tree-from-preorder-traversal","id":"1008","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:36.263Z","description":"","difficulty":"Medium","name":"Construct Binary Search Tree from Preorder Traversal","problemUrl":"https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal","topics":["Arrays","Queue and Stacks","Trees"],"updatedAt":"2026-03-29T00:58:32.363Z","verified":true},"topic":"Binary Search Tree","title":"Construct a BST from a preorder traversal","subTopic":null,"resource":"https://youtu.be/UmJT3j26t1I","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.625Z","updatedAt":"2024-09-15T23:11:59.625Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c42","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3332","id":"98","platform":"leetcode","slug":"validate-binary-search-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.723Z","description":"","difficulty":"Medium","name":"Validate Binary Search Tree","problemUrl":"https://leetcode.com/problems/validate-binary-search-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:08:15.055Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba4b","66e093ce9e7bc1146bab4f7f"]},"topic":"Binary Search Tree","title":"Check is a BT is BST or not","subTopic":null,"resource":"https://youtu.be/f-sj7I5oXEI","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.631Z","updatedAt":"2024-09-15T23:11:59.631Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c46","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3982","slug":"lowest-common-ancestor-of-a-binary-search-tree","id":"235","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.353Z","description":"","difficulty":"Medium","name":"Lowest Common Ancestor of a Binary Search Tree","problemUrl":"https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:17:49.361Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bb2d","66e094159e7bc1146bac625b","66e094199e7bc1146bac84b2"]},"topic":"Binary Search Tree","title":"Find LCA of two nodes in BST","subTopic":null,"resource":"https://youtu.be/cX_kPV_foZc","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.640Z","updatedAt":"2024-09-15T23:11:59.640Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c4a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e036","platform":"tuf","slug":"inorder-successor-and-predecessor-in-bst","createdAt":"2025-09-19T21:54:22.691Z","description":"","difficulty":"Medium","id":"inorder-successor-and-predecessor-in-bst","name":"Predecessor and Successor","problemUrl":"https://takeuforward.org/plus/dsa/problems/inorder-successor-and-predecessor-in-bst","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab47cc"]},"topic":"Binary Search Tree","title":"Find the inorder predecessor/successor of a given Key in BST.","subTopic":null,"resource":"https://youtu.be/SXKAD2svfmI","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.648Z","updatedAt":"2025-09-21T19:28:14.911Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c4e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3945","slug":"kth-smallest-element-in-a-bst","id":"230","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.333Z","description":"","difficulty":"Medium","name":"Kth Smallest Element in a BST","problemUrl":"https://leetcode.com/problems/kth-smallest-element-in-a-bst","topics":["Trees","DFS"],"updatedAt":"2026-03-29T00:17:29.809Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bc6f","68cdd10d75f6e73b0375e054","66e094159e7bc1146bac6035","66e093ce9e7bc1146bab55b3","66e094149e7bc1146bac5abd"]},"topic":"Binary Search Tree Part-II","title":"Find K-th smallest element in BST","subTopic":null,"resource":"https://youtu.be/9TJYWh0adfk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.657Z","updatedAt":"2024-09-15T23:11:59.657Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c52","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e054","platform":"tuf","slug":"kth-smallest-and-largest-element-in-bst","createdAt":"2025-09-19T21:54:22.765Z","description":"","difficulty":"Easy","id":"kth-smallest-and-largest-element-in-bst","name":"Kth largest element in BST","problemUrl":"https://takeuforward.org/plus/dsa/problems/kth-smallest-and-largest-element-in-bst","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cc9e7bc1146bab3945"]},"topic":"Binary Search Tree Part-II","title":"Find K-th largest element in BST","subTopic":null,"resource":"https://youtu.be/9TJYWh0adfk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.671Z","updatedAt":"2025-09-21T19:28:15.088Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c56","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab510f","id":"653","platform":"leetcode","slug":"two-sum-iv-input-is-a-bst","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.523Z","description":"","difficulty":"Easy","name":"Two Sum IV - Input is a BST","problemUrl":"https://leetcode.com/problems/two-sum-iv-input-is-a-bst","topics":["HashMap and Set","Two Pointers","Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:42:29.894Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab55c9"]},"topic":"Binary Search Tree Part-II","title":"Find a pair with a given sum in BST","subTopic":null,"resource":"https://youtu.be/ssL3sHwPeb4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.687Z","updatedAt":"2024-09-15T23:11:59.687Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c5a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab36a8","id":"173","platform":"leetcode","slug":"binary-search-tree-iterator","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.095Z","description":"","difficulty":"Medium","name":"Binary Search Tree Iterator","problemUrl":"https://leetcode.com/problems/binary-search-tree-iterator","topics":["Queue and Stacks","Trees"],"updatedAt":"2026-03-29T00:13:47.954Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab5029"]},"topic":"Binary Search Tree Part-II","title":"BST iterator","subTopic":null,"resource":"https://youtu.be/D2jMcmxU4bs","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.699Z","updatedAt":"2024-09-15T23:11:59.699Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c5e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d19e7bc1146bab7a78","id":"1373","platform":"leetcode","slug":"maximum-sum-bst-in-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:37.936Z","description":"","difficulty":"Hard","name":"Maximum Sum BST in Binary Tree","problemUrl":"https://leetcode.com/problems/maximum-sum-bst-in-binary-tree","topics":["Dynamic Programming","Trees","DFS"],"updatedAt":"2026-03-29T01:13:30.736Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388c123"]},"topic":"Binary Search Tree Part-II","title":"Size of the largest BST in a Binary Tree","subTopic":null,"resource":"https://youtu.be/X0oXMdtUDwo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.704Z","updatedAt":"2024-09-15T23:11:59.704Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c62","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3c4f","id":"297","platform":"leetcode","slug":"serialize-and-deserialize-binary-tree","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.677Z","description":"","difficulty":"Hard","name":"Serialize and Deserialize Binary Tree","problemUrl":"https://leetcode.com/problems/serialize-and-deserialize-binary-tree","topics":["Trees","DFS","BFS"],"updatedAt":"2026-03-29T00:21:58.565Z","verified":true,"similarQuestions":["66e094169e7bc1146bac6c4a"]},"topic":"Binary Search Tree Part-II","title":"Serialize and deserialize Binary Tree","subTopic":null,"resource":"https://youtu.be/-YbXySKJsX8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.710Z","updatedAt":"2024-09-15T23:11:59.710Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c66","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab33ef","id":"114","platform":"leetcode","slug":"flatten-binary-tree-to-linked-list","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.805Z","description":"","difficulty":"Medium","name":"Flatten Binary Tree to Linked List","problemUrl":"https://leetcode.com/problems/flatten-binary-tree-to-linked-list","topics":["Linked Lists","Queue and Stacks","Trees","DFS"],"updatedAt":"2026-03-29T00:09:30.357Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba5b","66e093ce9e7bc1146bab4f71"]},"topic":"Binary Trees[Miscellaneous]","title":"Binary Tree to Double Linked List","subTopic":null,"resource":"https://www.youtube.com/watch?v=sWf7k1x9XR4&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=39","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.716Z","updatedAt":"2024-09-15T23:11:59.716Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c6a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3c37","slug":"find-median-from-data-stream","id":"295","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.671Z","description":"","difficulty":"Hard","name":"Find Median from Data Stream","problemUrl":"https://leetcode.com/problems/find-median-from-data-stream","topics":["Two Pointers","Sorting"],"updatedAt":"2026-03-29T00:21:50.843Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab4e12"]},"topic":"Binary Trees[Miscellaneous]","title":"Find median in a stream of running integers.","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.724Z","updatedAt":"2024-09-15T23:11:59.724Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c6e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab542f","id":"703","platform":"leetcode","slug":"kth-largest-element-in-a-stream","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.751Z","description":"","difficulty":"Easy","name":"Kth Largest Element in a Stream","problemUrl":"https://leetcode.com/problems/kth-largest-element-in-a-stream","topics":["Trees"],"updatedAt":"2026-03-29T00:45:11.857Z","verified":true},"topic":"Binary Trees[Miscellaneous]","title":"K-th largest element in a stream.","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.731Z","updatedAt":"2024-09-15T23:11:59.731Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c72","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab5598","id":333,"platform":"interviewbit","slug":"distinct-numbers-in-window","__v":0,"companyTags":["Amazon"],"createdAt":"2024-09-10T18:45:34.880Z","description":"","difficulty":"Medium","name":"Distinct Numbers in Window","problemUrl":"https://www.interviewbit.com/problems/distinct-numbers-in-window","topics":["Heaps and Maps"],"updatedAt":"2026-03-29T00:22:47.641Z","verified":true,"similarQuestions":["66e093d09e7bc1146bab66bd"]},"topic":"Binary Trees[Miscellaneous]","title":"Distinct numbers in Window.","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.737Z","updatedAt":"2024-09-15T23:11:59.737Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c76","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3895","id":"215","platform":"leetcode","slug":"kth-largest-element-in-an-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.272Z","description":"","difficulty":"Medium","name":"Kth Largest Element in an Array","problemUrl":"https://leetcode.com/problems/kth-largest-element-in-an-array","topics":["Arrays","Sorting"],"updatedAt":"2026-03-29T00:16:30.838Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab5206"]},"topic":"Binary Trees[Miscellaneous]","title":"K-th largest element in an unsorted array.","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.743Z","updatedAt":"2024-09-15T23:11:59.743Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c7a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093ce9e7bc1146bab562c","id":"733","platform":"leetcode","slug":"flood-fill","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:34.918Z","description":"","difficulty":"Easy","name":"Flood Fill","problemUrl":"https://leetcode.com/problems/flood-fill","topics":["Arrays","DFS","BFS"],"updatedAt":"2026-03-29T00:46:52.665Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388be8b"]},"topic":"Binary Trees[Miscellaneous]","title":"Flood-fill Algorithm","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.749Z","updatedAt":"2024-09-15T23:11:59.749Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c7e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab34cd","platform":"leetcode","slug":"clone-graph","id":"133","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.884Z","description":"","difficulty":"Medium","name":"Clone Graph","problemUrl":"https://leetcode.com/problems/clone-graph","topics":["HashMap and Set","DFS","BFS"],"updatedAt":"2026-03-29T00:11:05.666Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba85","68cdd0a875f6e73b0375dc28","66e093ce9e7bc1146bab4edb"]},"topic":"Graph","title":"Clone a graph (Not that easy as it looks)","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.756Z","updatedAt":"2024-09-15T23:11:59.756Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c82","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc3a","platform":"tuf","slug":"traversal-techniques","createdAt":"2025-09-19T21:52:41.905Z","description":"","difficulty":"Easy","id":"traversal-techniques","name":"BFS of graph","problemUrl":"https://takeuforward.org/plus/dsa/problems/traversal-techniques","topics":[],"updatedAt":"2025-09-19T21:52:41.913Z","verified":true},"topic":"Graph","title":"DFS","subTopic":null,"resource":"https://youtu.be/Qzf1a--rhp8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.764Z","updatedAt":"2025-09-21T19:29:51.972Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c86","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc3a","platform":"tuf","slug":"traversal-techniques","createdAt":"2025-09-19T21:52:41.905Z","description":"","difficulty":"Easy","id":"traversal-techniques","name":"BFS of graph","problemUrl":"https://takeuforward.org/plus/dsa/problems/traversal-techniques","topics":[],"updatedAt":"2025-09-19T21:52:41.913Z","verified":true},"topic":"Graph","title":"BFS","subTopic":null,"resource":"https://youtu.be/-tgVpUgsQ5k","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.775Z","updatedAt":"2025-09-21T19:29:51.995Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c8a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3839","slug":"course-schedule","id":"207","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.233Z","description":"","difficulty":"Medium","name":"Course Schedule","problemUrl":"https://leetcode.com/problems/course-schedule","topics":["DFS","BFS"],"updatedAt":"2026-03-29T00:15:59.843Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bafb","66e093cf9e7bc1146bab5771"]},"topic":"Graph","title":"Detect A cycle in Undirected Graph using BFS","subTopic":null,"resource":"https://youtu.be/BPlrALf1LDU","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.786Z","updatedAt":"2024-09-15T23:11:59.786Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c8e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3839","slug":"course-schedule","id":"207","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.233Z","description":"","difficulty":"Medium","name":"Course Schedule","problemUrl":"https://leetcode.com/problems/course-schedule","topics":["DFS","BFS"],"updatedAt":"2026-03-29T00:15:59.843Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bafb","66e093cf9e7bc1146bab5771"]},"topic":"Graph","title":"Detect A cycle in Undirected Graph using DFS","subTopic":null,"resource":"https://youtu.be/zQ3zgFypzX4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.797Z","updatedAt":"2024-09-15T23:11:59.797Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c92","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3839","slug":"course-schedule","id":"207","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.233Z","description":"","difficulty":"Medium","name":"Course Schedule","problemUrl":"https://leetcode.com/problems/course-schedule","topics":["DFS","BFS"],"updatedAt":"2026-03-29T00:15:59.843Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bafb","66e093cf9e7bc1146bab5771"]},"topic":"Graph","title":"Detect A cycle in a Directed Graph using DFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=uzVUw90ZFIg&list=PLgUwDviBIf0rGEWe64KWas0Nryn7SCRWw&index=12","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.803Z","updatedAt":"2024-09-15T23:11:59.803Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c96","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3839","slug":"course-schedule","id":"207","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.233Z","description":"","difficulty":"Medium","name":"Course Schedule","problemUrl":"https://leetcode.com/problems/course-schedule","topics":["DFS","BFS"],"updatedAt":"2026-03-29T00:15:59.843Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bafb","66e093cf9e7bc1146bab5771"]},"topic":"Graph","title":"Detect A cycle in a Directed Graph using BFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=iTBaI90lpDQ&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=23","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.812Z","updatedAt":"2024-09-15T23:11:59.812Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c9a","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc44","platform":"tuf","slug":"topological-sort-or-kahns-algorithm","createdAt":"2025-09-19T21:52:41.910Z","description":"","difficulty":"Medium","id":"topological-sort-or-kahns-algorithm","name":"Topological sort","problemUrl":"https://takeuforward.org/plus/dsa/problems/topological-sort-or-kahns-algorithm","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5e66"]},"topic":"Graph","title":"Topological Sort BFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=73sneFXuTEg&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=22","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.818Z","updatedAt":"2025-09-21T19:29:51.996Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77c9e","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc44","platform":"tuf","slug":"topological-sort-or-kahns-algorithm","createdAt":"2025-09-19T21:52:41.910Z","description":"","difficulty":"Medium","id":"topological-sort-or-kahns-algorithm","name":"Topological sort","problemUrl":"https://takeuforward.org/plus/dsa/problems/topological-sort-or-kahns-algorithm","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5e66"]},"topic":"Graph","title":"Topological Sort DFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=5lZ0iJMrUMk&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=22","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.823Z","updatedAt":"2025-09-21T19:29:52.093Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ca2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab37e4","slug":"number-of-islands","id":"200","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.198Z","description":"","difficulty":"Medium","name":"Number of Islands","problemUrl":"https://leetcode.com/problems/number-of-islands","topics":["Arrays","DFS","BFS","Union & Find"],"updatedAt":"2026-03-29T00:15:32.620Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388baf3"]},"topic":"Graph","title":"Number of islands(Do in Grid and Graph Both)","subTopic":null,"resource":"https://www.youtube.com/watch?v=muncqlKJrH0&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=8","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.829Z","updatedAt":"2024-09-15T23:11:59.829Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ca6","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab596c","platform":"leetcode","slug":"is-graph-bipartite","id":"785","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:35.163Z","description":"","difficulty":"Medium","name":"Is Graph Bipartite?","problemUrl":"https://leetcode.com/problems/is-graph-bipartite","topics":["DFS","BFS","Union & Find"],"updatedAt":"2026-03-29T00:49:12.965Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bef6","66e094159e7bc1146bac60c2"]},"topic":"Graph","title":"Bipartite Check using BFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=-vu34sct1g8&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=17","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.836Z","updatedAt":"2024-09-15T23:11:59.836Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77caa","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cf9e7bc1146bab596c","platform":"leetcode","slug":"is-graph-bipartite","id":"785","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:35.163Z","description":"","difficulty":"Medium","name":"Is Graph Bipartite?","problemUrl":"https://leetcode.com/problems/is-graph-bipartite","topics":["DFS","BFS","Union & Find"],"updatedAt":"2026-03-29T00:49:12.965Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bef6","66e094159e7bc1146bac60c2"]},"topic":"Graph","title":"Bipartite Check using DFS","subTopic":null,"resource":"https://www.youtube.com/watch?v=KG5YFfR0j8A&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=18","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.842Z","updatedAt":"2024-09-15T23:11:59.842Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cae","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d29e7bc1146bab8119","id":"1520","platform":"leetcode","slug":"maximum-number-of-non-overlapping-substrings","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:38.612Z","description":"","difficulty":"Hard","name":"Maximum Number of Non-Overlapping Substrings","problemUrl":"https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings","topics":["HashMap and Set","Greedy Algorithms","Sorting"],"updatedAt":"2026-03-29T01:19:32.826Z","verified":true},"topic":"Graph Part-II","title":"Strongly Connected Component(using KosaRajuΓÇÖs algo)","subTopic":null,"resource":"https://www.youtube.com/watch?v=V8qIqJxCioo&list=PLgUwDviBIf0rGEWe64KWas0Nryn7SCRWw&index=27","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.847Z","updatedAt":"2024-09-15T23:11:59.847Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cb2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc35","platform":"tuf","slug":"dijkstra's-algorithm","createdAt":"2025-09-19T21:52:41.906Z","description":"","difficulty":"Medium","id":"dijkstra's-algorithm","name":"Dijkstra Algorithm","problemUrl":"https://takeuforward.org/plus/dsa/problems/dijkstra's-algorithm","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab56c9"]},"topic":"Graph Part-II","title":"DijkstraΓÇÖs Algorithm","subTopic":null,"resource":"https://www.youtube.com/watch?v=rp1SMw7HSO8&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=35","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.853Z","updatedAt":"2025-09-21T19:29:52.100Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cb6","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc4d","platform":"tuf","slug":"bellman-ford-algorithm","createdAt":"2025-09-19T21:52:41.912Z","description":"","difficulty":"Medium","id":"bellman-ford-algorithm","name":"Bellman-Ford","problemUrl":"https://takeuforward.org/plus/dsa/problems/bellman-ford-algorithm","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac6424","66e093ce9e7bc1146bab56c9"]},"topic":"Graph Part-II","title":"Bellman-Ford Algo","subTopic":null,"resource":"https://www.youtube.com/watch?v=0vVofAhAYjc&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=41","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.861Z","updatedAt":"2025-09-21T19:29:52.146Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cba","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc41","slug":"floyd-warshall-algorithm","platform":"tuf","createdAt":"2025-09-19T21:52:41.908Z","description":"","difficulty":"Medium","id":"floyd-warshall-algorithm","name":"Floyd Warshall","problemUrl":"https://takeuforward.org/plus/dsa/problems/floyd-warshall-algorithm","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac62fd"]},"topic":"Graph Part-II","title":"Floyd Warshall Algorithm","subTopic":null,"resource":"https://www.youtube.com/watch?v=YbY8cVwWAvw&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=42","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.869Z","updatedAt":"2025-09-21T19:29:52.172Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cbe","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc51","platform":"tuf","slug":"find-the-mst-weight","createdAt":"2025-09-19T21:52:41.984Z","description":"","difficulty":"Medium","id":"find-the-mst-weight","name":"Find the MST Weight","problemUrl":"https://takeuforward.org/plus/dsa/problems/find-the-mst-weight","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac63d0"]},"topic":"Graph Part-II","title":"MST using Prim's Algo","subTopic":null,"resource":"https://www.youtube.com/watch?v=mJcZjjKzeqk&list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn&index=44","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.874Z","updatedAt":"2025-09-21T19:29:52.172Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cc2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc51","platform":"tuf","slug":"find-the-mst-weight","createdAt":"2025-09-19T21:52:41.984Z","description":"","difficulty":"Medium","id":"find-the-mst-weight","name":"Find the MST Weight","problemUrl":"https://takeuforward.org/plus/dsa/problems/find-the-mst-weight","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094169e7bc1146bac63d0"]},"topic":"Graph Part-II","title":"MST using KruskalΓÇÖs Algo","subTopic":null,"resource":"https://www.youtube.com/watch?v=1KRmCzBl_mQ&list=PLgUwDviBIf0rGEWe64KWas0Nryn7SCRWw&index=24","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.880Z","updatedAt":"2025-09-21T19:29:52.264Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cc6","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab35af","slug":"maximum-product-subarray","id":"152","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.987Z","description":"","difficulty":"Medium","name":"Maximum Product Subarray","problemUrl":"https://leetcode.com/problems/maximum-product-subarray","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:12:25.197Z","verified":true,"similarQuestions":["66e093cd9e7bc1146bab423d"]},"topic":"Dynamic Programming","title":"Max Product Subarray","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.886Z","updatedAt":"2024-09-15T23:11:59.886Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cca","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3c7a","slug":"longest-increasing-subsequence","id":"300","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.701Z","description":"","difficulty":"Medium","name":"Longest Increasing Subsequence","problemUrl":"https://leetcode.com/problems/longest-increasing-subsequence","topics":["Arrays","Binary Search","Dynamic Programming"],"updatedAt":"2026-03-29T00:22:10.341Z","verified":true,"similarQuestions":["68cdd0a975f6e73b0375dc7e","689b7f1c75f6e73b0388bba9","66e093cd9e7bc1146bab41df","66e094159e7bc1146bac5bf6"]},"topic":"Dynamic Programming","title":"Longest Increasing Subsequence","subTopic":null,"resource":"https://youtu.be/ekcwMsSIzVc","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.896Z","updatedAt":"2024-09-15T23:11:59.896Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cce","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d09e7bc1146bab6ffc","slug":"longest-common-subsequence","id":"1143","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:36.908Z","description":"","difficulty":"Medium","name":"Longest Common Subsequence","problemUrl":"https://leetcode.com/problems/longest-common-subsequence","topics":["Dynamic Programming"],"updatedAt":"2026-03-29T01:04:04.047Z","verified":true,"similarQuestions":["66e093cf9e7bc1146bab5a50","66e093ce9e7bc1146bab56fe","66e093ce9e7bc1146bab5544"]},"topic":"Dynamic Programming","title":"Longest Common Subsequence","subTopic":null,"resource":"https://youtu.be/NPZn9jBrX8U","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.904Z","updatedAt":"2024-09-15T23:11:59.904Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cd3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3201","id":"72","platform":"leetcode","slug":"edit-distance","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.616Z","description":"","difficulty":"Medium","name":"Edit Distance","problemUrl":"https://leetcode.com/problems/edit-distance","topics":["Dynamic Programming"],"updatedAt":"2026-03-29T00:06:12.932Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5ed8","689b7f1c75f6e73b0388b9e6","66e093cd9e7bc1146bab42f1"]},"topic":"Dynamic Programming","title":"Edit Distance","subTopic":null,"resource":"https://youtu.be/fJaKO8FbDdo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.911Z","updatedAt":"2024-09-15T23:11:59.911Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cd7","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e03c","platform":"tuf","slug":"maximum-sum-increasing-subsequence","createdAt":"2025-09-19T21:54:22.841Z","description":"","difficulty":"Medium","id":"maximum-sum-increasing-subsequence","name":"Max Sum Increasing Subsequence","problemUrl":"https://takeuforward.org/plus/dsa/problems/maximum-sum-increasing-subsequence","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cb9e7bc1146bab3120"]},"topic":"Dynamic Programming","title":"Maximum sum increasing subsequence","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.916Z","updatedAt":"2025-09-21T19:28:15.089Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cdb","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc79","slug":"matrix-chain-multiplication","platform":"tuf","createdAt":"2025-09-19T21:52:42.063Z","description":"","difficulty":"Hard","id":"matrix-chain-multiplication","name":"Matrix Chain Multiplication","problemUrl":"https://takeuforward.org/plus/dsa/problems/matrix-chain-multiplication","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093d29e7bc1146bab825f","66e094169e7bc1146bac6569"]},"topic":"Dynamic Programming","title":"Matrix Chain Multiplication","subTopic":null,"resource":"https://youtu.be/vRVfmbCFW7Y","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.922Z","updatedAt":"2025-09-21T19:29:52.345Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cdf","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab31a3","id":"64","platform":"leetcode","slug":"minimum-path-sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.571Z","description":"","difficulty":"Medium","name":"Minimum Path Sum","problemUrl":"https://leetcode.com/problems/minimum-path-sum","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:05:35.526Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388b9cc","66e093cd9e7bc1146bab42d9"]},"topic":"Dynamic Programming Part-II","title":"Minimum sum path in the matrix, (count paths and similar type do, also backtrack to find the Minimum path)","subTopic":null,"resource":"https://youtu.be/_rgTlyky1uQ","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.929Z","updatedAt":"2024-09-15T23:11:59.929Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ce3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3d78","id":"322","platform":"leetcode","slug":"coin-change","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.793Z","description":"","difficulty":"Medium","name":"Coin Change","problemUrl":"https://leetcode.com/problems/coin-change","topics":["Arrays","Dynamic Programming","BFS"],"updatedAt":"2026-03-29T00:23:37.868Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388bbd9","68cdd0a875f6e73b0375dbff","66e094159e7bc1146bac5d52","66e093cf9e7bc1146bab57fd","66e755ad013a40fbd1e3667a"]},"topic":"Dynamic Programming Part-II","title":"Coin change","subTopic":null,"resource":"https://youtu.be/HgyouUi11zk","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.935Z","updatedAt":"2024-09-15T23:11:59.935Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ce7","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab41fb","id":"416","platform":"leetcode","slug":"partition-equal-subset-sum","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.231Z","description":"","difficulty":"Medium","name":"Partition Equal Subset Sum","problemUrl":"https://leetcode.com/problems/partition-equal-subset-sum","topics":["Arrays","Dynamic Programming"],"updatedAt":"2026-03-29T00:29:30.839Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bc8b","66e094149e7bc1146bac5b5a","66e093cf9e7bc1146bab5f40","68cdd0a875f6e73b0375dbbb","66e093ce9e7bc1146bab549d"]},"topic":"Dynamic Programming Part-II","title":"Subset Sum","subTopic":null,"resource":"https://www.youtube.com/watch?v=fWX9xDmIzRI","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.943Z","updatedAt":"2024-09-15T23:11:59.943Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77ceb","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d29e7bc1146bab825f","platform":"leetcode","slug":"minimum-cost-to-cut-a-stick","id":"1547","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:38.743Z","description":"","difficulty":"Hard","name":"Minimum Cost to Cut a Stick","problemUrl":"https://leetcode.com/problems/minimum-cost-to-cut-a-stick","topics":["Arrays","Dynamic Programming","Sorting"],"updatedAt":"2026-03-29T01:20:42.165Z","verified":true,"similarQuestions":["68cdd0a975f6e73b0375dc79","66e093cd9e7bc1146bab48c0"]},"topic":"Dynamic Programming Part-II","title":"Rod Cutting","subTopic":null,"resource":"https://youtu.be/mO8XpGoJwuo","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.954Z","updatedAt":"2024-09-15T23:11:59.954Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cef","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e03f","platform":"tuf","slug":"super-egg-drop","createdAt":"2025-09-19T21:54:22.842Z","description":"","difficulty":"Medium","id":"super-egg-drop","name":"Egg Dropping Puzzle","problemUrl":"https://takeuforward.org/plus/dsa/problems/super-egg-drop","topics":[],"updatedAt":"2025-09-19T21:54:22.842Z","verified":true},"topic":"Dynamic Programming Part-II","title":"Egg Dropping","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.961Z","updatedAt":"2025-09-21T19:28:15.089Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cf3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab3517","slug":"word-break","id":"139","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.927Z","description":"","difficulty":"Medium","name":"Word Break","problemUrl":"https://leetcode.com/problems/word-break","topics":["Arrays","HashMap and Set","Dynamic Programming"],"updatedAt":"2026-03-29T00:11:33.085Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba8d","66e093cd9e7bc1146bab430c"]},"topic":"Dynamic Programming Part-II","title":"Word Break","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.967Z","updatedAt":"2024-09-15T23:11:59.967Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cf7","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e031","platform":"tuf","slug":"palindrome-partitioning","createdAt":"2025-09-19T21:54:22.839Z","description":"","difficulty":"Hard","id":"palindrome-partitioning","name":"Palindromic Partitioning","problemUrl":"https://takeuforward.org/plus/dsa/problems/palindrome-partitioning","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cb9e7bc1146bab34b6","689b7f1c75f6e73b0388ba7b"]},"topic":"Dynamic Programming Part-II","title":"Palindrome Partitioning (MCM Variation)","subTopic":null,"resource":"https://youtu.be/_H8V5hJUGd0","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.975Z","updatedAt":"2025-09-21T19:28:15.254Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cfb","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc0c","platform":"tuf","slug":"job-sequencing-problem","createdAt":"2025-09-19T21:52:41.753Z","description":"","difficulty":"Medium","id":"job-sequencing-problem","name":"Job Sequencing Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/job-sequencing-problem","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac5dca","66e093d19e7bc1146bab744f"]},"topic":"Dynamic Programming Part-II","title":"Maximum profit in Job scheduling","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.981Z","updatedAt":"2024-09-15T23:11:59.981Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77cff","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cc9e7bc1146bab3843","slug":"implement-trie-prefix-tree","id":"208","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:32.236Z","description":"","difficulty":"Medium","name":"Implement Trie (Prefix Tree)","problemUrl":"https://leetcode.com/problems/implement-trie-prefix-tree","topics":["HashMap and Set"],"updatedAt":"2026-03-29T00:16:03.749Z","verified":true,"similarQuestions":["68cdd0a975f6e73b0375dc7b","66c1ce6bfe3d5bc2dbe3c0a7"]},"topic":"Trie","title":"Implement Trie (Prefix Tree)","subTopic":null,"resource":"https://www.youtube.com/watch?v=dBGUmUQhjaM&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.987Z","updatedAt":"2024-09-15T23:11:59.987Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77d03","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc7b","platform":"tuf","slug":"trie-implementation-and-advanced-operations","createdAt":"2025-09-19T21:52:42.065Z","description":"","difficulty":"Medium","id":"trie-implementation-and-advanced-operations","name":"Implement Trie ll","problemUrl":"https://takeuforward.org/plus/dsa/problems/trie-implementation-and-advanced-operations","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cc9e7bc1146bab3843"]},"topic":"Trie","title":"Implement Trie - 2 (Prefix Tree)","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.993Z","updatedAt":"2025-09-21T19:29:52.438Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769bf8a15c1adcdf77d07","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc80","platform":"tuf","slug":"longest-word-with-all-prefixes","createdAt":"2025-09-19T21:52:42.066Z","description":"","difficulty":"Hard","id":"longest-word-with-all-prefixes","name":"Complete String","problemUrl":"https://takeuforward.org/plus/dsa/problems/longest-word-with-all-prefixes","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66c1ce6bfe3d5bc2dbe3c0ad"]},"topic":"Trie","title":"Longest String with All Prefixes","subTopic":null,"resource":"https://www.youtube.com/watch?v=AWnBa91lThI&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp&index=3","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:11:59.999Z","updatedAt":"2025-09-21T19:29:52.461Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769c08a15c1adcdf77d0b","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc88","platform":"tuf","slug":"number-of-distinct-substrings-in-a-string","createdAt":"2025-09-19T21:52:42.070Z","description":"","difficulty":"Medium","id":"number-of-distinct-substrings-in-a-string","name":"Count Distinct Substrings","problemUrl":"https://takeuforward.org/plus/dsa/problems/number-of-distinct-substrings-in-a-string","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66c1ce6bfe3d5bc2dbe3c10d"]},"topic":"Trie","title":"Number of Distinct Substrings in a String","subTopic":null,"resource":"https://www.youtube.com/watch?v=RV0QeTyHZxo&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp&index=4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:12:00.013Z","updatedAt":"2025-09-21T19:29:52.496Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769c08a15c1adcdf77d0f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e044","platform":"tuf","slug":"power-set","createdAt":"2025-09-19T21:54:22.921Z","description":"","difficulty":"Medium","id":"power-set","name":"Power Set","problemUrl":"https://takeuforward.org/plus/dsa/problems/power-set","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba17","66e093cb9e7bc1146bab3248","66e094169e7bc1146bac6959"]},"topic":"Trie","title":"Power Set (this is very important)","subTopic":null,"resource":"https://www.youtube.com/watch?v=b7AYbpM5YrE&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=67","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:12:00.019Z","updatedAt":"2025-09-21T19:28:15.259Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769c08a15c1adcdf77d13","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cd9e7bc1146bab4246","id":"421","platform":"leetcode","slug":"maximum-xor-of-two-numbers-in-an-array","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:33.256Z","description":"","difficulty":"Medium","name":"Maximum XOR of Two Numbers in an Array","problemUrl":"https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array","topics":["Arrays","HashMap and Set","Bit Manipulation"],"updatedAt":"2026-03-29T00:29:46.819Z","verified":true,"similarQuestions":["689b7f1d75f6e73b0388bc93"]},"topic":"Trie","title":"Maximum XOR of two numbers in an array","subTopic":null,"resource":"https://www.youtube.com/watch?v=EIhAwfHubE8&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp&index=6","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:12:00.025Z","updatedAt":"2024-09-15T23:12:00.025Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e769c08a15c1adcdf77d17","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093d39e7bc1146bab89af","slug":"maximum-xor-with-an-element-from-array","id":"1707","platform":"leetcode","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:39.392Z","description":"","difficulty":"Hard","name":"Maximum XOR With an Element From Array","problemUrl":"https://leetcode.com/problems/maximum-xor-with-an-element-from-array","topics":["Arrays","Bit Manipulation"],"updatedAt":"2026-03-29T01:27:13.288Z","verified":true},"topic":"Trie","title":"Maximum XOR With an Element From Array","subTopic":null,"resource":"https://www.youtube.com/watch?v=Q8LhG9Pi5KM&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp&index=7","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:12:00.035Z","updatedAt":"2024-09-15T23:12:00.035Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a768a15c1adcdf77de2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375db72","platform":"tuf","slug":"count-inversions","createdAt":"2025-09-19T21:52:41.265Z","description":"","difficulty":"Medium","id":"count-inversions","name":"Count Inversions","problemUrl":"https://takeuforward.org/plus/dsa/problems/count-inversions","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093ce9e7bc1146bab524b","66c1ce6afe3d5bc2dbe3bfbd"]},"topic":"Arrays Part-II","title":"Inversion of Array (Pre-req: Merge Sort)","subTopic":null,"resource":"https://youtu.be/AseUmwVNaoY","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:02.566Z","updatedAt":"2025-09-21T19:28:14.733Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a768a15c1adcdf77e55","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e058","platform":"tuf","slug":"implement-max-heap","createdAt":"2025-09-19T21:54:22.687Z","description":"","difficulty":"Medium","id":"implement-max-heap","name":"Min Heap","problemUrl":"https://takeuforward.org/plus/dsa/problems/implement-max-heap","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66c1ce6bfe3d5bc2dbe3c1e9"]},"topic":"Heaps","title":"Max heap, Min Heap Implementation (Only for interviews)","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:02.810Z","updatedAt":"2025-09-21T19:28:14.733Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a768a15c1adcdf77e5f","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e01f","platform":"tuf","slug":"merge-k-sorted-arrays","createdAt":"2025-09-19T21:54:22.525Z","description":"","difficulty":"Medium","id":"merge-k-sorted-arrays","name":"Merge K Sorted Arrays","problemUrl":"https://takeuforward.org/plus/dsa/problems/merge-k-sorted-arrays","topics":[],"updatedAt":"2025-09-19T21:54:22.525Z","verified":true},"topic":"Heaps","title":"Merge K sorted arrays","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:02.825Z","updatedAt":"2025-09-21T19:28:14.729Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a768a15c1adcdf77ea3","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e026","platform":"tuf","slug":"morris-preorder-traversal-","createdAt":"2025-09-19T21:54:22.612Z","description":"","difficulty":"Easy","id":"morris-preorder-traversal-","name":"Preorder Traversal","problemUrl":"https://takeuforward.org/plus/dsa/problems/morris-preorder-traversal-","topics":[],"updatedAt":"2025-09-19T21:54:22.612Z","verified":true},"topic":"Binary Tree","title":"Morris Preorder Traversal","subTopic":null,"resource":"https://youtu.be/80Zug6D1_r4","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:02.982Z","updatedAt":"2025-09-21T19:28:14.910Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a778a15c1adcdf77ee0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc31","platform":"tuf","slug":"floor-and-ceil-in-a-bst","createdAt":"2025-09-19T21:52:41.830Z","description":"","difficulty":"Medium","id":"floor-and-ceil-in-a-bst","name":"Floor in BST","problemUrl":"https://takeuforward.org/plus/dsa/problems/floor-and-ceil-in-a-bst","topics":[],"updatedAt":"2025-09-19T21:52:41.832Z","verified":true},"topic":"Binary Search Tree Part-II","title":"Floor in a BST","subTopic":null,"resource":"https://www.youtube.com/watch?v=xm_W1ub-K-w&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=43","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:03.109Z","updatedAt":"2025-09-21T19:28:14.912Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e76a778a15c1adcdf77ee4","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc31","platform":"tuf","slug":"floor-and-ceil-in-a-bst","createdAt":"2025-09-19T21:52:41.830Z","description":"","difficulty":"Medium","id":"floor-and-ceil-in-a-bst","name":"Floor in BST","problemUrl":"https://takeuforward.org/plus/dsa/problems/floor-and-ceil-in-a-bst","topics":[],"updatedAt":"2025-09-19T21:52:41.832Z","verified":true},"topic":"Binary Search Tree Part-II","title":"Ceil in a BST","subTopic":null,"resource":"https://www.youtube.com/watch?v=KSsk8AhdOZA&list=PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk&index=42","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:15:03.115Z","updatedAt":"2025-09-21T19:28:15.087Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf784e2","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375db8d","platform":"tuf","slug":"find-nth-root-of-a-number","createdAt":"2025-09-19T21:52:41.348Z","description":"","difficulty":"Medium","id":"find-nth-root-of-a-number","name":"Find nth root of m","problemUrl":"https://takeuforward.org/plus/dsa/problems/find-nth-root-of-a-number","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e094159e7bc1146bac629c"]},"topic":"Binary Search","title":"The N-th root of an integer","subTopic":null,"resource":"https://www.youtube.com/watch?v=WjpswYrS2nY&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=62","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.336Z","updatedAt":"2025-09-21T19:29:51.265Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf78520","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc87","platform":"tuf","slug":"word-break","createdAt":"2025-09-19T21:52:42.070Z","description":"","difficulty":"Medium","id":"word-break","name":"The Celebrity Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/word-break","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba8d"]},"topic":"Stack and Queue Part-II","title":"The Celebrity Problem","subTopic":null,"resource":"https://youtu.be/cEadsbTeze4?si=olXYfOs7l-SEn2zl","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.444Z","updatedAt":"2025-09-21T19:29:52.569Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf78530","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ffc","id":"28","platform":"leetcode","slug":"find-the-index-of-the-first-occurrence-in-a-string","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.419Z","description":"","difficulty":"Easy","name":"Find the Index of the First Occurrence in a String","problemUrl":"https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string","topics":["Two Pointers"],"updatedAt":"2026-03-29T00:02:45.350Z","verified":true,"similarQuestions":["66e094159e7bc1146bac60e3","66e0941c9e7bc1146baca4fd","66e093ce9e7bc1146bab4c71"]},"topic":"String Part-II","title":"Z-Function","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.469Z","updatedAt":"2024-09-15T23:43:55.469Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf78534","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"66e093cb9e7bc1146bab2ffc","id":"28","platform":"leetcode","slug":"find-the-index-of-the-first-occurrence-in-a-string","__v":0,"companyTags":[],"createdAt":"2024-09-10T18:45:31.419Z","description":"","difficulty":"Easy","name":"Find the Index of the First Occurrence in a String","problemUrl":"https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string","topics":["Two Pointers"],"updatedAt":"2026-03-29T00:02:45.350Z","verified":true,"similarQuestions":["66e094159e7bc1146bac60e3","66e0941c9e7bc1146baca4fd","66e093ce9e7bc1146bab4c71"]},"topic":"String Part-II","title":"KMP algo / LPS(pi) array","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.475Z","updatedAt":"2024-09-15T23:43:55.475Z","popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf78550","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a875f6e73b0375dc23","platform":"tuf","slug":"pre,-post,-inorder-in-one-traversal","createdAt":"2025-09-19T21:52:41.827Z","description":"","difficulty":"Medium","id":"pre,-post,-inorder-in-one-traversal","name":"Iterative Postorder","problemUrl":"https://takeuforward.org/plus/dsa/problems/pre,-post,-inorder-in-one-traversal","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["66e093cb9e7bc1146bab355c"]},"topic":"Binary Tree","title":"Preorder inorder postorder in a single traversal","subTopic":null,"resource":"https://youtu.be/ySp2epYvgTE","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.539Z","updatedAt":"2025-09-21T19:29:51.657Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf785cc","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd10d75f6e73b0375e03b","platform":"tuf","slug":"0-and-1-knapsack","createdAt":"2025-09-19T21:54:22.842Z","description":"","difficulty":"Medium","id":"0-and-1-knapsack","name":"0 - 1 Knapsack Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/0-and-1-knapsack","topics":[],"updatedAt":"2025-09-19T21:54:22.842Z","verified":true},"topic":"Dynamic Programming","title":"0-1 Knapsack","subTopic":null,"resource":"https://youtu.be/GqOmJHQZivw","session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.814Z","updatedAt":"2025-09-21T19:28:15.090Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null},{"_id":"66e7713b8a15c1adcdf785e0","sheetId":"66e769b48a15c1adcdf77a47","questionId":{"_id":"68cdd0a975f6e73b0375dc87","platform":"tuf","slug":"word-break","createdAt":"2025-09-19T21:52:42.070Z","description":"","difficulty":"Medium","id":"word-break","name":"The Celebrity Problem","problemUrl":"https://takeuforward.org/plus/dsa/problems/word-break","topics":[],"updatedAt":"2026-01-17T21:47:11.795Z","verified":true,"similarQuestions":["689b7f1c75f6e73b0388ba8d"]},"topic":"Dynamic Programming Part-II","title":"Word Break","subTopic":null,"resource":null,"session":"ik34sv","isPublic":true,"createdAt":"2024-09-15T23:43:55.877Z","updatedAt":"2025-09-21T19:28:15.260Z","hotness":0,"rank":0,"popularSheets":[],"isSolved":false,"questionDocumentId":null}],"email":null}}