You are on page 1of 1

DSA STUDY GUIDE

Coding Interview Study Materials for Data Structure & Algorithm

TIME & SPACE COMPLEXITY PROGRAM. PARADIGM


• Bari’s Algorithm Playlist(1-16) Recursion Brute Force Backtracking
Branch & Bound Divide & Conquer
DATA STRUCTURE Greedy Dynamic Programming

• Data Structures Full Tutorial from a Google Engineer


RECURSION
ALGORITHMS • Recursion Playlist by mycode-
school on Youtube
Math
Others • Bari’s Algorithm Playlist(18-29)
• SparkNotes on Types of Recursion
Graph Theory
• Chapter 4 from Introduction to Al-
gorithm by CLRS

Programming Paradigm
Implementation & Ad-hoc Problems DIVIDE & CONQUER
IMPLEMENTATION & AD-HOC • Bari’s Algorithm Playlist(18, 33-38)

• Implementation Section of Hackerrank


BACKTRACKING
GRAPH THEORY • Bari’s Algorithm Playlist(63-67)
• Graph Theory Full Tutorial from a Google Engineer
BRANCH & BOUND
MATH
• Bari’s Algorithm Playlist(68-71)
• MIT 6.042J Mathematics for Computer Science(Playlist)
• MIT 6.042J Mathematics for Computer Science(Text) GREEDY
• Competitive Programming Algorithms(Algebra Section)
• Bari’s Algorithm Playlist(39-45)
OTHERS(STRING & BIT MANIPULATION)
DYNAMIC PROGRAM.
• Competitive Programming Algorithms(String Section) • Dynamic Programming Patterns by
• HackerEarth Bit Manipulation Tutorial aatalyk on LeetCode.
• TopCoder Fun with Bits Tutorial • Bari’s Algorithm Playlist(46-60)
• Tushar Roy’s Dynamic Programing
BEST DSA STUDY LINKS (GOLD) Playlist on Youtube
• TopCoder Competitive Programming Tutorials • MIT OCW Introduction to
• Technical Interview Guide by Yangshun Algorithm(19,20-22,26-27,39-45)
• HackerEarth CodeMonk(Step by step Guide) • What is memoization and how can I
use it in Python?

You might also like