GFG Solutions

GFG_Solutions/README.md

@@ -51,6 +51,7 @@
 |  [Is Binary Tree Heap](https://www.geeksforgeeks.org/problems/is-binary-tree-heap/1)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_75/Lecture_Codes/is_binary_tree_heap.cpp)  |  Medium  |
 |  [Convert BST to Min Heap](https://www.geeksforgeeks.org/convert-bst-min-heap/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_75/Lecture_Codes/convert_bst_to_min_heap.cpp)  |  Medium  |
 |  [Get Minimum Squares](https://www.geeksforgeeks.org/problems/get-minimum-squares0538/1)  |  [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_112/Lecture_Codes/get_minimum_squares_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_112/Lecture_Codes/get_minimum_squares_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_112/Lecture_Codes/get_minimum_squares_3.cpp)  |  Medium  |
+|  [Largest square formed in a matrix](https://www.geeksforgeeks.org/problems/largest-square-formed-in-a-matrix0806/1)  |  [Solution1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_115/Lecture_Codes/largest_square_formed_in_a_matrix_1.cpp), [Solution2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_115/Lecture_Codes/largest_square_formed_in_a_matrix_2.cpp), [Solution3](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_115/Lecture_Codes/largest_square_formed_in_a_matrix_3.cpp), [Solution4](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_115/Lecture_Codes/largest_square_formed_in_a_matrix_4.cpp)  |  Medium  |
 |  [Max Rectangle](https://www.geeksforgeeks.org/problems/max-rectangle/1)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_57/Lecture_Codes/max_rectangle.cpp)  |  Hard  |
 |  [Clone a linked list with next and random pointer](https://www.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)  |  [Solution 1](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_52/Lecture_Codes/Clone_a_linked_list_with_next_and_random_pointer_approach-1.cpp), [Solution 2](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_52/Lecture_Codes/Clone_a_linked_list_with_next_and_random_pointer_approach-2.cpp)  |  Hard  |
 |  [Sum of minimum and maximum elements of all subarrays of size k](https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/)  |  [Solution](https://github.com/kishanrajput23/Love-Babbar-CPP-DSA-Course/blob/main/Lectures/Lecture_61/Lecture_Codes/sum_of_max_min.cpp)  |  Hard  |