Array-3 completed

[sathvikareddy18]

No description provided.

[super30admin]

• h_index_1.py: Your solution is correct and efficient in terms of space, but the time complexity can be improved from O(n log n) to O(n) by using a bucket sort approach. Consider using an array to count the number of papers with each citation count, similar to the reference solution.
• rotate_array_k.py: Excellent job! Your solution is optimal in both time and space complexity, and the code is well-structured and readable.
• trapping_water.py: Great work! Your solution is optimal and handles the problem efficiently with clear logic. The two-pointer approach is well-implemented.

Overall, your solutions are correct and well-written, but there is room for optimization in the h-index problem. Keep up the good work!