Merge pull request #3 from dpvasani/dpvasani-Readme--UptoDay-11

Update README.md
dpvasani · Jul 26, 2024 · e455f74 · e455f74
2 parents db9203e + 8956de8
commit e455f74
Showing 1 changed file with 23 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -1,4 +1,21 @@
 # 30 Days of DSA 🚀
+![GSSoC '24 Mentor  7K+ Family @Linkedin  Mentor At @topmate io  Building @CryptoMinds  MERN Stack Web Developer  Web 3 0  Blockchain Developer  Career Counselor  Graphic Designer](https://github.com/user-attachments/assets/fbad9128-07fc-4118-b21f-7da0371384c1)
+
+## 🌐 Socials:
+
+
+<h3 align="left">Connect with me : </h3>
+<p align="left">
+  <a href="https://x.com/vasanidarshan56" target="blank"><img align="center" src="https://raw.githubusercontent.com/rahuldkjain/github-profile-readme-generator/master/src/images/icons/Social/twitter.svg" alt="dpvasani_56" height="30" width="40" /></a>
+  <a href="https://www.linkedin.com/in/dpvasani56/" target="blank"><img align="center" src="https://raw.githubusercontent.com/rahuldkjain/github-profile-readme-generator/master/src/images/icons/Social/linked-in-alt.svg" alt="Darshan Vasani" height="30" width="40" /></a>
+  <a href="https://www.instagram.com/dp_vasani56" target="blank"><img align="center" src="https://raw.githubusercontent.com/rahuldkjain/github-profile-readme-generator/master/src/images/icons/Social/instagram.svg" alt="dp_vasani56" height="30" width="40" /></a>
+  <a href="https://leetcode.com/u/dpvasani_56/" target="blank"><img align="center" src="https://raw.githubusercontent.com/rahuldkjain/github-profile-readme-generator/master/src/images/icons/Social/leet-code.svg" alt="dpvasani_56" height="30" width="40" /></a>
+  <a href="https://www.geeksforgeeks.org/user/vadanidp0qg/" target="blank"><img align="center" src="https://raw.githubusercontent.com/rahuldkjain/github-profile-readme-generator/master/src/images/icons/Social/geeks-for-geeks.svg" alt="vadanidp0qg" height="30" width="40" /></a>
+  <a href="https://linktr.ee/dpvasani56" target="blank"><img align="center" src="https://github.com/dpvasani/dpvasani/assets/109815626/789d1777-6921-4b0f-8740-e85977a95dfc" alt="dpvasani56" height="40" width="40" /></a>
+  <a href="https://topmate.io/dpvasani_56" target="blank"><img align="center" src="https://github.com/dpvasani/dpvasani/assets/109815626/32b286b1-8629-4a9f-b264-5616342de401" alt="dpvasani_56" height="30" width="30" /></a>
+</p>
+
+
 
 Welcome to my 30 Days of Data Structures and Algorithms series! Follow my journey as I solve various DSA problems day by day. Each day's progress is documented below with links to the solutions.
 
@@ -16,3 +33,9 @@ Welcome to my 30 Days of Data Structures and Algorithms series! Follow my journe
 | 10   | Recursion, Dynamic Programming, String Manipulation | 1. Number of Dice Rolls With Target Sum<br>2. Best Time to Buy and Sell Stock<br>3. House Robber<br>4. Integer to English Words<br>5. Perfect Squares<br>6. Add Strings<br>7. Wildcard Matching<br>8. Climbing Stairs<br>9. Minimum Cost For Tickets<br>10. Cut Into Segments<br>11. Last Occurrence Of Char<br>12. Maximum Sum Of Non Adjacent Elements<br>13. Palindrome Check Re<br>14. Print SubArray Re<br>15. Recursion Level II<br>16. Recursion Level III<br>17. Remove All Occurrences Of A SubArray<br>18. Reverse A String Using Recursion<br>19. Subsequence-Of-String<br>20. Time & Space Complexity For Recursive Solution<br>21. Robot Collisions <br>22. Subsequence-Of-String<br>23. Recursion-Level-I <br>24. Recursion-Level-IV| [1. Number of Dice Rolls With Target Sum](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/1155.%20Number%20of%20Dice%20Rolls%20With%20Target%20Sum.cpp)<br>[2. Best Time to Buy and Sell Stock](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.cpp)<br>[3. House Robber](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/198.%20House%20Robber.cpp)<br>[4. Integer to English Words](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/273.%20Integer%20to%20English%20Words.cpp)<br>[5. Perfect Squares](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/279.%20Perfect%20Squares.cpp)<br>[6. Add Strings](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/415.%20Add%20Strings.cpp)<br>[7. Wildcard Matching](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/44.%20Wildcard%20Matching.cpp)<br>[8. Climbing Stairs](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/70.%20Climbing%20Stairs.cpp)<br>[9. Minimum Cost For Tickets](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/983.%20Minimum%20Cost%20For%20Tickets.cpp)<br>[10. Cut Into Segments](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Cut%20Into%20Segments.cpp)<br>[11. Last Occurrence Of Char](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Last%20Occurrence%20Of%20Char.cpp)<br>[12. Maximum Sum Of Non Adjacent Elements](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Maximum%20Sum%20Of%20Non%20Adjacent%20Elements.cpp)<br>[13. Palindrome Check Re](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Palindrome%20Check%20Re.cpp)<br>[14. Print SubArray Re](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Print%20SubArray%20Re.cpp)<br>[15. Recursion Level II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Recursion%20Level%20II.cpp)<br>[16. Recursion Level III](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Recursion%20Level%20III.cpp)<br>[17. Remove All Occurrences Of A SubArray](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Remove%20All%20Occurrences%20Of%20A%20SubArray.cpp)<br>[18. Reverse A String Using Recursion](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Reverse%20A%20String%20Using%20Recursion.cpp)<br>[19. Subsequence-Of-String](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Subsequence-Of-String.cpp)<br>[20. Time & Space Complexity For Recursive Solution](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Time%20%26%20Space%20Complexity%20For%20Recursive%20Solution.cpp)<br>[21. Robot Collisions](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/2751.%20Robot%20Collisions.cpp)<br>[22. Subsequence-Of-String (main.cpp)](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Subsequence-Of-String/main.cpp)<br>[23. Recursion-Level-I (main.cpp)](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Recursion-Level-I/main.cpp)<br>[24. Recursion-Level-IV (main.cpp)](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2010/Recursion-Level-IV/main.cpp) |
 | 11   | Backtracking, Divide and Conquer, Dynamic Programming | 1. Count Inversion<br>2. DnC Level I<br>3. DnC Level II<br>4. DnC Level III<br>5. DnC Level IV<br>6. N-Queen Problem Optimized<br>7. Best Time to Buy and Sell Stock II<br>8. Count Negative Numbers in a Sorted Matrix<br>9. Sort Array by Increasing Frequency<br>10. Distribute Repeating Integers<br>11. Letter Combinations of a Phone Number<br>12. Add Two Numbers<br>13. Sort the Jumbled Numbers<br>14. Generate Parentheses<br>15. Sort the People<br>16. Divide Two Integers<br>17. Longest Substring Without Repeating Characters<br>18. Find First and Last Position of Element in Sorted Array<br>19. Sudoku Solver<br>20. Combination Sum<br>21. Combination Sum II<br>22. Find Right Interval<br>23. Permutations<br>24. Permutations II<br>25. N-Queens<br>26. N-Queens II<br>27. Beautiful Arrangement<br>28. Maximum Subarray<br>29. Merge Sorted Array<br>30. Gray Code<br>31. Palindrome Number<br>32. Sort an Array Inplace Merge Sort<br>33. Quick Sort<br>34. Rat In A Maze<br>35. Time And Space Complexity Of DnC<br>36. Add Two Numbers II<br>37. Word Search<br>38. Binary Tree Maximum Path Sum | [1. Count Inversion](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/Count%20Inversion.cpp)<br>[2. DnC Level I](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/DnC%20Level%20I.cpp)<br>[3. DnC Level II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/DnC%20Level%20II.cpp)<br>[4. DnC Level III](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/DnC%20Level%20III.cpp)<br>[5. DnC Level IV](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/DnC%20Level%20IV.cpp)<br>[6. N-Queen Problem Optimized](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/N-Queen%20Problem%20Optimized.cpp)<br>[7. Best Time to Buy and Sell Stock II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.cpp)<br>[8. Count Negative Numbers in a Sorted Matrix](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/1351.%20Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix.cpp)<br>[9. Sort Array by Increasing Frequency](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/1636.%20Sort%20Array%20by%20Increasing%20Frequency.cpp)<br>[10. Distribute Repeating Integers](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/1655.%20Distribute%20Repeating%20Integers.cpp)<br>[11. Letter Combinations of a Phone Number](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/17.%20Letter%20Combinations%20of%20a%20Phone%20Number.cpp)<br>[12. Add Two Numbers](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/2.%20Add%20Two%20Numbers.cpp)<br>[13. Sort the Jumbled Numbers](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/2191.%20Sort%20the%20Jumbled%20Numbers.cpp)<br>[14. Generate Parentheses](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/22.%20Generate%20Parentheses.cpp)<br>[15. Sort the People](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/2418.%20Sort%20the%20People.cpp)<br>[16. Divide Two Integers](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/29.%20Divide%20Two%20Integers.cpp)<br>[17. Longest Substring Without Repeating Characters](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/3.%20Longest%20Substring%20Without%20Repeating%20Characters.cpp)<br>[18. Find First and Last Position of Element in Sorted Array](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.cpp)<br>[19. Sudoku Solver](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/37.%20Sudoku%20Solver.cpp)<br>[20. Combination Sum](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/39.%20Combination%20Sum.cpp)<br>[21. Combination Sum II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/40.%20Combination%20Sum%20II.cpp)<br>[22. Find Right Interval](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/436.%20Find%20Right%20Interval.cpp)<br>[23. Permutations](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/46.%20Permutations.cpp)<br>[24. Permutations II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/47.%20Permutations%20II.cpp)<br>[25. N-Queens](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/51.%20N-Queens.cpp)<br>[26. N-Queens II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/52.%20N-Queens%20II.cpp)<br>[27. Beautiful Arrangement](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/526.%20Beautiful%20Arrangement.cpp)<br>[28. Maximum Subarray](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/53.%20Maximum%20Subarray.cpp)<br>[29. Merge Sorted Array](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/88.%20Merge%20Sorted%20Array.cpp)<br>[30. Gray Code](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/89.%20Gray%20Code.cpp)<br>[31. Palindrome Number](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/9.%20Palindrome%20Number.cpp)<br>[32. Sort an Array Inplace Merge Sort](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/912.%20Sort%20an%20Array%20Inplace%20Merge%20Sort.cpp)<br>[33. Quick Sort](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/30.%20Quick%20Sort.cpp)<br>[34. Rat In A Maze](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/41.%20Rat%20In%20A%20Maze.cpp)<br>[35. Time And Space Complexity Of DnC](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/Time%20And%20Space%20Complexity%20Of%20DnC.cpp)<br>[36. Add Two Numbers II](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/2.%20Add%20Two%20Numbers%20II.cpp)<br>[37. Word Search](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/79.%20Word%20Search.cpp)<br>[38. Binary Tree Maximum Path Sum](https://github.com/dpvasani/30-Days-Of-DSA/blob/main/Day%2011/124.%20Binary%20Tree%20Maximum%20Path%20Sum.cpp) |
 ---
+
+
+## Leetcode
+![](https://leetcard.jacoblin.cool/dpvasani_56?ext=activity)
+
+