Practice Problem(1D array) | Unique no | Rotation | Duplicate | Prefix & Suffix Sum | placement.....

Timestamps:-
00:00 - Introduction
0:12 - 1. Find the total no of triplets in the Array whose sum is equal to the given value
12:27 - 2. Find the second largest element in the array without sorting it.
26:01 - 3. Find the second smallest element in the array without sorting it.
32:44 - 4. Given an array consisting of integers. Return the first value that is repeating in this array. If no value is being repeated , return -1.
47:04 - 5. Find the unique no in a given Array where all the elements are being repeated twice with one value being unique.
55:02 - 6. Rotate the array to the left by k positions.
1:10:32 - 7. Left rotation (in-place)
1:20:15 - 8. Identify all duplicate elements in the array.
1:28:37 - 9. Prefix Sum
1:37:16 - 10. Prefix Sum (in-place)
1:42:03 - 11. Suffix sum
1:55:04 - 12. Suffix Sum(in-place)