Skip to content

Conversation

@Hitesh1090
Copy link

No description provided.

@super30admin
Copy link
Owner

  • hIndex.py: Your solution is correct but could be optimized to O(n) time complexity using a bucket sort approach. Consider using an array to count citations and then determine the h-index from there. Also, consider using more descriptive variable names for better readability.
  • rotateArray.py: Excellent job! Your solution is optimal in both time and space complexity. The use of a helper function for reversing is a good practice.
  • trapRain.py: Well done! Your solution is optimal and correctly handles the problem. The stack-based approach is efficient and clear.

Overall, your solutions are correct and well-structured, but the h-index solution could be improved in terms of time complexity. Keep up the good work!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants