Skip to content

Commit

Permalink
LeetCode Solutions
Browse files Browse the repository at this point in the history
  • Loading branch information
@kishanrajput23
kishanrajput23 authored Nov 3, 2024
1 parent ae61c4a commit 4a76d63
Showing 1 changed file with 1 addition and 0 deletions.
1 change: 1 addition & 0 deletions LeetCode_Solutions/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -34,6 +34,7 @@
| [1039. Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_116/Lecture_Codes/1039_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_116/Lecture_Codes/1039_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_116/Lecture_Codes/1039_3.cpp) | Medium |
| [1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_22/Homework/1047.cpp) | Easy |
| [1207. Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_10/Homework/1207.cpp) | Easy |
| [1388. Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_121/Lecture_Codes/1388_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_121/Lecture_Codes/1388_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_121/Lecture_Codes/1388_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_121/Lecture_Codes/1388_4.cpp) | Hard |
| [1402. Reducing Dishes](https://leetcode.com/problems/reducing-dishes/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_118/Lecture_Codes/1402_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_118/Lecture_Codes/1402_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_118/Lecture_Codes/1402_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_118/Lecture_Codes/1402_4.cpp), [Solution5](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_118/Lecture_Codes/1402_5.cpp) | Hard |
| [1691. Maximum Height by Stacking Cuboids](https://leetcode.com/problems/maximum-height-by-stacking-cuboids/description/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_120/Lecture_Codes/1691.cpp) | Hard |
| [1824. Minimum Sideway Jumps](https://leetcode.com/problems/minimum-sideway-jumps/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_117/Lecture_Codes/1824_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_117/Lecture_Codes/1824_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_117/Lecture_Codes/1824_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_117/Lecture_Codes/1824_4.cpp) | Medium |
Expand Down

0 comments on commit 4a76d63

Please sign in to comment.