Leetcode Problems

This page includes my solved leetcode problems categorized based on subject. For premium problems (which I mentioned them in the last column called note), because the link for the problem is restricted to the premium leetcode users, I have included the description of the problem at the end of the embedded file. Also before each table, I have included a link to the handwritings of my notes for analyzing problems of that section.

Arrays 101

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Linked List

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Hash Table

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Queue & Stack

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Heap

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Array & String

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Recursion I

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Binary Tree

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Trie

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

N-ary Tree

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Binary Search Tree

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Recursion II

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Dynamic Programming

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Graph

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Sorting

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

Bit Manipulation

My handwritings for analyzing problems of this section: Here

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language

SQL Language

  1. Arrays 101
  2. Linked List
  3. Hash Table
  4. Queue & Stack
  5. Heap
  6. Binary Search
  7. Array & String
  8. Recursion I
  9. Binary Tree
  10. Trie
  11. N-ary Tree
  12. Binary Search Tree
  13. Recursion II
  14. Dynamic Programming
  15. Graph
  16. Sorting
  17. Bit Manipulation
  18. SQL Language