Muhammad Farhan's DSA Sheet
Muhammad Farhan's DSA Sheet
Congratulations! It's time to learn advanced concepts and start doing medium level questions
Remember Quality over quantity.
Learn Linkedlists, Trees, DFS, BFS, Dynamic Programming and do Easy then Medium questions from these concepts
TREE
Preorder Traversal
Inorder Traversal
Postorder Traversal
https://leetcode.com/studyplan/top-sql-50/
Pls like my linkedin post : Your likes and comments are my moticvation <3
Muhammad Farhan KT on LinkedIn: Leetcode Question Sheet | 16 comments
https://leetcode.com/problems/reverse-only-letters/description/
https://leetcode.com/problems/greatest-common-divisor-of-strings/description/
https://leetcode.com/problems/check-if-the-number-is-fascinating/description/
https://leetcode.com/problems/remove-trailing-zeros-from-a-string/description/
https://leetcode.com/problems/next-greater-element-i/description/
https://leetcode.com/problems/count-elements-with-maximum-frequency/description/
https://leetcode.com/problems/split-strings-by-separator/description/
https://leetcode.com/problems/capitalize-the-title/description/
https://leetcode.com/problems/detect-capital/description/
https://leetcode.com/problems/longest-common-subsequence/description/?envType=daily-question&envId=2024-01-25 Medium
https://leetcode.com/problems/design-an-ordered-stream/description/
https://leetcode.com/problems/longest-common-prefix/description/ trie
https://leetcode.com/problems/roman-to-integer/description
https://leetcode.com/problems/integer-to-roman/description/ Medium
https://leetcode.com/problems/pascals-triangle/description/
https://leetcode.com/problems/pascals-triangle-ii/description/
https://leetcode.com/problems/merge-similar-items/description/
https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/description/
https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/
https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/description/
https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/description/
https://leetcode.com/problems/kth-largest-element-in-an-array/description/ Med
Linear & Binary Search
Linked List
Convert Binary Number in a Linked List to Integer - LeetCode
Reverse Linked List - LeetCode
Middle of the Linked List - LeetCode
Palindrome Linked List - LeetCode
Linked List Cycle
Intersection of Two Linked Lists - LeetCode
Insert Greatest Common Divisors in Linked List - LeetCode
Delete the Middle Node of a Linked List - LeetCode
Recursion
https://leetcode.com/problems/design-hashset/description/
https://leetcode.com/problems/design-hashmap/description/
Trie
https://leetcode.com/problems/longest-common-prefix/description/
https://leetcode.com/problems/implement-trie-prefix-tree/description/
https://leetcode.com/problems/search-suggestions-system/description/
Tree