Master's

program

DATA
STRUCTURES
& ALGORITHMS
Designed For Working Professionals

Guaranteed job referrals in top Tier one companies and FAANG companies
Get hands-on practice with over 1000+ data structures and algorithm exercises
Master 60+ System design case studies, Learn practical use of 25+ Design Patterns
Coding interviews and competitive programming problems from Leetcode and other portals

Classroom Training in Bangalore | Live Online Training | 6 Months Certification Program

www.learnbay.io
 PROGRAM HIGHLIGHTS
Learnbay offers Industry Accredited data structures and algorithms Certification. The program which is
designed for working professionals. Course features resume preparation industry projects and 2
capstone projects under the mentor-ship and guidance of data structures and algorithms experts.

Course is especially designed for working professionals having 1+ years of experience in any domain. Our
course is best suited for professionals looking to change their current domain and start a new career in
FAANG companies or tier one product based MNCs .

Live Sessions By Expert Project Based Learning Life Time Access With Updates
Classroom training in Bangalore Real World Industry Projects Flexibility to attend multiple
Live Faculty led Online Training 2 Capstone Projects batches from different trainers
500+ hrs of Interactive Classes Mentorship & Guidance By Life time Live class access &
Expert access to Recordings

Special Support to Non Global Certification in Data Job Assistance Program

Programmers structures and algorithms For Working Professionals
Learn Python from scratch Certified Data structures and Resume support from expert
Special classes for Non algorithms program. Interview prep session and
programming background students Industry Accredited Global mock interview
Real time Use Cases from multiple Certification Course. Guaranteed job referrals for
domain In Collaboration with Learnbay working professionals

Top Rated Training Become Certified Data 4.8 Top Rated

Institute in India For structures &
4.9
Data structures and algorithms Expert 500+ user Review
Algorithms

Click to read review

click to Whatsapp www.learnbay.io

 PROGRAM DETAILS

Program Eligibility

Work Experience :
Working Professionals With 1+ Years of experience in any domain.

Academics :
BE/B.Tech (from any branch), MCA/ M.Tech, Graduation in Mathematics, Statistics, IT

Who Should Apply

Software developers/Programmers, Project Managers, Manual And Automation Test Engineer, Java and
.NET Developer, Informatics, Business Analyst.
Database Admin, System Admin, Professionals from Sales, Marketing, Operations.
SAP domain expert, Python, Embedded developer, Android/iOS developer.
Manufacturing, Mechanical, Electrical, Automobiles, Telecom domain. We have domain-specific projects
from these sectors.
Professionals planning for Masters or higher education in Engineering domain.

About Instructors

Our instructors are working professionals graduated from premier institutes like BITS Pilani, IIT Roorkee and
working in companies as Lead Engineer with expertise in data structures & algo.

Instructors Working in

Course Prerequisite

PREREQUISITE KNOWLEDGE - JAVA , Python, C++, C and C# programming language

Fees and Duration

Weekend Batches : 6 Months Program Fee: Rs 30,000/-

To know more about applicable discount, next batch
Saturday & Sunday - 5 hours details...
Live chat on WhatsApp

Whatsapp www.learnbay.io
Course Features:
Life time support (Technical & Interview).
Repeat full course multiple times (without paying any additional fees).
1000+ Assignments, Endless problem solving training, Get recording of all the classes.
Assistance in Real time industry project.
Job Reference, Internship for selected fresher's in startups, Course completion certificate.
Never ending coding session - Discuss Google, Microsoft, Amazon, Uber, Netflix coding
questions asked during interviews.
Come up with you questions will solve it for you.

ONLINE CODING PLATFORMS USED

Master Important Data Structures

Whatsapp www.learnbay.io
MASTER IMPORTANT ALGORITHMS

Global Certification in Data structures &

algorithms
Become an industry expert with Data structures and algorithms Master's
Program in collaboration with Learnbay. Upon completion of this Program, you
will receive the certificate from Learnbay which will help you to become
industry ready .

Get Industry-renowned global certification in Data structures and algorithms.

Our certification is recognized globally and industry-wide in companies like JP
Morgan, Morgan Stanley, Wells Fargo, Antuit, Genpact, Cognizant, Delloite, E&Y,
Tredence Analytics, Mu-sigma, and other top MNCs and Banking & Finance
companies . .

Whatsapp www.learnbay.io
Demo & Sample Class Recordings

Data SYSTEM
STRUCTURE DESIGN
AND AND
ALGORITHM DESIGN
PATTERN

DATA
STRUCTURE
COMPETITIVE AND
PROGRAMMING ALGORITHM
USING PYTHON

ADVANCED
SYSTEM
PROBLEM
DESIGN
SOLVING

Watch more demo session

Whatsapp www.learnbay.io
 JOB ASSISTANCE

1 2 3 4 5
Resume
Certificate Project Preparation Job Referral
Update

After completion Attend project After Start preparing Once you get
of your program sessions from certification and youself with eligible, you will
you have to pass industry experts project session mock interviews start getting
final exam to get to get a hands on update your and guided guarenteed
Learnbay experience of real resume. interview Interview Calls
Certificate. time projects. sessions

Eligibility Criteria
Should have completed Term 1,2 and Term 3 of our program (Refer Course brochure for
details)
Should have more than 1 Year of work experience (in any Domain)
Should have scored passing marks in final Certification exam
Should have completed 70% of Assignments and case studies
At-least completed 2 Projects (Mentored and guided by our expert)

To know more about Guaranteed Interview call, Job Referral & Industrial Projects

Whatsapp Now

Whatsapp www.learnbay.io
PLACEMENT AND SUCCESS STORIES

Krishna Reddy Nikhil Goyal

Working at BlackHoles pvt ltd. Working at Plivo

Excellent place for anyone who needs a long-term career I enrolled for Data Structures and Algorithms
in the IT field. World-class trainers have been giving sessions course at Learnbay. Prateek Sir’s teaching methodology has
with in-depth details!! I have completed data structures and been really engaging. He entertains all the approaches in the
Algorithms and look forward to enrolling in other sessions too. class which helped us to see the problems from multiple angles.
The way of explanation will be very interesting and in-depth, He focuses primarily on the idea behind the problem which
smart techniques. helps us to build our own code.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Anant Raj Singh Neha Guar

Working at McAfee Working at Walmart Labs India
Learnbay is the best place to add latest skill sets to Have taken DS course at this institute. Irrespective of
your profile. There data structure and algorithm course implementation languages, one can join this. Cleared many
is class apart, they provide very detailed core concepts and tough concepts in an easy way. Just one suggestion to have a
ample of practice over various platforms such as hacker rank. doubt clearance class or discussion on questions raised by
Each course adequately records red over and provided. Ample students after each topic completion. Learnbay is a good
of study material is provided. place to learn and with life time subscription.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Harsh Jaiswal Manish jha

Working at Comviva Working at Walmart Global Tech India

Learnbay gives you a major platform to enhance your I took DS course under Learnbay. Irrespective of
skills and learn the concepts in depth. implementation languages, one can join this. His
The best thing about them is that the classes are flexible and excellent training methodology and different approaches for
they provide recorded videos of the lectures being taught that solving problems helps to learn quickly. After taking course, I
can help you to brush up the concepts whenever you wish to could see a significant improvement. Video recordings of the
Learnbay is highly recommended! classrooms help you to understand the problem solving.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Read more google reviews

Whatsapp www.learnbay.io
PLACEMENT AND SUCCESS STORIES

Sagarika Jena Manav Jain

Working at Fargo Working at Cisco
I attended ds algo course under Learnbay. He
Great experience in data structure training. The
discusses multiple approaches to solve any problem starting
trainer is having a neat and clear understanding in
from brute force to one with less complexity.
all concepts to make our doubts clear which gives the
Assignments are given to practice more problems.It is
confidence to challenge any interview with respect to DS.
recommended to have basic knowledge on all data structures
Happy to be part of Learnbay which really helps for the starters
and algorithms before joining as good level problems are
to learn quickly Highly recommended.
discussed.

Click here to view LinkedIn profile Click here to view LinkedIn profile

VISHRUT VATS Jatin Kumar Khilrani

Working at PricewaterhouseCoopers - Working at Qualcomm
Service Delivery Center (PwC SDC)
Good Experience, I did training in data structure and
The trainers for data structures and algorithms have a best algorithm. Trainers are well knowledgable and the questions
experience of the industry and the requirements. It is the best they taught is the same which touches the interview pattern.
place to concrete your concepts in this field and to face the Taught each concept clearly and solved as many programs as
world of interviews and real-time challenges, data structures, possible. But felt little difficulty as I opted for online training
and algorithms and it is effective Staff is very supportive and else everything is good. All class recordings are available to
would like to refer this institute. student.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Venkataraman Rajagopalan Rahul Anand

Working at KLA Working at techcarrot

This is a unique place to get trained by experts even Excellent training and awesome environment! I took
if you are already a software professional. Live online data structures and algorithm training in LearnBay . Taught
classroom sessions enable us to attend the sessions from each concepts clearly and solved as many programs as possible.
anywhere in the world but LIVE so we can talk to the trainer But felt little difficulty as I opted for online training else
during the middle of a session to clarify our questions. everything is good. All class recordings are available to students
for future reference which is a BIG plus. Great going.Good luck
Learnbay!
Click here to view LinkedIn profile Click here to view LinkedIn profile

Read more google reviews

Whatsapp www.learnbay.io
 PLACEMENT AND SUCCESS STORIES

Akanksha Achanti Arjun Giri

Working at Deloitte India (Offices of the US) Working at Amazon
Before joining the DSA course I wasn’t confident on I am taking the Data Structures and Algorithms
any of the topics. I can see the change in my coding abilities course by Learnbay. The course is very well structured with a
after the completion of the course! I even got referrals to strict focus on problem-solving from a technical interview point of
product-based companies. view while at the same time not compromising on the essential
Prateek is a good instructor, he’s patient and tries his best to theory behind each data structure and algorithm. The instructors
explain the topics till the concepts are clear. Would recommend are very experienced.
this course 10/10.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Bhagyasree Kanugula Ashutosh Chamoli

Working at Optum Working at KeepTruckin

Attended Data structures and Algorithms course. I am from non- I have done the DS & Algo course from Learnbay
CS background after attending the course I gained the He taught us from the basics time complexity, arrays, linked
confidence. Trainer started teaching from the basics which list, stack, queues to advance data structures – trees, graphs,
helped a lot. Best part we can repeat the course, Its beneficial for trie, etc. We also studied certain problem-solving techniques
both experienced candidates as well as beginners. Covered all and algorithms such two pointer approach, sliding window.
topics in syllabus .

Click here to view LinkedIn profile Click here to view LinkedIn profile

Kamlesh Sahu Jatin Kumar Khilrani

working at Paysafe Group Working at Qualcomm

DS ans Algos Course: Good Experience, I did training in data structure and algorithm.
This Course Helped me in getting 6 month SDE Trainers are well knowledgable and the questions they taught
INTERNSHIP at AMAZON,India. is the same which touches the interview pattern. Taught each
1.The advance DSA topics are taught, but he explains in such a concepts clearly and solved as many programs as possible . But
simplified manner that even a newbie can catch up very easily. felt little difficulty as I opted for online training else everything is
2. He gives time to think and then….. Read More good . All class recordings are available to students.

Click here to view LinkedIn profile Click here to view LinkedIn profile

Read more google reviews

Whatsapp www.learnbay.io
SYLLABUS
Mastering - Data structure and Algorithms using JAVA, C, C++, PYTHON
& C#

Session-0: Arrays (Basic, intermediate and hard problems:

already asked in Tier one company)

How array stores in the system,

Longest Substring Without Repeating Characters
Find Container With Most Water
3Sum
Find the Next Permutation
Multiply Strings
Rotate Image
Jump Game
Plus One
Minimum Window Substring
Read N Characters Given Read4 II - Call multiple times
Longest Substring with At Most Two Distinct Characters
Find And Replace in String
Maximize Distance to Closest Person
Valid Parentheses
Merge k Sorted Lists
Trapping Rain Water
Kth Largest Element in an Array
Backspace String Compare
Editor's choice: Frequently asked in a Google phone interview
Minimum Cost to Hire K Workers

30+ more problems in arrays asked in Google, Microsoft, and Amazon etc.
 Session-1: List: (Basic, intermediate and hard problems: already
asked in Tier one company)

What is a list, node and next reference & how list library is implemented in
JAVA.
Linked list implementation (adding, deleting and finding specific nodes )
Linked list using singly
Linked list using doubly
Linked list using Circular
Reverse Linked List
Linked List Cycle
Add Two Numbers
Add Two Numbers II
Merge Two Sorted Lists
Merge k Sorted Lists
Intersection of Two Linked Lists
Copy List with Random Pointer
Remove Nth Node From End of List
Palindrome Linked List

15+ more problems based on List asked in Google, Microsoft, and

Amazon, Facebook etc.
 Session-2: Stack (Basic, intermediate and hard problems:
already asked in Tier one company)

What is a Stack? Practical use of it.

Stack using array.
Stack using list.
Stack using Queue.
Prefix to Infix Conversion
Prefix to Postfix Conversion
Postfix to Prefix Conversion
Postfix to Infix
The Stock Span Problem
Check for balanced parentheses in an expression
Next Greater Element
Next Greater Frequency Element
Number of NGEs to the right
Maximum product of indexes of next greater on left and right
The Celebrity Problem
Expression Evaluation
Arithmetic Expression Evaluation.

20+ more problems based on Stack asked in Google, Microsoft,

and Amazon, Uber etc.
 Session-3: Queue (Basic, intermediate and hard problems:
already asked in Tier one company)

What is a Queue? Practical use of it & how list library is implemented in

JAVA.
Queue using Array
Queue using Stacks
Queue using list
Operations on queue
Circular Queue
Sum of minimum and maximum elements of all subarrays of size k.
Distance of nearest cell having 1 in a binary matrix

Level order traversal line by line | Set 2 (Using Two Queues)

First negative integer in every window of size k

Reversing a queue using recursion
Reversing the first K elements of a Queue
Interleave the first half of the queue with second half

25+ more problems based on Queue asked in Google, Microsoft,

and Amazon, Flipkart etc.
 Session-4: Trees (Basic, intermediate and hard problems:
already asked in Tier one company)

What is a Tree data structure? Practical use of Trees in data storing and
process scheduling.
Trees – BST
Trees – AVL
Trees – 2-4
Trees – Red Black
Tree traversal (recursion and iterative method )
Binary Tree Inorder Traversal
Binary Tree Level Order Traversal
Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Tree
Binary Tree Zigzag Level Order Traversal
Construct Binary Tree from Preorder and Inorder Traversal
Number of Islands
Diameter of Binary Tree
Accounts Merge
Convert Binary Search Tree to Sorted Doubly Linked List
Is Graph Bipartite?
Binary Tree Vertical Order Traversal
Symmetric Tree
Binary Tree Level Order Traversal
Convert Sorted Array to Binary Search Tree

25+ more problems based onTrees asked in Google ,Microsoft,

and Amazon, Flipkart, Linkedin etc.
 Session-5: Hashing (Basic, intermediate and hard problems:
already asked in Tier one company)

What is Hashing? Where to use it? What are some practical examples

for hashing?

Open Addressing – Basics

Open Addressing – Linear Probing

Open Addressing – Quadratic Probing

Find top k (or most frequent) numbers in a stream

Most frequent element in an array

Smallest subarray with all occurrences of a most frequent element

Find Itinerary from a given list of tickets

Find number of Employees Under every Employee

Count divisible pairs in an array

20+ more problems based on Hashing asked in Google, Microsoft,

and Amazon, Flipkart etc.
 Session-6: Graphs (Basic, intermediate and hard problems:
already asked in Tier one company)

What is a Graph, how to represent a graph? Practical use of graph.

Network Algorithms
Network Terminology
Spanning Trees
Shortest Paths
Breadth First Traversal for a Graph
Depth First Traversal for a Graph
Application of Depth First Search
Application of Breadth First Traversal
Detect Cycle in a Directed Graph
Detect Cycle in a an Undirected Graph
Detect cycle in an undirected graph
Longest Path in a Directed Acyclic Graph
Topological Sorting
Check whether a given graph is Bipartite or not
Applications of Minimum Spanning Tree Problem
Prim’s MST for Adjacency List Representation
Kruskal’s Minimum Spanning Tree Algorithm
Minimum cost to connect all cities
Dijkstra’s shortest path algorithm
Dijkstra’s Algorithm for Adjacency List Representation

20+ more problems based on Graphs asked in Google, Microsoft,

and Amazon, Flipkart etc.
PART II: ALGORITHMS

Session-0: Analysis of Algorithms (Basic, intermediate and

hard problems: already asked in Tier one company)

Network Algorithms
Asymptotic Analysis
Worst, Average and Best Cases
Asymptotic Notations
Lower and Upper Bound Theory
Analysis of Loops
Solving Recurrences
Amortized Analysis
What is Space Complexity?

Session-1: Searching & sorting (Basic, intermediate and

hard problems: already asked in Tier one company)

Binary Search, Selection Sort, Bubble Sort

Insertion Sort, Merge Sort, Heap Sort
Quick Sort, Radix Sort
Search in an almost sorted array
K’th Smallest/Largest Element in Unsorted Array
K’th Smallest/Largest Element in Unsorted Array in Expected Linear Time
 K’th Smallest/Largest Element in Unsorted Array in Worst Case Linear Time
Median of Two Sorted Arrays
Find First and Last Position of Element in Sorted Array
Merge Intervals
Search 2D Matrix
Insert Interval
Count of Smaller Numbers After Self
Peak Index in a Mountain Array
Find the closest pair from two sorted arrays
Find common elements in three sorted arrays
Given a sorted array and a number x, find the pair in array whose sum is
closest to x
Count 1’s in a sorted binary array

20+ more problems based on searching and sorting asked in

Google, Microsoft, and Amazon, Flipkart etc.

Session-2: Recursion (Basic, intermediate and hard

problems: already asked in Tier one company)

Letter Combinations of a Phone Number

Permutations
Permutations II
Remove Invalid Parentheses
Regular Expression Matching
Subsets
Strobogrammatic Number II

15+ more problems on recursion asked in Google, Microsoft, and

Amazon, Flipkart etc.
 Session-3: Greedy Algorithms (Basic, intermediate and hard
problems: already asked in Tier one company)

Given a sorted array and a number x, find the pair in array whose sum is

closest to x

Count 1’s in a sorted binary array

Kruskal’s Minimum Spanning Tree Algorithm

Huffman Coding

Prim’s Minimum Spanning Tree Algorithm

Prim’s MST for Adjacency List Representation

Dijkstra’s Shortest Path Algorithm

Dijkstra’s Algorithm for Adjacency List Representation

Job Sequencing Problem

Greedy Algorithm to find Minimum number of Coins

15+ more problems on greedy algorithms asked in Google,

Microsoft, and Amazon, Flipkart etc.
 Session-4: Dynamic Programming (Basic, intermediate and
hard problems already asked in Tier one company)

KMP Algorithm
Rabin-Karp Algorithm
Longest Increasing Subsequence
Longest Common Subsequence
Longest Palindromic Substring
Longest Palindromic Substring
Longest Valid Parentheses
Decode Ways
Best Time to Buy and Sell Stock
Word Break
Range Sum Query 2D - Immutable
Continuous Subarray Sum
Longest Valid Parentheses
Edit Distance
Min Cost Path
Coin Change
Matrix Chain Multiplication
Binomial Coefficient
0-1 Knapsack Problem
Longest Valid Parentheses

15+ more problems based on dynamic programming asked in

Google, Microsoft, and Amazon, Flipkart etc.
 Session-5: Pattern Searching (Basic, intermediate and hard
problems: already asked in Tier one company)

Naive Pattern Searching

KMP Algorithm
Rabin-Karp Algorithm
A Naive Pattern Searching Question
Finite Automata
Boyer Moore Algorithm – Bad Character Heuristic
Suffix Array
Anagram Substring Search (Or Search for all permutations)
Pattern Searching using a Trie of all Suffixes

15+ more problems on pattern searching asked in Google, Microsoft, and

Amazon, Flipkart etc.

Session-6: Backtracking (Basic, intermediate and hard

problems: already asked in Tier one company)

Print all permutations of a given string

The Knight’s tour problem
Rat in a Maze
N Queen Problem
Subset Sum
Hamiltonian Cycle
Sudoku
Tug of War

8+ more problems based on backtracking asked in Google,

Microsoft, and Amazon, Flipkart etc.
Session-7: Divide and Conquer (Basic, intermediate and
hard problems: already asked in Tier one company)

Introduction

Median of two sorted arrays

Count Inversions

Closest Pair of Points

Session-8: Geometric Algorithms (Basic, intermediate and

hard problems: already asked in Tier one company)

Closest Pair of Points

How to check if two given line segments intersect?

How to check if a given point lies inside or outside a polygon?

Given n line segments, find if any two segments intersect

Check whether a given point lies inside a triangle or not

How to check if given four points form a square

Session-9: Graph Algorithms (Basic, intermediate and hard
problems: already asked in Tier one company)

Graph Coloring (Introduction and Applications)

Greedy Algorithm for Graph Coloring
Travelling Salesman Problem
Hamiltonian Cycle
Vertex Cover Problem
Snake and Ladder Problem
karger’s algorithm for Minimum Cut
Check if a given graph is tree or not

Session-10: Bit Algorithms (Basic, intermediate and hard

problems: already asked in Tier one company)

karger’s algorithm for Minimum Cut

Check if a given graph is tree or not
Set bits in all numbers from 1 to n
Swap bits
Add two numbers
Smallest of three
Set bits in an (big) array
Next higher number with same number of set bits
Add 1 to a number
Turn off the rightmost set bit
Minimum or Maximum of two integers
Rotate bits
Find the two non-repeating elements in an array
Number Occurring Odd Number of Times
Check for Integer Overflow
Little and Big Endian
CONTACT US

Contact Number:
+919980527067

Email Address:
[email protected]

Address:
#Learnbay,19/1,2nd Floor,
Classic Aura(Beside Aricent),Marathahalli-
Outer Ring Road,Kadubeesanahalli
Bengaluru,Karnataka

Visit Us:
www.learnbay.io

Follow Us On :
(click on icon to)