Self Paced Course
Live Training
Offerings
- Live Batch
- Self Paced
Event
Contact us

Job Guarantee
Hire From Us
Corporate Training
Become Our Instructors

COURSES
OFFERINGS
EVENT
CONTACT US

Self Paced Course
Live Training
Offerings
- Live Batch
- Self Paced
Event
Contact us

Live Batch
Self Paced

Self Paced Course
Live Training
Offerings
- Live Batch
- Self Paced
Event
Contact us

Self Paced Course
Live Training

Course Content

1. Time Complexity

DSA Offering Lifetime Access with Updates. Weekly Doubt Clearing Classes 100+ Leetcode video solutions with explanations Offered by ACM ICPC winners and FANG engineers Student community, Github code review, Interview preparations.

0/16

1 – Time Complexity

2 – Big O Notation

3 – Binary Search and its Recurrence Relation

4 – Question on Time Complexity I

5 – Master’s Theorem

6 – Big O Complexity Comparison

7 – Question on Time Complexity II

8 – Occurrence of an integer

10 – Find Minimum path

11 – Find Minimum path – Optimization

12 – Time Complexity Notations

13 – Examples and Questions

14 – Key Takeaways

Time Complexity.pdf

2. Array

0/9

1 – Find the missing and the repeated number in the array

2 – Find the missing and the repeated number in the array

2 – 2 Sum problem

3 – 2 Sum problem

4 – 3 Sum problem

5 – Majority Element in the Array

3. Linked list

0/15

1 – Why do we use Linked List

2 – What are Linked Lists

3 – How to create a Linked List

4 – Deleting a node in a Linked List

5 – Finding Mid-point of a Linked List

6 – Detecting Cycle in a Linked List

7 – Removing Cycle in a Linked List

8 – Reversing a Linked List

9 – Big Integer Problem

10 – Add two big numbers

11 – Introduction to Doubly Linked List

12 – Insertion and deletion in Doubly Linked List

13 – Comparison between Singly Linked List and Doubly Linked List

Linked List.pdf

4. Stack

0/7

1 Introduction to Stacks

2 Question on Stacks using STL C++

3 Postfix Expression Evaluation

4 Infix to Postfix Evaluation

5 Next Greater Element

5. Queue

0/4

1 Introduction to queues

2- Sliding Window Question

6 Dictionary and Sets STL

0/3

1- Introduction to Dictionary Set

2- Basics of Dictionary & Sets.pdf

7. Sorting

0/14

1 – Merge Sort

2 – Quick Sort

3 – Comparison between Merge Sort, Quick Sort and STL

4 – Count Sort

5 – Bucket Sort

6 – Radix Sort

7 – Comparison between Count Sort and Bucket Sort

8 – Problem Count Inversions 1

9 – Discussion Sort a linked list

10 – Problem Count Inversions 1 Code Discussion

11 – Problem Sort a linked list

12 – Problem Nut and Bolt Problem

8. Binary Trees

0/13

1 – Introduction to Trees

2 – Traversal in Binary Trees (Inorder, Preorder, Postorder)

3 – Level Order Traversal of Binary Trees

4 – Spiral Order Traversal of Binary Trees

5 – Views of a Binary Tree (Left, Right)

6 – Top Bottom View of a Binary Search Tree

7 – Problem Binary Tree Right Side View

8 – Problem Validate Binary Search Tree

9 – Problem Diameter of a Binary Tree

10 – Post Session Discussion

11 – Diameter of a Binary Tree

Binary Trees.pdf

9. Binary Search Tree

0/8

1 – Introduction to Binary Search Trees (BST)

2 – ChecK if a Binary Tree is a BST or not

3 – Properties of Binary Search Trees

4 – Searching in Binary Search Trees

5 – Balanced Binary Search Trees

6 – Dictionaries bases on Hashing

7 – Comparison between Hash Map and Tree Maps

8 – Insertion Deletion in Binary Search Trees

10. Heap

0/9

1 – Introduction

2 – Binary Heap

4 – Min and Max Heap

5 – Operations in heaps

6 – Heap Sort

7 – Kth smallest largest element from array

Binary Heaps.pdf

11. Graph

0/12

1 – Introduction to Graphs

2 – Representation of Graphs

3 – Types of Graphs

4 – Depth First Search Traversal of Graphs

5 – Breadth First Search Traversal of Graphs

6 – Comparison between DFS and BFS

7 – Directed Graph – Cyclic and Acyclic

8 – Cycles and their Detection

9 – Topological Sorting

10 – Shortest Paths – Single Source

12. Dynamic Programming

0/11

1 – Sum of array elements

2 – Rod Cutting Problem

3 – Coin Change Problem

4 – Subset Sum Problem

5 – Knapsack Problem

6 – Coin Game

7 – Edit Distance

8 – Bursting Balloons

10 – Longest Common Subsequence

Dynamic Programming.pdf

13. Tries

0/3

1 – What are Tries

2 – Application of Tries

14. Bit Wise operation

0/4

1 – Bitwise Operations

2 – Questions on Bitwise Operation

Bitwise Operation.pdf

15. Disjoint set

0/3

1 – Introduction

2 – Disjoint Set Operations

3 – Union Find, Make, Link, Discussion

Add-ons

0/6

Leetcode Google Interview questions – Stack

Zoom Real time video chatting – Websocket, WebRTC

Understanding Binary Search – Latest Google Coding Interview Question

Leetcode Google Interview questions – Sorting

Leetcode Google Interview questions – Queue

Leetcode Google Interview questions – Hashing

Data Structure & Algorithm Using c++

Overview
Exercise Files

About Lesson

Exercise Files

No Attachment Found

No Attachment Found

0% Complete

Follow us!

Pages

Data Structure & Algorithm

System Design

Event

Join us

Hire From Expertifie

Become an Instructor

City Sitemap

Download Our App

Get the android app

Our Office are located at

Bengaluru

VR Bengaluru, Level 5, ITPL Main Rd, Devasandra Industrial Estate, Bengaluru, Karnataka 560048

Bengaluru

ITPB, INTERNATIONAL TECH PARK, Bridge+, Unit 02 – 01 to 15 2nd Floor, Park Square Mall, Whitefield Main Rd, Bengaluru, Karnataka 560066

Hyderabad

Kondapur Main Road, Laxmi Cyber City, Whitefields, Kondapur, Hyderabad, Telangana 500081

Noida

B-6, Amaltash Marg, Block B, Sector 4, Noida, Uttar Pradesh 201301

Refund Policy

Terms and Conditions

Contact Us

privacy-policy

Insert/edit link

Enter the destination URL

URL

Link Text

Open link in a new tab

Or link to existing content

Search

No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.