You now have a map of CS fundamentals.
Big O: Describe time and space complexity for every solution
Arrays, strings, hash tables: %+ of problems use these
Linked lists, stacks, queues: Understand the basics
Trees and graphs: Focus on BFS and DFS
Recursion and sorting: Know the concepts
Study patterns, not random problems. - focused problems beats random ones.
For thorough coverage, work through the Data Structures roadmap alongside your job search. Next, you'll learn how to structure your overall interview prep.