Data Structures and Algorithms for Coding Interviews

• Level: Beginner to Intermediate
• Duration: 8 weeks
• Category: Interview Preparation

Work through the patterns behind interview coding rounds in Java or Kotlin: arrays and strings, hash maps, two pointers, recursion, trees, graphs and dynamic programming, with timed practice every week.

What you will learn

• Recognise the pattern behind a problem instead of memorising answers
• Work out time and space complexity with confidence
• Solve medium-level problems inside the time limit
• Explain your approach out loud the way interviewers expect
• Finish with a revision sheet and a practice routine

Topics covered

• Complexity analysis
• Arrays and strings
• Hash maps and sets
• Two pointers and sliding window
• Stacks and queues
• Recursion and backtracking
• Sorting and searching
• Linked lists
• Trees and binary search trees
• Graphs and BFS/DFS
• Dynamic programming
• Timed mock rounds