From bf502a6ce4ec69857d0d19070565be98e96904b5 Mon Sep 17 00:00:00 2001 From: Kishan Kumar Rai Date: Sat, 21 Sep 2024 23:14:49 +0530 Subject: [PATCH] LeetCode Solutions --- LeetCode_Solutions/README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/LeetCode_Solutions/README.md b/LeetCode_Solutions/README.md index 1e4fdc4..7e60670 100644 --- a/LeetCode_Solutions/README.md +++ b/LeetCode_Solutions/README.md @@ -29,6 +29,7 @@ | [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_103/Lecture_Codes/746_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_103/Lecture_Codes/746_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_103/Lecture_Codes/746_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_103/Lecture_Codes/746_4.cpp) | Easy | | [852. Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_13/Lecture_Codes/852.cpp) | Medium | | [852. Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_33/Homework/852.cpp) | Medium | +| [983. Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/description/) | [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_113/Lecture_Codes/983_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_113/Lecture_Codes/983_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_113/Lecture_Codes/983_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_114/Lecture_Codes/983_4.cpp) | Medium | | [1009. Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_07/Lecture_Codes/1009.cpp) | Easy | | [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 |