0% found this document useful (0 votes)
6 views

CI DSA Study Guide

The DSA Study Guide provides a comprehensive collection of resources for mastering Data Structures and Algorithms, including playlists, tutorials, and guides on various programming paradigms such as Recursion, Divide & Conquer, and Dynamic Programming. It features recommended materials from reputable sources like Google Engineers and MIT, covering topics from time and space complexity to specific algorithm implementations. The guide also includes links to competitive programming tutorials and best practices for coding interviews.

Uploaded by

ShreyasKumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

CI DSA Study Guide

The DSA Study Guide provides a comprehensive collection of resources for mastering Data Structures and Algorithms, including playlists, tutorials, and guides on various programming paradigms such as Recursion, Divide & Conquer, and Dynamic Programming. It features recommended materials from reputable sources like Google Engineers and MIT, covering topics from time and space complexity to specific algorithm implementations. The guide also includes links to competitive programming tutorials and best practices for coding interviews.

Uploaded by

ShreyasKumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 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