Skip to content

ullaskunder3/blind-75

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

LeetCode DSA Tracker

🥁 Drum Roll, Please! 🥁

Track your progress and conquer each category with determination! 🚀

Array


Binary

  • 11. Sum of Two Integers
  • 12. Number of 1 Bits
  • 13. Counting Bits
  • 14. Missing Number
  • 15. Reverse Bits

Dynamic Programming

  • 16. Climbing Stairs
  • 17. Coin Change
  • 18. Longest Increasing Subsequence
  • 19. Longest Common Subsequence
  • 20. Word Break
  • 21. Combination Sum
  • 22. House Robber
  • 23. House Robber II
  • 24. Decode Ways
  • 25. Unique Paths
  • 26. Jump Game

Graph

  • 27. Clone Graph
  • 28. Course Schedule
  • 29. Pacific Atlantic Water Flow
  • 30. Number of Islands
  • 31. Longest Consecutive Sequence
  • 32. Alien Dictionary
  • 33. Graph Valid Tree
  • 34. Word Ladder

Interval

  • 35. Insert Interval
  • 36. Merge Intervals
  • 37. Non-overlapping Intervals
  • 38. Meeting Rooms
  • 39. Meeting Rooms II

Linked List

  • 40. Reverse a Linked List
  • 41. Detect Cycle in a Linked List
  • 42. Merge Two Sorted Lists
  • 43. Merge K Sorted Lists
  • 44. Remove Nth Node From End of List
  • 45. Reorder List

Matrix

  • 46. Set Matrix Zeroes
  • 47. Spiral Matrix
  • 48. Rotate Image
  • 49. Word Search

String

  • 50. Longest Substring Without Repeating Characters
  • 51. Longest Repeating Character Replacement
  • 52. Minimum Window Substring
  • 53. Valid Anagram
  • 54. Group Anagrams
  • 55. Valid Parentheses
  • 56. Valid Palindrome
  • 57. Longest Palindromic Substring
  • 58. Palindromic Substrings
  • 59. Encode and Decode Strings

Tree

  • 60. Maximum Depth of Binary Tree
  • 61. Same Tree
  • 62. Invert/Flip Binary Tree
  • 63. Binary Tree Maximum Path Sum
  • 64. Binary Tree Level Order Traversal
  • 65. Serialize and Deserialize Binary Tree
  • 66. Subtree of Another Tree
  • 67. Construct Binary Tree from Preorder and Inorder Traversal
  • 68. Validate Binary Search Tree
  • 69. Kth Smallest Element in a BST
  • 70. Lowest Common Ancestor of BST
  • 71. Implement Trie (Prefix Tree)
  • 72. Add and Search Word
  • 73. Word Search II

Heap

  • 74. Merge K Sorted Lists
  • 75. Top K Frequent Elements