Data Structures and Algorithms Course

Self Paced Course

77 Videos

Video Course

20 Notes

Quick Notes

34 Labs

Hands-on Labs

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.

Included in this Data Structures and Algorithms Course

Video Course 77 Videos
Quick Notes 20 Notes
Labs 34 labs

DSA and Big O

Data Structure Introduction Preview 0h 04m 32s

Non-Linear Data Structure 0h 09m 25s

Asymptotic analysis 0h 14m 31s

Asymptotic Explanation 0h 20m 23s

Array

Array Introduction 0h 09m 58s

Array Traversal 0h 10m 46s

Array insert data 0h 06m 21s

Array Bound Checking 0h 16m 52s

Array Insertion 0h 12m 35s

Deletion in Array 0h 07m 38s

2D array 0h 13m 47s

Array List Integer 0h 20m 47s

Array Questions

Array List String 0h 18m 17s

Storing Heterogeneous Element in array 0h 13m 20s

Array Question1 0h 41m 40s

Array Question2 0h 18m 48s

Sum Leet code 0h 19m 24s

buy and sell Stock leetcode 0h 10m 34s

Product of Array Except Self 0h 16m 56s

Container With Most Water 0h 19m 45s

Spiral Matrix 0h 30m 10s

Sudoku valid 0h 29m 36s

String

String Preview 0h 01m 00s

String literals 0h 09m 15s

Immutable String 0h 05m 33s

String Methods 0h 21m 33s

StringBuilder vs String Buffer 0h 04m 42s

String Builder and Buffer example 0h 11m 29s

Valid Palindrome 0h 08m 05s

Valid Anagram 0h 15m 23s

Longest Substring Without Repeating Characters 0h 17m 22s

Find All Anagrams in a String 0h 31m 07s

Largest Number 0h 19m 26s

Largest Number 1 0h 09m 06s

Hashing

Hashing Introduction Preview 0h 02m 35s

Hasing Function 0h 17m 35s

Hash map or Hash table 0h 18m 34s

Phonebook

Phonebook 1 0h 19m 01s

Phonebook 2 0h 02m 26s

Phonebook by HashMap 0h 13m 43s

HashMap different methods 0h 21m 13s

Symmetric pair Example 0h 14m 27s

First Unique Character 0h 13m 51s

Hash Set

HashSet Example 0h 12m 31s

Contiguous Integers in array 0h 16m 38s

Pair with given Sum 0h 07m 40s

Itinary fromticket 0h 30m 59s

Match Locks and Keys 0h 12m 34s

Linear Search

Linear search Preview 0h 01m 42s

Linear Search Implementation 0h 08m 04s

Linear Search Questions 0h 25m 56s

Binary Search

Binary Search 0h 01m 34s

Binary Search implementation 0h 12m 19s

First and Last Occurence 0h 23m 33s

Arrays Searching

Search in Rotated Sorted array 0h 19m 31s

Search in rotated Sorted Array 0h 10m 39s

Find Minimum in Rotated Sorted Array 0h 04m 59s

Bubble, Selection and Insertion Sort

Bubble Sort 0h 01m 28s

Bubble Sort Implementation 0h 07m 33s

Selection Sort 0h 02m 05s

Selection Sort Implementation 0h 07m 15s

Insertion Sort 0h 01m 06s

Insertion Sort implementation 0h 10m 18s

Merge, Quick and Counting Sort

Merge Sort 0h 09m 58s

Merge Sort Implementation 0h 20m 22s

Quick Sort 0h 08m 51s

Quick Sort Implementation 0h 08m 51s

Counting Sort 0h 02m 46s

Counting Sort Implementation 0h 17m 57s

Bucket, Find Kth Element and Find Pages

Bucket Sot 0h 01m 03s

Bucket Sort Implementation 0h 15m 47s

FindKthElement 0h 19m 26s

Kth largest element 0h 22m 27s

Find Pages 0h 09m 33s

Find Pages PART 2 0h 20m 01s

Theif problem 0h 13m 19s

Minimum swaps 0h 15m 06s

Quick Notes Notes (20)

Data Structures & Algorithms