Crack Your Next

CODING
INTERVIEW
www.smartinterviews.in
Hi
There!
Become a
Smart Coder
in 14 weeks.

LEARN EVOLVE <CODE> REPEAT

TABLE OF
CONTENT

About Us 04

Where Do Our Alumni Work? 06

Student Testimonials 07

Course Details

Module I 08

Module II 09

Module III 10

Module IV 11

Contact Details 12
About
Smart Interviews

Smart Interviews is an upskilling platform that caters

to students and working tech professionals.

We have been in the industry

since 2016 and have been upskilling
individuals since then. We are here to
create an ecosystem where we
nurture, educate, and assist
individuals in unlocking their
true potential. We have
structured our course in a
manner where our learners are
equipped to grab any opportunity
that knocks at their door. Students
enrolled with us are mentored by
industry experts and veterans.

About Us Page No - 04
 What Do
We Do?
Smart Interviews offers a
SMART CODER course that aims
at developing DSA skills to crack coding
interviews at top tech companies. We
have a team of instructors and mentors
who guide students, help them overcome
career hurdles, and clear doubts if any. We
have a comprehensive curriculum spread
across 14 weeks in the form of live training
sessions.

Why Do
We Do it?
Back in 2015, while working in the
industry when we visited various
campuses for hiring drives we realized
students weren’t able to crack coding
problems based on simple concepts of
Data Structures & Algorithms. Post this,
we did a market analysis and understood
there is a need to deliver quality
education and upskill the community.
Our sole aim is for this world to have
well-trained and educated engineers at
top tech companies..

About Us Page No - 05
Where do
our Alumni work?
Our alumni are placed at top global companies namely: Microsoft, Amazon, Google, Flipkart,
Qualcomm, Goldman Sachs, Palo Alto, and many more.

Where do our alumni work? Page No - 06

Student
Testimonials

Our students share their thoughts and experience of learning with Smart Interviews and building a
way for their Smart Career. Here’s what a few of them said:

I would definitely In my opinion, interviewers do not I recommend this

recommend this course to look for the exact answer but the course to everyone
anyone who wants to learn Data way how you approach a whose dream is to work in
Structures and Algorithms. The problem, and that's exactly what companies like Amazon,
course is really well-planned and Smart Interviews teaches you - Google, etc. Thanks for the
has an incredible starter code to How to approach a new problem. guidance Smart
work on. Really a good place if you want to Interviews.
develop skills in problem-solving.

Venkatesh Billa Abhishek Agarwal Ankita Srivastava

Best place to learn, grow Best place to learn, grow I recommend this
and most importantly to get and most importantly to get course to everyone
inspired by Amit(Founder). Smart inspired by Amit(Founder). Smart whose dream is to work in
Interviews truly defines - Learn, Interviews truly defines - Learn, companies like Amazon,
Evolve, Excel. After the course, you Evolve, Excel. After the course, you Google, etc. Thanks for the
will feel the change in yourself. will feel the change in yourself. guidance Smart
You will find an immense increase You will find an immense increase Interviews.
in your skillset and far more in your skillset and far more
competitive. I can just say, join competitive. I can just say, join
the course and give a kick the course and give a kick
start to your career graph. start to your career graph.

Srujana Geet Singh Arun Kumar

Student Testimonials Page No - 07

Course Details
We offer the course SMART CODER that is aimed at helping those students who have graduated
recently, working professionals, and those looking to elevate their careers. To join the course, you need
to have knowledge of at least 1 programming language and know the basics of Data Structures
and Algorithms.

Course Curriculum
Module I:

Basics, Complexity Analysis, Bit Manipulation, Recursion

» Basics of programming » Complexity Analysis of » Modular Arithmetic

◆ 32 vs 64 bit Algorithm
» Recursion
◆ Decimal - Binary conversion ◆ Big-O Notation
◆ 32 vs 64 bit
◆ Time & Space
» Data types & operators ◆ Importance of Constraints
◆ Decimal - Binary conversion

◆ Range of data types

» Data types & operators
◆ Types of operators » Bit-Manipulation
◆ Bitwise operators
◆ Bit-masking

Module I Page No - 08
Module II:

Sorting, Searching, Hashing,

Strings, Mixed-Bag

» Sorting Techniques & » Searching Techniques » Hashing

Applications ◆ Linear Search ◆ Why hashing?

◆ Standard sorting algorithms ◆ Binary Search ◆ Hashing Techniques

◆ Applications of Count Sort ◆ Collision Resolutions

◆ Inversion Count
» Applications of Binary ◆ Inbuilt Libraries
Search
» Two pointer technique » Maps and Sets
◆ Lower Bound & Upper Bound
◆ Finding Frequency ◆ Syntax and Usage
» Master's Theorem ◆ Time Complexities
◆ Optimisation problems
◆ Root of a number

» Arrays » Mixed-bag problem-solving » Prime Numbers

◆ Standard sorting algorithms ◆ Arrays & matrices ◆ Sieve of Eratosthenes
◆ Applications of Count Sort ◆ Sorting / Searching / Hashing ◆ Segmented Sieve
◆ Inversion Count ◆ Bit-manipulation
◆ Space optimizations
» Miscellaneous Concepts
» Strings ◆ Game Theory
◆ ASCII representation » Prefix-sum ◆ Meet in the Middle
◆ Rolling Hash ◆ Precomputation
◆ Substring matching ◆ Index marking
◆ Rabin-Karp

Module II Page No - 09
Module III:

Stacks, Queues, Linked Lists, Trees, Heaps, Tries

» Stacks and Queues » Basics of Linked-Lists

◆ Array representations ◆ Insert/Search/Delete/Reverse
◆ Multiple stacks in an array ◆ Sorting on Linked-Lists
◆ Implement queue using stacks ◆ Tortoise & Hare Algorithm
◆ Circular Queue
◆ Doubly Ended Queue » Advanced problems on LL
◆ Intersection point
» Amortized Analysis of ◆ Cycle Detection
Algorithms ◆ Cloning a Linked-List
◆ Dynamic Arrays
» LRU Cache

» Priority Queues » Basics of Trees

◆ Tree Traversals
◆ Min/Max Heap - CBT
◆ Height and Depth
◆ Median of subarrays
◆ CBT and FBT
◆ External Sort
◆ Heapify » Binary Search Trees
» Trie DS and Applications ◆ Insert/Search/Delete

◆ Dictionary & Prefix Matching ◆ Problems on BST

◆ Bit-manipulation with Trie

» Advanced problems on
Trees
◆ Insert/Search/Delete
◆ Problems on BST

Module III Page No - 10

Module IV:

Dynamic Programming and Graph Theory

» Basics of Dynamic » The Knapsack Problem » Introduction to Graph Theory

Programming ◆ Computing nCr » Basics of Graph Theory
◆ Memoization vs Tabulation ◆ Fractional and Integer ◆ Traversals - BFS & DFS
◆ Applications of Fibonacci ◆ Applications of Knapsack ◆ Cycle Detection

» Subarrays and Subsequences » Matrix DP » Important Graph Algorithms

◆ Maximum Subarray Sum ◆ Dijkstra's Algorithm
◆ Number of Ways
◆ Non-adjacent Subsequence ◆ Topological Sorting
◆ Submatrix Sum
◆ Longest Increasing Subsequence ◆ Kruskal's Algorithm - MST
◆ Matrix Chain Multiplication
◆ Bipartite Graphs
» Miscellaneous Problems on DP ◆ Optimal Strategy Game

Module IV Page No - 11
 SM RT
INTERVIEWS


LEARN | EVOlvE | EXCEL

7272-937-937

[email protected]

smartinterviews.in

Follow us on

smartinterviews

smartinterviews

SmartInterviews

smart_interview

company/smart-interviews

profile/Smart-Interviews-2

Contact Details Page No - 12