| Problem | Difficulty Level | Time Complexity | Space Complexity | Solution |
|---|---|---|---|---|
| Non - Decreasing Array | Medium | O(n) | O(1) | Python Solution Code |
| Avoid Floods in the city | Medium | O(nlogn) | O(n) | Python Solution Code |
| Count Good Meals | Medium | O(n) | O(n) | Python Solution Code |
| Make Sum Divisible by p | Medium | O(n) | O(n) | Python Solution Code |
| Running Sum of 1d Array | Easy | O(n) | O(1) | Python Solution Code |
| Kids With the Greatest Number of Candies | Easy | O(n) | O(1) | Python Solution Code |
| Shuffle the Array | Easy | O(n) | O(n) | Python Solution Code |
| Richest Customer Wealth | Easy | O(n) | O(1) | Python Solution Code |
| Number of Good Pairs | Easy | O(n) | O(n) | Python Solution Code |
venkateshelangovan/IIT-H-Course-Work-
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published