Build your strong understanding in data structures and algorithms for coding interview. Get more job offer.
☑ Fundamentals of Data Structures and Algorithms
☑ Become Confident in Data Structures and Algorithms
☑ Learn, Implement and Use Different Data Structure
☑ Learn Popular Data Structures and Their Algorithms
☑ Master Algorithms including 7 Sorting Algorithms
☑ Become Confident in Algorithms Coding Interview
Welcome to “Data Structures and Algorithms for Coding Interview” course.
Want to land a job at a great tech industry like Google, Microsoft, Facebook, Netflix, Amazon, or other industries but you are intimidated by the foundation of data structures and algorithms skills for the job?
Many programmers who are “self taught”, feel that one of the main disadvantages they face compared to college educated graduates in computer science is the fact that they don’t have knowledge about algorithms, data structures and the notorious Big-O Notation. Get on the same level as someone with computer science degree by learning the fundamental building blocks of computer science which will give you a big boost during interviews.
Here is what you will learn in this course:
>> Algorithm Run Time Analysis – Big O – O(n) Notation
>> Array (1D, 2D Array)
>> Linked List (All Types of Linked List)
>> Stack Data Structure
>> Queue Data Structure
>> Binary Tree (Array, Linked List Implementation, BFS/DFS Traversal and more)
>> Binary Search Tree
>> Binary Heap
>> AVL Tree
>> Trie Data Structure
>> Searching Algorithms
>> Recursion
>> Sorting Algorithms
>> Dynamic Programming
>> Hashing*
>> Graph*
Unlike most instructors, I am not a marketer or a salesperson. I am a self taught programmer(I studied statistics not computer science) who has worked and managed teams of engineers and have been in these interviews both as an interviewee as well as the interviewer.
Taking his experience in educational statistics and coding, Barik’s courses will take you on an understanding of complex subjects that you never thought.
We have 30 days money back guarantee, so nothing to lose here.
See you inside the courses!
English
Language
Introduction
Introduction
Algorithm Run Time Analysis (Big O Notation)
What is Algorithm Runtime Analysis
Why should we learn algorithm run time analysis?
Time Complexity Analysis Example #1
Time Complexity Analysis Example #2
Data Structure – Array
What is an array & why we need an array
Types of array
How is an array represented in RAM
Create a 1D Array
Traverse 1D Array
Get, Insert, Update & Delete Operations in 1D Array
Searching Algorithms (Linear Search + Binary Search)
Create a 2D Array
Get, Insert & Update Operations in 2D Array
Traverse 2D Array
1D Array Problem: Move Zeroes
1D Array Problem: Remove Duplicates from Sorted Array
2D Array Problem: Rotate Image
2D Array Problem: Spiral Matrix
Data Structure – Linked List
What is Linked List
Different Types of Linked Lists
Creation & Insertion Operations in SLL (Singly Linked List)
Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List)
Travering & Searching in SLL (Singly Linked List)
Deleting Node & Deleting Entire Linked List (Singly Linked List)
Source Code for Singly Linked List (SLL)
Creation & Insertion Operations in CSLL (Circular Singly Linked List)
Traversing & Searching in CSLL (Circular Singly Linked List)
Insertion in CSLL (Circular Singly Linked List)
Deleting Node & Deleting Entire Linked List (Circular Singly Linked List)
Source Code for Circular Singly Linked List (CSLL)
Creation & Insertion Operations in DLL (Doubly Linked List)
Traversing & Searching in DLL (Doubly Linked List)
Insertion in DLL (Doubly LInked List)
Deleting Node & Deleting Enire Linked List (Doubly Linked List)
Source Code for Doubly Linked List (DLL)
Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst)
Traversing & Searching in CDLL (Circular Doubly Linked List)
Insertion in CDLL (Circular Doubly Linked List)
Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List)
Source Code for Circular Doubly Linked List (CDLL)
Linked List Problem: Reverse a Singly Linked List — Recursive Solution
Linked List Problem: Reverse a Singly Linked List — Iterative Solution
Data Structure – Stack
What is Stack
Stack Implementation Options
Array – Create, Push & Pop
Array – Peek, isEmpty, isFull & deleteStack
Source Code — Stack Using Array
Linked List – Create, Push & Pop
Linked List – Peek, isEmpty, & deleteStack
Source Code — Stack Using Linked List
Stack Problem: Valid Parentheses
Stack Problem: Decode String
Data Structure – Queue
What is Queue
Queue Implementation Options
Array – Linear Queue
Source Code – Linear Queue Implementation using Array
Array – Circular Queue
‘;
}});
Source Code – Circular Queue
Linked List – Linear Queue
Source Code – Linear Queue Implementation using LInked List
