LeetCode Solutions

kishanrajput23 · Sep 21, 2024 · 3272698 · 3272698
1 parent bf502a6
commit 3272698
Showing 1 changed file with 1 addition and 2 deletions.
diff --git a/LeetCode_Solutions/README.md b/LeetCode_Solutions/README.md
@@ -27,8 +27,7 @@
 |  [567. Permutation in String](https://leetcode.com/problems/permutation-in-string/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_22/Lecture_Codes/567.cpp)  |  Medium  |
 |  [724. Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_13/Homework/724.cpp)  |  Easy  |
 |  [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  |
+|  [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  |
 |  [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  |