You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| No | Problem Name | Description | LeetCode | GFG |
@@ -40,6 +40,9 @@
40
40
| 18 |[Rotate Array](https://github.com/JawadSher/DSA-LeetCode-Problems-Repository/tree/main/05%20-%20Arrays%20Based%20Problems/Rotate%20Array)| Rotate the elements of an array to the right by a given number of steps. |[Link](https://leetcode.com/problems/rotate-array/description/)| Non |
41
41
| 19 |[Sum of Two Numbers Represented as Arrays](https://github.com/JawadSher/DSA-LeetCode-Problems-Repository/tree/main/05%20-%20Arrays%20Based%20Problems/Sum%20of%20Two%20Numbers%20Represented%20as%20Arrays)| Compute the sum of two large numbers represented as arrays. | Non |[Link](https://www.geeksforgeeks.org/problems/sum-of-two-numbers-represented-as-arrays3110/1)|
42
42
| 20 |[Print Like a Wave 2D Array](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/05%20-%20Arrays%20Based%20Problems/Print%20Like%20a%20Wave%202D%20Array)| Print a 2D array in a wave pattern, alternating column traversal direction. | Non | Non |
43
+
| 21 |[Immediate Smaller Element](https://github.com/JawadSher/Data-Structures-Algorithms-Based-Problems/tree/main/05%20-%20Arrays%20Based%20Problems/Immediate%20Smaller%20Element)| Find the immediate smaller element for every element in the array. | Non |[Link](https://practice.geeksforgeeks.org/problems/immediate-smaller-element1142/1)|
44
+
| 22 |[Reverse String](https://github.com/JawadSher/Data-Structures-Algorithms-Based-Problems/tree/main/05%20-%20Arrays%20Based%20Problems/Reverse%20String)| Reverse the characters of a string stored in an array. |[Link](https://leetcode.com/problems/reverse-string/)| Non |
45
+
| 23 |[Maximum Subarray](https://github.com/JawadSher/Data-Structures-Algorithms-Based-Problems/tree/main/05%20-%20Arrays%20Based%20Problems/Maximum%20Subarray)| Find the contiguous subarray with the maximum sum. |[Link](https://leetcode.com/problems/maximum-subarray/)| Non |
0 commit comments