The 3 exercises in this path all involve considering the time complexities involved with the data structures you're using.
Should you use a list, a set, a dictionary, or some combination of the three? And are there any tools in the standard library to help you accomplish your goal in a time-efficient way?
| Exercises included |
|---|
| MinHeap |
| SortedList |
| OrderedDict |