Data Structures and Algorithms Journey 🚀

Overview 📚

Welcome to my journey of learning and practicing Data Structures and Algorithms (DSA)! This repository serves as a collection of my notes, practice problems, solutions, and concepts related to DSA. My goal is to master the fundamental building blocks of computer science and improve my problem-solving skills. 💡

Learning Goals 🎯

Understand and implement various data structures (arrays, linked lists, stacks, queues, trees, graphs, heaps, hash tables).
Master essential algorithms (sorting, searching, dynamic programming, greedy algorithms, and graph traversal techniques).
Improve my problem-solving skills and coding efficiency through regular practice and challenges. 💪

Repository Structure 📂

DSA Practice: Problem solutions and coding challenges.
Concept Notes: Detailed explanations of each topic using comments (#) and Readme files.
Resources: Will be learning from different youtube tutorials, courses, and other helpful learning materials.

Progress 📈

As I work through different problems and algorithms, I will be posting my solutions and explanations in this repository. This will be an ongoing project, and I aim to continuously improve my understanding of DSA. 🔥

How You Can Contribute 🤝

Feel free to fork this repository, raise issues, or contribute with suggestions or improvements. If you have any tips or resources to share, don't hesitate to open a pull request! 🙌

Name		Name	Last commit message	Last commit date
Latest commit History 725 Commits
01. Contains Duplicate		01. Contains Duplicate
02. Valid Anagram		02. Valid Anagram
03. Two Sums		03. Two Sums
04. Group Anagrams		04. Group Anagrams
05. Top K Frequent Elements		05. Top K Frequent Elements
06. Products of array except self		06. Products of array except self
07. Valid Sudoku		07. Valid Sudoku
08. Longest Consecutive Sequence		08. Longest Consecutive Sequence
09. Valid Palindrome		09. Valid Palindrome
10. Two Sum II - Input Array Is Sorted		10. Two Sum II - Input Array Is Sorted
100. Pascal's Triangle		100. Pascal's Triangle
101. Next Greater Element I		101. Next Greater Element I
102. Maximum Difference Between Even and Odd Frequency I		102. Maximum Difference Between Even and Odd Frequency I
103. Find Lucky Integer in an Array		103. Find Lucky Integer in an Array
104. Ransom Note		104. Ransom Note
105. Move Zeroes		105. Move Zeroes
106. Squares of a Sorted Array		106. Squares of a Sorted Array
107. Is Subsequence		107. Is Subsequence
108. Score of a String		108. Score of a String
109. Replace Elements with Greatest Element on Right Side		109. Replace Elements with Greatest Element on Right Side
11. 3Sum		11. 3Sum
110. Length of Last Word		110. Length of Last Word
111. Number of Senior Citizens		111. Number of Senior Citizens
112. Unique Email Addresses		112. Unique Email Addresses
113. Isomorphic Strings		113. Isomorphic Strings
114. Can Place Flowers		114. Can Place Flowers
115. Maximum Ascending Subarray Sum		115. Maximum Ascending Subarray Sum
116. Find Pivot Index		116. Find Pivot Index
117. Kth Distinct String in an Array		117. Kth Distinct String in an Array
118. Range Sum Query - Immutable		118. Range Sum Query - Immutable
119. Find All Numbers Disappeared in an Array		119. Find All Numbers Disappeared in an Array
12. Container With Most Water		12. Container With Most Water
120. Maximum Number of Balloons		120. Maximum Number of Balloons
121. Special Array I		121. Special Array I
122. Assign Cookies		122. Assign Cookies
123. Find First Palindromic String in the Array		123. Find First Palindromic String in the Array
124. Sort Array By Parity		124. Sort Array By Parity
125. Monotonic Array		125. Monotonic Array
126. Divide Array Into Equal Pairs		126. Divide Array Into Equal Pairs
127. Palindrome Linked List		127. Palindrome Linked List
128. Number of Good Pairs		128. Number of Good Pairs
129. Count the Number of Consistent Strings		129. Count the Number of Consistent Strings
13. Valid Parentheses		13. Valid Parentheses
130. Largest 3-Same-Digit Number in String		130. Largest 3-Same-Digit Number in String
131. Destination City		131. Destination City
132. Circular Sentence		132. Circular Sentence
14. Min Stack		14. Min Stack
15. Evaluate Reverse Polish Notation		15. Evaluate Reverse Polish Notation
16. Generate Parentheses		16. Generate Parentheses
17. Daily Temperatures		17. Daily Temperatures
18. Car Fleet		18. Car Fleet
19. Best Time to Buy and Sell Stock		19. Best Time to Buy and Sell Stock
20. Longest Substring Without Repeating Characters		20. Longest Substring Without Repeating Characters
21. Longest Repeating Character Replacement		21. Longest Repeating Character Replacement
22. Permutation in String		22. Permutation in String
23. Reverse Linked List		23. Reverse Linked List
24. Merge Two Sorted Lists		24. Merge Two Sorted Lists
25. Linked List Cycle		25. Linked List Cycle
26. Reorder List		26. Reorder List
27. Remove Nth Node From End of List		27. Remove Nth Node From End of List
28. Copy List with Random Pointer		28. Copy List with Random Pointer
29. Add Two Numbers		29. Add Two Numbers
30. Find the Duplicate Number		30. Find the Duplicate Number
31. Binary Search		31. Binary Search
32. Search A 2D Matrix		32. Search A 2D Matrix
33. Koko Eating Bananas		33. Koko Eating Bananas
34. Find Minimum in Rotated Sorted Array		34. Find Minimum in Rotated Sorted Array
35. Search in Rotated Sorted Array		35. Search in Rotated Sorted Array
36. Time Based Key-Value Store		36. Time Based Key-Value Store
37. Invert Binary Tree		37. Invert Binary Tree
38. Maximum Depth of Binary Tree		38. Maximum Depth of Binary Tree
39. Diameter of Binary Tree		39. Diameter of Binary Tree
40. Balanced Binary Tree		40. Balanced Binary Tree
41. Same Tree		41. Same Tree
42. Subtree of Another Tree		42. Subtree of Another Tree
43. Lowest Common Ancestor of a Binary Search Tree		43. Lowest Common Ancestor of a Binary Search Tree
44. Binary Tree Level Order Traversal		44. Binary Tree Level Order Traversal
45. Binary Tree Right Side View		45. Binary Tree Right Side View
46. Count Good Nodes in Binary Tree		46. Count Good Nodes in Binary Tree
47. Validate Binary Search Tree		47. Validate Binary Search Tree
48. Kth Smallest Element in a BST		48. Kth Smallest Element in a BST
49. Construct Binary Tree from Preorder and Inorder Traversal		49. Construct Binary Tree from Preorder and Inorder Traversal
50. Kth Largest Element in a Stream		50. Kth Largest Element in a Stream
51. Last Stone Weight		51. Last Stone Weight
52. K Closest Points to Origin		52. K Closest Points to Origin
53. Kth Largest Element in an Array		53. Kth Largest Element in an Array
54. Task Scheduler		54. Task Scheduler
55. Concatenation of Array		55. Concatenation of Array
56. Longest Common Prefix		56. Longest Common Prefix
57. Remove Element		57. Remove Element
58. Majority Element		58. Majority Element
59. Sort Colors		59. Sort Colors
60. Subarray Sum Equals K		60. Subarray Sum Equals K
61. Reverse String		61. Reverse String
62. Valid Palindrome II		62. Valid Palindrome II
63. Merge Strings Alternately		63. Merge Strings Alternately
64. Merge Sorted Array		64. Merge Sorted Array
65. Remove Duplicates from Sorted Array		65. Remove Duplicates from Sorted Array
66. Rotate Array		66. Rotate Array
67. Boats to Save People		67. Boats to Save People

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

Data Structures and Algorithms Journey 🚀

Overview 📚

Learning Goals 🎯

Repository Structure 📂

Progress 📈

How You Can Contribute 🤝

About

Uh oh!

Releases

Packages

Languages

smebad/DSA

Folders and files

Latest commit

History

Repository files navigation

Data Structures and Algorithms Journey 🚀

Overview 📚

Learning Goals 🎯

Repository Structure 📂

Progress 📈

How You Can Contribute 🤝

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages