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. Array

0/14

1.1. DSA Introduction

1.2 Abstract Data Type

1.3 Binary Search Over Linear

1.4 Handling the Overflow

1.5 Binary Search First and Last Occurence

1.6 Binary Search Find element in rotated sorted array

1.7 Binary Search Rotation count in anti-clockwise rotated sorted array

1.8 Binary Search Search in an almost sorted array

1.9 LeetCode Map Sum pairs Approach I

1.10 LeetCode Map Sum pairs Approach II

1.11 LeetCode Map Sum pairs Approach III

1.12 Complexity Analysis

2. LinkList

0/13

2.1 Array vs List

2.2 LinkList Problem Printing

2.3 LinkList Problem – Reversal

2.4 Understanding Recursion List Printing (Recusive vs Iterative)

2.5 Linklist Question Discussion Reversing from L to R

2.6 Linklist Question Coding Reversing from L to R

2.7 LeetCode Problem Linked List Cycle II and Linked List Cycle I

2.8 LeetCode Problem Odd Even Linked list

2.9 LeetCode Problem Sort linked list which is already sorted on absolute values

2.10 LeetCode Problem Swapping nodes in Linked list

2.11 What is done until now and upcoming lecture’s discussion

3. Stacks

0/20

3.1 Stack pop(), top(), isempty() and Application

3.2 Stack Implementation using array

3.3 Stack Implementation using linked list

3.4 Stack Linked list Reversal

3.5 Stack Balanced Parenthesis

3.6 Stack Recap

3.7 Notation, Operators, Operands, Order of Operation

3.8 Infix to Postfix, Prefix (Manual)

3.9 Infix to Postfix Conversion (Algorithm)

3.10 Infix to Postfix Conversion (Code)

3.11 Postfix, Prefix Evaluation (Algorithm)

3.12 Postfix, Prefix Evaluation (Code)

3.13 Evaluating Infix (Discussion)

3.14 LeetCode Next Greater Element 1 (discussion)

3.15 LeetCode Next Greater Element 1 (algorithimic and coding part)

3.16 LeetCode Next Greater Element 2 (discussion Coding)

3.17 LeetCode Next Greater Element 3 (discussion Algorithm)

3.18 LeetCode Next Greater Element 3 (Coding)

4. Queue

0/5

4.1 Queue Introduction

4.2 Queue Operation Implementation using arrays

4.3 Queue Operation Implementation using linked list

5. Sorting

0/15

5.1 Sorting Algorithm

5.2 Counting Sort I

5.3 Counting Sort II

5.5 Insertion Sort

5.6 Merge Sort I

5.7 Merge Sort II

5.8 Quick Sort I

5.9 Quick Sort II

5.10 Insert Interval and Merge Interval Leetcode Questions

5.11 Rotate Image Leetcode Question

5.12 Backspace Compare Leetcode Question

5.13 mySqrt Leetcode Question

6. Binary Tree

0/15

6.1 Tree Introduction

6.2 Tree Introduction & Applications

6.3 BinaryTree Complete Overview

6.4 BinaryTree TreeTraversal

6.5 BinaryTree Coding Preorder Traversal Recursive Approach

6.6 BinaryTree Coding Inorder Traversal Recursive Approach

6.7 BinaryTree Coding Postorder Traversal Recursive Approach

6.8 BinaryTree Coding Preorder Traversal Iterative Approach

6.9 LeetCode 132 Pattern

6.10 BinaryTree Level Order Traversal Discussion

6.11 BinaryTree Coding Level Order Traversal or BFS

6.12 BinaryTree Array Implementation

6.13 BinaryTree Discussion on Travesal using O(1) Space

Binary tree.pdf

Binary Tree Quiz

7. Binary Search Tree

0/8

7.1 Binary Seach Tree

7.2 AVL,Red Black Trees

7.3 Binary Search Tree Deletion

7.4 Validate BST Question

7.5 In Order Successor Implementation

7.6 Height Balanced BST

7.7 Implementation of left leaning RBT

8. Trie

0/12

8.2 Trie Representation

8.3 Trie Implementation-Insertion

8.4 Trie Implementation-Search

8.5 Binary Search Tree Deletion

8.6 Validate BST Question

8.7 In Order Successor Implementation

8.8 Height Balanced BST

8.9 Implementation of left leaning RBT

8.10 LeetCode Replace Words

8.11 LeetCode design add and search words data structure

9. Graph

0/19

9.1 Graph Introduction

9.2 Graph Types

9.3 Graph Terminologies

9.4 Graph DFS Introduction

9.5 Graph DFS All paths between two nodes

9.6 Graph BFS Introduction

9.7 Graph Comparing DFS vs BFS on shortest path between two vertices

9.9 Graph Representations

9.10 Find if this path exist in a graph

9.11 All paths from source to target

9.12 All paths form source lead to destination

9.13 Number of the island Using DFS

9.14 Number of the island Using BFS With Implementation

9.15 Number of the island Using DFS Implementation

9.16 Rotting Oranges

9.17 Valid Sudoku

10. Dynamic Programming

0/7

10.1 Dynamic Programing,Top down approach,Bottom up approach

10.2 When to use DP I

10.3 When to use DP II

10.4 Min Cost Climbing Stairs

10.5 Climbing Stairs

Dynamic Programming.pdf

Dynamic Programming Quiz

11. Heaps

0/7

11.1 PriorityQueue Introduction

11.2 Heap Introduction

11.3 PriorityQueue Using in JAVA and Heapification

11.4 PriorityQueue Building Heap from Array

11.5 PriorityQueue Upcoming lectures

12. Problem Solving

0/28

1 Microsoft questions set 1 – 1

2 Microsoft questions set 1 – 2

3 Microsoft questions set 1 – 3

4 Microsoft questions set 1 – 4

5 Microsoft questions set 2 – 1

6 Microsoft questions set 2 – 2

7 Microsoft questions set 2 – 3

8 Microsoft questions set 3 – 1

9 Microsoft questions set 3 – 2

10 Microsoft questions set 3 – 3

11 Microsoft questions set 3 – 4

12 Microsoft questions set 4 – 1

13 Microsoft questions set 4 – 2

14 Microsoft questions set 4 – 3

15 Microsoft questions set 4 – 4

16 Microsoft questions set 5 – 1

17 Microsoft questions set 5 – 2

18 Microsoft questions set 6 – 1

19 Microsoft questions set 6 – 2

20 Microsoft questions set 6 – 3

21 Microsoft questions set 6 – 4

22 Microsoft questions set 7 – 1

23 Microsoft questions set 7 – 2

24 Microsoft questions set 7 – 3

25 Microsoft questions set 7 – 4

26 Microsoft questions set 8 – 1

27 Microsoft questions set 8 – 2

28 Microsoft questions set 8 – 3

Data Structure & Algorithm Using Java

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.