Problems:

1. Possible Executions Analysis ✅
2. Stack with Elimination ✅
3. Michael-Scott Queue ✅
4. Parallel Dijkstra with Multi-Queue ✅
5. Lock-Free Set via Linked Lists ✅
6. Fine Grained Bank ✅
7. Lamport Lock Fail ✅
8. Monotonic Clock ✅
9. JMM Quizzes (нужно сделать до 9.10)
10. Universal Construction ✅
11. Dynamic Array ✅
12. Hash Table (НЕОБЯЗАТЕЛЬНО)
13. Skip List (НЕОБЯЗАТЕЛЬНО)
14. FAA-Based Queue ✅
15. Flat-Combining Priority Queue ✅
16. MSQueue-Based Synchronous Queue ✅
17. MCS Lock ✅
18. Lock-Free Bank ✅
19. CASN (НЕОБЯЗАТЕЛЬНО)
20. Blocking Stack (НЕОБЯЗАТЕЛЬНО) ✅
21. STM Bank ✅