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!
Algorithm Run Time Analysis (Big O Notation)
Data Structure - Array
Data Structure - Linked List
-
6What is an array & why we need an array
-
7Types of array
-
8How is an array represented in RAM
-
9Create a 1D Array
-
10Traverse 1D Array
-
11Get, Insert, Update & Delete Operations in 1D Array
-
12Searching Algorithms (Linear Search + Binary Search)
-
13Create a 2D Array
-
14Get, Insert & Update Operations in 2D Array
-
15Traverse 2D Array
-
161D Array Problem: Move Zeroes
-
171D Array Problem: Remove Duplicates from Sorted Array
-
182D Array Problem: Rotate Image
-
192D Array Problem: Spiral Matrix
Data Structure - Stack
-
20What is Linked List
-
21Different Types of Linked Lists
-
22Creation & Insertion Operations in SLL (Singly Linked List)
-
23Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List)
-
24Travering & Searching in SLL (Singly Linked List)
-
25Deleting Node & Deleting Entire Linked List (Singly Linked List)
-
26Source Code for Singly Linked List (SLL)
-
27Creation & Insertion Operations in CSLL (Circular Singly Linked List)
-
28Traversing & Searching in CSLL (Circular Singly Linked List)
-
29Insertion in CSLL (Circular Singly Linked List)
-
30Deleting Node & Deleting Entire Linked List (Circular Singly Linked List)
-
31Source Code for Circular Singly Linked List (CSLL)
-
32Creation & Insertion Operations in DLL (Doubly Linked List)
-
33Traversing & Searching in DLL (Doubly Linked List)
-
34Insertion in DLL (Doubly LInked List)
-
35Deleting Node & Deleting Enire Linked List (Doubly Linked List)
-
36Source Code for Doubly Linked List (DLL)
-
37Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst)
-
38Traversing & Searching in CDLL (Circular Doubly Linked List)
-
39Insertion in CDLL (Circular Doubly Linked List)
-
40Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List)
-
41Source Code for Circular Doubly Linked List (CDLL)
-
42Linked List Problem: Reverse a Singly Linked List -- Recursive Solution
-
43Linked List Problem: Reverse a Singly Linked List -- Iterative Solution
Data Structure - Queue
-
44What is Stack
-
45Stack Implementation Options
-
46Array - Create, Push & Pop
-
47Array - Peek, isEmpty, isFull & deleteStack
-
48Source Code -- Stack Using Array
-
49Linked List - Create, Push & Pop
-
50Linked List - Peek, isEmpty, & deleteStack
-
51Source Code -- Stack Using Linked List
-
52Stack Problem: Valid Parentheses
-
53Stack Problem: Decode String
Data Structure - Binary Tree
Data Structure - Binary Search Tree (BST)
-
62What is Tree & Why should we learn tree
-
63Tree Terminologies :: Root, Leaf, Edge, Ancestor, ... Depth of Tree ::
-
64Tree Terminologies :: Predecessor & Successor ::
-
65What is Binary Tree
-
66Types of Binary Tree
-
67How is Tree Represented :: Linked List & Array Representation ::
-
68Create Binary Tree & Insert Value :: Linked List Implementation ::
-
69Search for a Value in Binary Tree
-
70Delete Value from Binary Tree
-
71Delete Binary Tree
-
72Tree Traversal Techniques :: Inorder, Preorder & Postorder Traversal ::
-
73Preorder Traversal Details :: Recursive + Iterative ::
-
74Inorder Traversal Details :: Recursive + Iterative ::
-
75Postorder Traversal Details :: Recursive + Iterative ::
-
76Level Order Traversal Details :: Recursive + Iterative ::
-
77Source Code :: Implementation of Binary Tree Using Linked List ::
-
78Create Binary Tree & Insert Value :: Array Implementation ::
-
79Search for a Value in Binary Tree
-
80Delete Node from Binary Tree
-
81Delete Binary Tree
-
82Preorder Traversal
-
83Inorder Traversal
-
84Postorder Traversal
-
85Level order Traversal
-
86Source Code :: Implementation of Binary Tree Using Array ::