LeetCode Solutions

LeetCode_Solutions/README.md

@@ -30,8 +30,11 @@
 |  [852. Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)  |  [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_13/Lecture_Codes/852.cpp), [Solution2](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  |
+|  [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  |
+|  [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  |
+|  [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  |
 |  [1910. Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_22/Lecture_Codes/1910.cpp)  |  Medium  |
 |  [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_05/Lecture_Codes/1281.cpp)  |  Easy  |
 |  [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)  | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_21/Lecture_Codes/1752.cpp)  |  Easy  |