I have planned on resuming Algorithms and Data Structures and get back on Competitive Coding @TopCoder @hackerrank @Codeforces. I plan to finish the following topics by 2020, the guy who prepared to get into Google in 8 months starting from scratch and ended up getting into Amazon used it, so it should do me justice too especially since I have 10 months in hand. This is a excerpt of exact syllabus structure he used for his preparation  :

• Algorithmic complexity / Big-O / Asymptotic analysis
• Data Structures
  • Arrays
  • Linked Lists
  • Stack
  • Queue
  • Hash table
• More Knowledge
  • Binary search
  • Bitwise operations
• Trees
  • Trees - Notes & Background
  • Binary search trees: BSTs
  • Heap / Priority Queue / Binary Heap
  • balanced search trees (general concept, not details)
  • traversals: preorder, inorder, postorder, BFS, DFS
• Sorting
  • selection
  • insertion
  • heapsort
  • quicksort
  • merge sort
• Graphs
  • directed
  • undirected
  • adjacency matrix
  • adjacency list
  • traversals: BFS, DFS
• Even More Knowledge
  • Recursion
  • Dynamic Programming
  • Object-Oriented Programming
  • Design Patterns
  • Combinatorics (n choose k) & Probability
  • NP, NP-Complete and Approximation Algorithms
  • Caches
  • Processes and Threads
  • Testing
  • Scheduling
  • String searching & manipulations
  • Tries
  • Floating Point Numbers
  • Unicode
  • Endianness
   

[ source] : https://github.com/jwasham/coding-interview-university