Scribd
Upload
16 views

Tech Interview Prep - Curriculum

This 12-week curriculum teaches algorithms and data structures needed to clear coding interviews and get jobs at top tech companies. [It covers] 40+ algorithms in 4 programming languages including arrays, linked lists, trees, graphs, searching, sorting, greedy algorithms, dynamic programming, and bit manipulation. Students learn how to solve problems, analyze runtime, and practice through weekly videos, assignments, live Q&As, and a supportive online community to help them land jobs paying over 12 LPA.

Uploaded by

Vishnu vardhan
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
16 views

Tech Interview Prep - Curriculum

This 12-week curriculum teaches algorithms and data structures needed to clear coding interviews and get jobs at top tech companies. [It covers] 40+ algorithms in 4 programming languages including arrays, linked lists, trees, graphs, searching, sorting, greedy algorithms, dynamic programming, and bit manipulation. Students learn how to solve problems, analyze runtime, and practice through weekly videos, assignments, live Q&As, and a supportive online community to help them land jobs paying over 12 LPA.

Uploaded by

Vishnu vardhan
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/ 19

TIP Curriculum

Your journey to crack tech interviews begins


here

Pratik Singhal
Senior Software Engineer II @ Amazon | Tech
Interview Coach
TOP Highlights of the Program
🔥 Learn Everything required to clear coding tests
& interviews from basics
12- Weeks

🔥 Learn 40+ different algorithms and problem


solving patterns in 4 languages!

🔥 Learn how to crack interviews of top product


companies and startups and get avg CTC > 12 LPA

🔥 Community-driven learning & problem solving

🔥 Live Q&A and direct access to me


🚀 WEEK 1

Objective : Introduction

Introducing you to how algorithms are analyzed


🚀 WEEK 1
Design & Analysis of Algorithms:
👉 How to analyze algorithms? Skills Learned
👉 Introduction to Big-O Notation?
👉 What is time complexity ?
👉 What is space complexity ?
👉 Reverse engineering a solution
�� Analysis Of Algorithms

Complexity Calculation:
👉 Time Complexity Calculation - Standard Case
👉 Time Complexity Calculation - Iterative Case #1
👉 Time Complexity Calculation - Iterative Case #2 �� Reverse Engineering Solutions
👉 Time Complexity Calculation - Standard Case -
Recursive Case
👉 Space Complexity Calculation - Standard Method
👉 Space Complexity Calculation - Recursion Tree
Method
👉 Space Complexity Calculation - Back Substitution
Method
🚀 WEEK 2

Objective : Arrays & Ad-Hoc Problems

Learn the main techniques used in ad-hoc problems


🚀 WEEK 2

Skills Learnt
Arrays:
👉 Why are arrays fastest ?
👉 Understanding resizable arrays �� General Problem solving skills

👉 Problems based on arrays

Two Pointer Approach �� Ad-Hoc problems


👉 Moving pointers towards each other

Sliding Window Approach


👉 Fixed Window Approach �� Common array patterns
👉 Resizable Window
🚀 WEEK 3

Objective : Linked List & Memory Management

Learn about Memory management with Data structures and


linked lists
🚀 WEEK 3

Product Conceptualization: Key Skills Learned

👉 Linked Lists And why we use them


👉 Linked List Standard Technique
�� Memory Management
👉 Linked List Multi Pointer Technique
👉 Linked List Implementation �� Linked Lists
Techniques
👉 Linked List Pointer Manip
Technique �� Problems based on Linked Lists
🚀 WEEK 4

Objective : Searching & Its Applications

Learn the techniques required for searching over arrays and range
🚀 WEEK 4

Search Algorithms:
👉 Binary Search
Key Skills Learned
👉 Linear Search

Search Problems: ��Searching Techniques & Applications


👉 Standard Binary Search
Technique
👉 Modified Binary Search
�� Sub-variations in binary search
problems
Technique
👉 Binary Search Over Range
Technique
👉 Binary Search - Rotation
Technique
🚀 WEEK 5

Objective : Trees & Associated Data Structures

Learn all about trees and the associated problems


🚀 WEEK 5

Key Skills Learned


👉 General Trees & Binary Trees
👉 Types Of Binary Trees
👉 Binary Tree - PostOrder �� Applying diff traversals to solve
Problems problems
👉 Binary Tree - PreOrder
Problems �� Tree construction techniques
👉 Tree Construction Problems
👉 Heaps & Heap Problems
👉 BST Construction Problems �� Adhoc techniques
🚀 WEEK 6

Objective : Graphs (must do for big-tech


companies)

Learn all about graphs and how different graph problems are
solved!
🚀 WEEK 6

Key Skills Learned


Graphs:
👉 Graph Traversal
👉 Shortest Path Problem �� Graph & Traversal

Graph Problems:
👉 Problems based on BFS �� Traversal Problems
👉 Problems based on DFS
👉 0-1 BFS Variations & Ad-Hoc Problems on
👉 Problems based on backedge
�� graphs
calculation
👉 Ad-hoc problems based on graph
🚀 WEEK 7

Greedy Algorithms Project to work on


👉 Greedy Algorithms &
Applications
👉 Greedy + Data Structure ��Greedy Approached & when to apply
?

Dynamic Programming:
👉 Problems based on BFS �� Different ways of applying dynamic
programming
👉 Problems based on DFS
👉 0-1 BFS
👉 Problems based on backedge
calculation
👉 Ad-hoc problems based on graph
🚀 WEEK 8

Project to work on
BitMagic
👉Problems based on Xor & And �� Final Portfolio
👉 Problems based on BitMagic

Networking & Operating Systems: �� Asking for referrals and applying to


companies
👉 Fundamentals of Networking
👉 How hosting works ?
👉 Scheduling & Locking
�� Mock Interviews

Mechanisms
👉 Creating & Building a portfolio
for Free!
🚀 WEEK 9-12

Work

Preparation with Questions and


�� Asking for referrals and applying to
companies
Mock Calls

�� Mock Interviews
🔥 4 Hours of On-Demand Videos Every Week

🔥 Live Q&As with Pratik

🔥 Premium Discord Community

🔥 LIVE Guest sessions by Industry Experts

🔥 Video content in 4 Languages

🔥 3 Bonuses for everyone worth Rs. 5,000

🔥 MEGA BONUS for first 5 Buyers worth


Rs. 24,000

Grab it for Rs. 20,000+GST Rs.34,999

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy