The Complete Data Structures and Algorithms Course in Java
- Description
- Curriculum
- FAQ
- Reviews
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!
-
6What is an array & why we need an arrayVideo lesson
-
7Types of arrayVideo lesson
-
8How is an array represented in RAMVideo lesson
-
9Create a 1D ArrayVideo lesson
-
10Traverse 1D ArrayVideo lesson
-
11Get, Insert, Update & Delete Operations in 1D ArrayVideo lesson
-
12Searching Algorithms (Linear Search + Binary Search)Video lesson
-
13Create a 2D ArrayVideo lesson
-
14Get, Insert & Update Operations in 2D ArrayVideo lesson
-
15Traverse 2D ArrayVideo lesson
-
161D Array Problem: Move ZeroesVideo lesson
-
171D Array Problem: Remove Duplicates from Sorted ArrayVideo lesson
-
182D Array Problem: Rotate ImageVideo lesson
-
192D Array Problem: Spiral MatrixVideo lesson
-
20What is Linked ListVideo lesson
-
21Different Types of Linked ListsVideo lesson
-
22Creation & Insertion Operations in SLL (Singly Linked List)Video lesson
-
23Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List)Video lesson
-
24Travering & Searching in SLL (Singly Linked List)Video lesson
-
25Deleting Node & Deleting Entire Linked List (Singly Linked List)Video lesson
-
26Source Code for Singly Linked List (SLL)Text lesson
-
27Creation & Insertion Operations in CSLL (Circular Singly Linked List)Video lesson
-
28Traversing & Searching in CSLL (Circular Singly Linked List)Video lesson
-
29Insertion in CSLL (Circular Singly Linked List)Video lesson
-
30Deleting Node & Deleting Entire Linked List (Circular Singly Linked List)Video lesson
-
31Source Code for Circular Singly Linked List (CSLL)Text lesson
-
32Creation & Insertion Operations in DLL (Doubly Linked List)Video lesson
-
33Traversing & Searching in DLL (Doubly Linked List)Video lesson
-
34Insertion in DLL (Doubly LInked List)Video lesson
-
35Deleting Node & Deleting Enire Linked List (Doubly Linked List)Video lesson
-
36Source Code for Doubly Linked List (DLL)Text lesson
-
37Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst)Video lesson
-
38Traversing & Searching in CDLL (Circular Doubly Linked List)Video lesson
-
39Insertion in CDLL (Circular Doubly Linked List)Video lesson
-
40Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List)Video lesson
-
41Source Code for Circular Doubly Linked List (CDLL)Text lesson
-
42Linked List Problem: Reverse a Singly Linked List -- Recursive SolutionVideo lesson
-
43Linked List Problem: Reverse a Singly Linked List -- Iterative SolutionVideo lesson
-
44What is StackVideo lesson
-
45Stack Implementation OptionsVideo lesson
-
46Array - Create, Push & PopVideo lesson
-
47Array - Peek, isEmpty, isFull & deleteStackVideo lesson
-
48Source Code -- Stack Using ArrayText lesson
-
49Linked List - Create, Push & PopVideo lesson
-
50Linked List - Peek, isEmpty, & deleteStackVideo lesson
-
51Source Code -- Stack Using Linked ListText lesson
-
52Stack Problem: Valid ParenthesesVideo lesson
-
53Stack Problem: Decode StringVideo lesson
-
54What is QueueVideo lesson
-
55Queue Implementation OptionsVideo lesson
-
56Array - Linear QueueVideo lesson
-
57Source Code - Linear Queue Implementation using ArrayText lesson
-
58Array - Circular QueueVideo lesson
-
59Source Code - Circular QueueText lesson
-
60Linked List - Linear QueueVideo lesson
-
61Source Code - Linear Queue Implementation using LInked ListText lesson
-
62What is Tree & Why should we learn treeVideo lesson
-
63Tree Terminologies :: Root, Leaf, Edge, Ancestor, ... Depth of Tree ::Video lesson
-
64Tree Terminologies :: Predecessor & Successor ::Video lesson
-
65What is Binary TreeVideo lesson
-
66Types of Binary TreeVideo lesson
-
67How is Tree Represented :: Linked List & Array Representation ::Video lesson
-
68Create Binary Tree & Insert Value :: Linked List Implementation ::Video lesson
-
69Search for a Value in Binary TreeVideo lesson
-
70Delete Value from Binary TreeVideo lesson
-
71Delete Binary TreeVideo lesson
-
72Tree Traversal Techniques :: Inorder, Preorder & Postorder Traversal ::Video lesson
-
73Preorder Traversal Details :: Recursive + Iterative ::Video lesson
-
74Inorder Traversal Details :: Recursive + Iterative ::Video lesson
-
75Postorder Traversal Details :: Recursive + Iterative ::Video lesson
-
76Level Order Traversal Details :: Recursive + Iterative ::Video lesson
-
77Source Code :: Implementation of Binary Tree Using Linked List ::Text lesson
-
78Create Binary Tree & Insert Value :: Array Implementation ::Video lesson
-
79Search for a Value in Binary TreeVideo lesson
-
80Delete Node from Binary TreeVideo lesson
-
81Delete Binary TreeVideo lesson
-
82Preorder TraversalVideo lesson
-
83Inorder TraversalVideo lesson
-
84Postorder TraversalVideo lesson
-
85Level order TraversalVideo lesson
-
86Source Code :: Implementation of Binary Tree Using Array ::Text lesson

External Links May Contain Affiliate Links read more