You've worked through DP and design problems.
Bottom-up DP for string segmentation (Word Break)
Hash map + doubly linked list for cache operations (LRU Cache)
Triple hash map for frequency-based eviction (LFU Cache)
DP + binary search for non-overlapping job selection (Maximum Profit in Job Scheduling)
2D DP for partitioning work across days (Minimum Difficulty of a Job Schedule)
You've finished the coding sections. Next: system design at Amazon.