diff --git a/LeetCode_Solutions/README.md b/LeetCode_Solutions/README.md
index 03beaf7..43afc02 100644
--- a/LeetCode_Solutions/README.md
+++ b/LeetCode_Solutions/README.md
@@ -21,6 +21,7 @@
 |  [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_23/Lecture_Codes/240.cpp)  |  Medium  |
 |  [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/)  | [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_20/Lecture_Codes/283.cpp)  |  Easy  |
 |  [344. Reverse String](https://leetcode.com/problems/reverse-string/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_22/Lecture_Codes/344.cpp)  |  Easy  |
+|  [354. Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/description/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_119/Lecture_Codes/354.cpp)  |  Hard  |
 |  [442. Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_10/Homework/442.cpp)  |  Medium  |
 |  [443. String Compression](https://leetcode.com/problems/string-compression/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_22/Lecture_Codes/443.cpp)  |  Medium  |
 |  [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_32/Lecture_Codes/509.cpp)  |  Easy  |
@@ -34,6 +35,7 @@
 |  [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  |
+|  [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  |
 |  [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  |