Data Structures and Algorithms Course

Data Structures and Algorithms Course Overview

The Data Structures and Algorithms Course is tailored for individuals in the software engineering field who aspire to elevate their careers by securing interviews with some of the world's most prestigious companies. This program is meticulously designed to equip you for these crucial interviews, covering a comprehensive range of skills, from problem-solving techniques to coding proficiency. You'll gain invaluable hands-on experience by tackling over 100 data structures and algorithm problems. The course commences with problem-solving exercises related to each data structure and algorithm, preparing you thoroughly for interviews with top-tier product-based companies such as Meta, Microsoft, Amazon, Adobe, Netflix, and Google.

DSA Course objectives

Participants in this training will learn data structures and algorithms course and at the completion of this course, attendees will be able to:

Identify techniques to design algorithms and measure their efficiency.
Sort data by using bubble sort, selection sort, insertion sort, shell sort, quick sort, and merge sort.
Search data by using linear search and binary search techniques.
Store and search data using hashing.
Solve problems using arrays, lists, linked lists, queues, and stacks.
Solve problems using non-leaner data structures like trees, and graphs.

Tools and Technologies Covered

Arrays

Big-O

Complexity Analysis

Linked List

Stack

Queue

Tree

Graph

VS Code IDE

Included in this Data Structures and Algorithms Course

Video Course 122 Videos
Quick Notes 35 Notes
Labs 81 labs
Skill Tests 9 Tests

DSA and Big O

Data Structure Introduction Preview 04m 32s

Non-Linear Data Structure 09m 25s

Asymptotic analysis 14m 31s

Asymptotic Explanation 20m 23s

Array

Array Introduction 09m 58s

Array Traversal 10m 46s

Array insert data 06m 21s

Array Bound Checking 16m 52s

Array Insertion 12m 35s

Deletion in Array 07m 38s

2D array 13m 47s

Array List Integer 20m 47s

Array Questions

Array List String 18m 17s

Storing Heterogeneous Element in array 13m 20s

Array Question1 41m 40s

Array Question2 18m 48s

Sum Leet code 19m 24s

buy and sell Stock leetcode 10m 34s

Product of Array Except Self 16m 56s

Container With Most Water 19m 45s

Spiral Matrix 30m 10s

Sudoku valid 29m 36s

String

String Preview 01m 00s

String literals 09m 15s

Immutable String 05m 33s

String Methods 21m 33s

StringBuilder vs String Buffer 04m 42s

String Builder and Buffer example 11m 29s

Valid Palindrome 08m 05s

Valid Anagram 15m 23s

Longest Substring Without Repeating Characters 17m 22s

Find All Anagrams in a String 31m 07s

Largest Number 19m 26s

Largest Number 1 09m 06s

Linear Search

Linear search1 Preview 01m 42s

Linear Search Implementation 08m 04s

Linear Search Questions 25m 56s

Binary Search

Binary Search 01m 34s

Binary Search implementation 12m 19s

First and Last Occurence 23m 33s

Arrays Searching

Search in Rotated Sorted array 19m 31s

Search in rotated Sorted Array 10m 39s

Find Minimum in Rotated Sorted Array 04m 59s

Bubble, Selection and Insertion Sort

Bubble Sort 01m 28s

Bubble Sort Implementation 07m 33s

Selection Sort 02m 05s

Selection Sort Implementation 07m 15s

Insertion Sort 01m 06s

Insertion Sort implementation 10m 18s

Merge, Quick and Counting Sort

Merge Sort 09m 58s

Merge Sort Implementation 20m 22s

Quick Sort 08m 51s

Quick Sort Implementation 08m 51s

Counting Sort 02m 46s

Counting Sort Implementation 17m 57s

Bucket, Find Kth Element and Find Pages

Bucket Sot 01m 03s

Bucket Sort Implementation 15m 47s

FindKthElement 19m 26s

Kth largest element 22m 27s

Find Pages 09m 33s

Find Pages PART 2 20m 01s

Theif problem 13m 19s

Minimum swaps 15m 06s

Hashing

Hashing Introduction Preview 02m 35s

Hasing Function 17m 35s

Hash map or Hash table 18m 34s

Phonebook

Phonebook 1 19m 01s

Phonebook 2 02m 26s

Phonebook by HashMap 13m 43s

HashMap different methods 21m 13s

Symmetric pair Example 14m 27s

First Unique Character 13m 51s

Hash Set

HashSet Example 12m 31s

Contiguous Integers in array 16m 38s

Pair with given Sum 07m 40s

Itinary fromticket 30m 59s

Match Locks and Keys 12m 34s

Stack

Stack 03m 38s

Stack Implementation by library 14m 58s

Stack Implementation using Array 23m 16s

Stack Implementation using LinkedList 22m 09s

Valid Parentheses 16m 36s

Simplify Path 1 12m 27s

Simplify path 2 09m 27s

Evaluate Reverse Polish Notation 25m 12s

Trapping Rainwater 24m 04s

Longest valid Parentheses 24m 13s

Basic Calculator 26m 05s

Queue

Introduction to Queue Preview 04m 49s

Queue Implementation 13m 16s

Queue Implementation user defined function 28m 12s

Implement Stack using Queues 25m 32s

Implement Queue using Stack 21m 23s

First Unique Character in a String 26m 01s

Reveal Cards in Increasing Order 19m 32s

Find the Winner of the Circular Game 17m 23s

Linked List

Linked List 05m 25s

Singly LinkedList 12m 51s

LinkedList Library 19m 01s

Singly LinkedList Implementation 01h 10m 14s

Doubly LinkedList 05m 30s

Doubly linkedList Implementation 54m 15s

Circular LinkedList

Circular LinkedList 02m 27s

Circular LinkedList 1 02m 58s

Circular LinkedList implementation 51m 31s

Linked List Cycle 10m 34s

Linked List Cycle II 21m 03s

Reverse Linked List

Happy Numbers 15m 50s

Middle of the Linked List 07m 10s

Reverse Linked List 13m 33s

Reverse Linked List II 28m 35s

Reverse Nodes in k-Group 23m 33s

Tree and Binary Tree

Introduction to Tree 23m 00s

Binary Tree Traversal Whiteboard 55m 45s

Traversal DFS 38m 15s

Tree Traversal BFS 16m 01s

Max Min Search SumofLeafNodes 26m 02s

White Board Explanation of Max,Min ,SumOfLeafNodes 12m 14s

Mirror a Tree (Code) 19m 36s

Spiral level Order traversal 1 30m 50s

Spiral level Order traversal 2 01m 33s

Quick Notes Notes (35)

Data Structures & Algorithms