Home Courses Applied Coding Track

Applied Coding Track

Category: INTERVIEW PREPARATION COURSE

Applied Coding Track

Category: INTERVIEW PREPARATION COURSE
Cinque Terre
Instructor
Admin


2.1
Lists
38 mins
2.2
Tuples part 1
10 mins
2.3
Tuples part-2
4 mins
2.4
Sets
16 mins
2.5
Dictionary
21 mins
2.6
Strings
16 mins

10.1
Character Set in C
15 mins
10.2
Keywords and Identifiers
13 mins
10.3
Data Types
29 mins
10.4
Variables
14 mins
10.5
Constants
25 mins
10.6
Input and Output
30 mins
10.7
Formatting input and output
30 mins
12.1
If else
23 mins
12.2
While-loop
25 mins
12.3
Do-while
7 mins
12.4
For loop
36 mins
12.5
Nested and Infinite loops
14 mins
12.6
Break & Continue
23 mins
12.7
goto
11 mins
12.8
switch-case
12 mins
12.9
Sample Problem 1
11 mins
12.10
Solved Problem 2
6 mins
12.11
Solved Problem 3
5 mins
12.12
Solved Problem 4
9 mins
12.13
Solved Problem 5
2 mins
12.14
Solved Problem 6
5 mins
12.15
Solved Problem 7
7 mins

51.1
Intuition
19 mins
51.2
Pseudo code
9 mins

54.1
Find Missing Number
16 mins
54.2
Find Missing Number [Python Code]
5 mins
54.3
Find Majority Element in an array
17 mins
54.4
Rotate Array
18 mins
54.5
Single Number
13 mins
54.6
How Many Numbers Are Smaller Than the Current Number: Problem Statement [Leetcode]
5 mins
54.7
How Many Numbers Are Smaller Than the Current Number: Approach1 [Leetcode]
5 mins
54.8
How Many Numbers Are Smaller Than the Current Number: Approach2 [Leetcode]
8 mins
54.9
How Many Numbers Are Smaller Than the Current Number: Appraoch2 (Python Code): [Leetcode]
5 mins
54.10
How Many Numbers Are Smaller Than the Current Number: Approach3 [Leetcode]
9 mins
54.11
How Many Numbers Are Smaller Than the Current Number: Approach3(Python Code) [Leetcode]
5 mins
54.12
Sort Array by Parity: Problem Statement [Leetcode]
4 mins
54.13
Sort Array by Parity: Approach1 [Leetcode]
4 mins
54.14
Sort Array by Parity: Approach2 and Python Code [Leetcode]
9 mins
54.15
Create Target Array in the Given Order: Problem Statement[Leetcode]
6 mins
54.16
Create Target Array in the Given Order: Explanation & Python Code [Leetcode]
6 mins
54.17
Replace Elements with Greatest Element on Right Side: Problem Statement [Leetcode]
4 mins
54.18
Replace Elements with Greatest Element on Right Side: Approach 1 [Leetcode]
4 mins
54.19
Replace Elements with Greatest Element on Right Side: Approach 2 [Leetcode]
6 mins
54.20
Replace Elements with Greatest Element on Right Side: Approach 2 (Python Code) [Leetcode]
4 mins
54.21
Shortest Unsorted Continuous Subarray: Problem Statement [Leetcode]
5 mins
54.22
Shortest Unsorted Continuous Subarray: Approach 1 [Leetcode]
12 mins
54.23
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
5 mins
54.24
Shortest Unsorted Continuous Subarray: Approach2 [Leetcode]
6 mins
54.25
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
4 mins
54.26
Shortest Unsorted Continuous Subarray: Approach 3 [Leetcode]
9 mins
54.27
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
8 mins
54.28
Find Leaders in an array
15 mins
54.29
Search in Rotated Sorted Array
23 mins
54.30
Sort Colors
19 mins
54.31
Inversions in an array
24 mins
54.32
Increasing Triplet Subsequence
19 mins
54.33
Partition Equal Subset Sum
11 mins
54.34
Array Product Problem
16 mins
54.35
Find two Missing Numbers in a Sequence of Consecutive Numbers
20 mins
54.36
Find two reapting elements in an array
26 mins
54.37
Merge Overlapping Intervals
20 mins
54.38
Rotate Matrix by 90 degrees
12 mins
54.39
3 Sum : Problem Statement [Leetcode]
3 mins
54.40
3 Sum: Brute Force Approach: [Leetcode]
5 mins
54.41
3 Sum: Two pointer Approach: [Leetcode]
9 mins
54.42
3 Sum: Two pointer Approach[Python code]: [Leetcode]
5 mins
54.43
Set Matrix Zeros: Problem statement [Leetcode]
3 mins
54.44
Set Matrix Zeros: Approach 1 [Leetcode]
8 mins
54.45
Set Matrix Zeros: Approach 1(Python Code) [Leetcode]
5 mins
54.46
Set MatriX Zeros: Approach 2 [Leetcode]
7 mins
54.47
Set Matrix Zeros: Approach 2 (Python Code) [Leetcode]
6 mins
54.48
Count Negative numbers in a sorted matrix: Problem statement [Leetcode]
4 mins
54.49
Count Negative Numbers in a Sorted Matrix: Approach1[Leetcode]
3 mins
54.50
Count Negative Numbers in a Sorted Matrix: Approach 2 [Leetcode]
6 mins
54.51
Count Negative Numbers in a Sorted Matrix: Python code [Leetcode]
5 mins
54.52
The K Weakest Rows in a Matrix: Problem Statement [Leetcode]
6 mins
54.53
The K Weakest Rows in a Matrix: Approach 1 [Leetcode]
8 mins
54.54
The K Weakest Rows in a Matrix: Python code [Leetcode]
4 mins
54.55
The K Weakest Rows in a Matrix: Approach 2 [Leetcode]
7 mins
54.56
The K Weakest Rows in a Matrix: Python code [Leetcode]
5 mins
54.57
The K Weakest Rows in a Matrix: Approach 3 [Leetcode]
8 mins
54.58
Median Of two sorted arrays
34 mins
54.59
First Missing Positive: Problem Statement [Leetcode]
3 mins
54.60
First Missing Positive: Approach 1 [Leetcode]
4 mins
54.61
First Missing Positive: Python Code [Leetcode]
5 mins
54.62
First Missing Positive: Approach 2 [Leetcode]
14 mins
54.63
First Missing Positive: Python Code [Leetcode]
6 mins
54.64
Find Numbers with Even Number of Digits: Problem Statement [Leetcode]
3 mins
54.65
Find Numbers with Even Number of Digits: Exaplnation [Leetcode]
7 mins
54.66
Game of Life: Problem Statement [Leetcode]
8 mins
54.67
Game of Life: Approach 1[Leetcode]
9 mins
54.68
Game of Life: Approach 1(Python Code)[Leetcode]
9 mins
54.69
Game of Life: Approach 2[Leetcode]
10 mins
54.70
Game of Life: Approach 2(Python Code)[Leetcode]
8 mins
55.1
Find Kth Node from end of linked list
15 mins
55.2
Linked List Cycle
40 mins
55.3
Remove Nth node from End of a linked list
23 mins
55.4
Assignment Problem 3 on kth node of the linked list from the end of the list
1 mins
55.5
Assignment Problem 1 on detect loop in the linked list
1 mins
55.6
Assignment Problem 2 on detect loop in the linked list
1 mins
55.7
Palindrome Linked List
40 mins
55.8
Assingment Problem 1 on Palindrome linked list
1 mins
55.9
Intersection point of Two Linked Lists
25 mins
55.10
Assignment problem 1 on Intersection of two linked list
1 mins
55.11
Alternative split of singly Linked list
20 mins
55.12
Assignment problem 1 Alternating split of Linked list
1 mins
55.13
Assignment problem 2 Alternating split of linked list
1 mins
55.14
Assignment problem 3 Alternating split of linked list
1 mins
55.15
Clone List with Random Pointer
34 mins
55.16
XOR Linked List - A Memory Efficient Doubly Linked List
30 mins
55.17
Add Two numbers
16 mins
55.18
Assignment Problem 1 on Add two linked list
1 mins
55.19
Split a Circular Linked List into two halves
12 mins
55.20
Reverse K alternative nodes in a linked list
19 mins
55.21
Assignment Problem 1 on Reverse alternate k nodes
1 mins
55.22
Assignment problem 2 on Reverse Alternative K nodes
1 mins
55.23
Merge Two Sorted Linked Lists
19 mins
55.24
Assignment Problem 1 on Merge Two sorted Linked lists
1 mins
55.25
Assignment Problem 2 on Merge Two sorted Linked lists
1 mins
55.26
Flattening a Linked List
13 mins
55.27
Merge sort for Linked List
12 mins
55.28
Assignment problem 1 on Merge sort
1 mins
55.29
Union and Intersection of two Linked Lists
24 mins
55.30
Assignment problem 1 on Union and intersection
1 mins
55.31
Swap Nodes in pairs (practice)
1 mins
55.32
Assignment Problem 1 on Swap Nodes in a pairs
1 mins
55.33
Find Next Greater Node In a Linked List(practice)
1 mins
55.34
Rotate Linked List(practice)
1 mins
55.35
Assignment problem 1 on remove duplicates from sorted linked list.
1 mins
55.36
Find Middle Element in a linked list
22 mins
55.37
Reverse a linked list (Iterative Approach)
14 mins
55.38
Remove Duplicates from Sorted linked list
19 mins
55.39
Odd Even Linked list
18 mins
55.40
Inserted Into a sorted circular linked list
25 mins
56.1
Design a stack such that getMinium() should be O(1) time and O(1) space
22 mins
56.2
Print Next Greater Element
28 mins
56.3
Design and Implement Special Stack Data Structure. push(), pop(), getMinimum(), findMiddleElement(), deleteMiddleElement()
24 mins
56.4
Check if parenthesis are balanced or not
16 mins
56.5
Stock Span Problem
24 mins
56.6
The Celebrity Problem
26 mins
56.7
Reverse a stack using recursion
21 mins
56.8
Implement two stacks in single array
16 mins
56.9
Petrol Filling Problem
24 mins
56.10
Implement stack using Queues
15 mins
56.11
Largest Rectangle in Histogram: Problem Statement [Leetcode]
4 mins
56.12
Largest Rectangle in Histogram: Approach1 [Leetcode]
9 mins
56.13
Largest Rectangle in Histogram: Approach 1 (Python Code) [Leetcode]
9 mins
56.14
Largest Rectangle in Histogram: Approach 2 [Leetcode]
15 mins
56.15
Largest Rectangle in Histogram: Python code [Leetcode]
8 mins
56.16
Write a Program for Implement Queue using Stacks
1 mins
56.17
Trapping Rain Water: Problem Statement [Leetcode]
4 mins
56.18
Trapping Rain Water: Approach 1 [Leetcode]
7 mins
56.19
Trapping Rain Water: Approach 1 (Python code)[Leetcode]
6 mins
56.20
Trapping Rain Water: Approach 2 [Leetcode]
6 mins
56.21
Trapping Rain Water: Approach 2 (Python code)[Leetcode]
5 mins
56.22
Trapping Rain Water: Approach 3 [Leetcode]
14 mins
56.23
Trapping Rain Water: Approach 3 (Python code)[Leetcode]
6 mins
56.24
Trapping Rain Water: Approach 4 [Leetcode]
11 mins
56.25
Asteroid Collision: Problem Statement [Leetcode]
5 mins
56.26
Asteroid Collision: Approach 1[Leetcode]
10 mins
56.27
Asteroid Collision: Approach 1 (Python code)[Leetcode]
6 mins
56.28
Asteroid Collision: Approach 2 and Python code[Leetcode]
10 mins
57.1
Count number of nodes in the binary tree
12 mins
57.2
Check if two trees are identical or not
9 mins
57.3
Level Order Tree Traversal
16 mins
57.4
Print Level order traversal in spiral form
37 mins
57.5
Convert a Binary Tree into its Mirror Tree
15 mins
57.6
Print Ancestors of a given node in Binary Tree
20 mins
57.7
Find Lowest Common Ancestor in a Binary Search Tree
22 mins
57.8
Children sum property in a binary tree
25 mins
57.9
Print Lowest Common Ancestor in a Binary Tree
11 mins
57.10
count leaf nodes in a binary tree
10 mins
57.11
Construct a binary tree from inorder and postorder traversals
26 mins
57.12
Convert a given tree to its Sum Tree
12 mins
57.13
Find the maximum sum leaf to root path in a Binary Tree
14 mins
57.14
Find Diameter of a Binary Tree
20 mins
57.15
Convert a given Binary Tree to Doubly Linked List
14 mins
57.16
Vertical Traversal of binary tree
14 mins
57.17
Inorder Tree Traversal without recursion and without stack (Threaded binary tree)
21 mins
57.18
Serialize and deserialize of a binay tree
23 mins
57.19
Boundary Traversal of a Binary Tree
22 mins
57.20
Merge Two binary trees [Leetcode]
16 mins
57.21
Range Sum of Binary Search Tree [Leetcode]
19 mins
57.22
Trim a BInary Search Tree (Practice Problem)
1 mins
57.23
Search in a Binary Search Tree [Leet code]
19 mins
57.24
Print Right View of a Binary Tree
1 mins
57.25
Invert Binary Tree [Leetcode]
17 mins
57.26
Given a binary tree, find its maximum depth. [Leetcode]
17 mins
57.27
Path Sum [Leetcode]
16 mins
57.28
Leaf-Similar Trees
1 mins
57.29
Find the sum of all left leaves in a given binary tree. [Leetcode]
14 mins
57.30
Given two binary trees, write a function to check if they are the same or not [Leetcode]
15 mins
57.31
All Elements in Two Binary Search Trees [Leetcode]
33 mins
57.32
Maximum Binary Tree: Problem Statement [Leetcode]
5 mins
57.33
Maximum Binay Tree: Explanation: [LeetCode]
10 mins
57.34
Maximum Binay Tree: Python Code: [LeetCode]
5 mins
57.35
Binary Tree Pruning: Problem Statement [Leetcode]
4 mins
57.36
Binary Tree Pruning: Explanation: [Leetcode]
7 mins
57.37
Binary Tree Pruning: Python Code[Leetcode]
6 mins
57.38
Validate Binary Search Tree: Problem Statement [Leetcode]
5 mins
57.39
Validate Binary Search Tree: Explanation[Part1] : [Leetcode]
2 mins
57.40
Validate Binary Search Tree: Explanation[Part2] : Leetcode
10 mins
57.41
Validate Binary Search Tree: Python Code : [Leetcode]
6 mins
57.42
Validate Binary Search Tree: Iterative Approach: [Leetcode]
7 mins
57.43
Binary Tree Zigzag Level Order Traversal: Problem Statement [Leetcode]
4 mins
57.44
Binary Tree Zigzag Traversal : Explanation [Leetcode]
8 mins
57.45
Binary Tree Zigzag Traversal: Python code [Leetcode]
11 mins
57.46
Populating Next Right Pointers in Each Node: Problem Statement [Leetcode]
5 mins
57.47
Populating Next Right Pointers in Each Node: Explanation [Leetcode]
10 mins
57.48
Populating Next Right Pointers in Each Node: Python code [Leetcode]
5 mins
57.49
Binary Tree Right Side View: Problem Statement [Leetcode]
3 mins
57.50
Binary Tree Right Side View: Explanation [Leetcode]
7 mins
57.51
Binary Tree Right Side View: Python Code [Leetcode]
7 mins
57.52
Kth Smallest Element in a BST: Problem Statement [Leetcode]
5 mins
57.53
Kth Smallest Element in a BST: Approach 1 [Leetcode]
7 mins
57.54
Kth Smallest Element in a BST: Approach 1 (python code) [Leetcode]
5 mins
57.55
Kth Smallest Element in a BST: Approach 2 [Leetcode]
10 mins
57.56
Kth Smallest Element in a BST: Approach 3[Leetcode]
3 mins
59.1
Remove all duplicates from the input string.
22 mins
59.2
Reverse words in a given string
15 mins
59.3
Run Length Encoding
13 mins
59.4
Remove all adjacent duplicate characters in a string
23 mins
59.5
First Non-repeating character in a string
12 mins
59.6
Find first non-repeating character in a stream
21 mins
59.7
Find the smallest window in a string containing all characters of another string
31 mins
59.8
Print all anagrams in a list of words
14 mins
59.9
Rearrange Characters to form a palindrome
16 mins
59.10
Reorder Data In log files
15 mins
59.11
Decode Ways: Problem Statement [Leetcode]
4 mins
59.12
Decode Ways: Approach 1 [Leetcode]
11 mins
59.13
Decode Ways: Python Code [Leetcode]
6 mins
59.14
Decode Ways: Approach 2 [Leetcode]
5 mins
59.15
Longest Common Prefix: Problem Statement [Leetcode]
3 mins
59.16
Longest Common Prefix: Approach 1 [Leetcode]
6 mins
59.17
Longest Common Prefix: Python code [Leetcode]
8 mins
59.18
Longest Common Prefix: Approach 2[Leetcode]
4 mins
59.19
Longest Common Prefix: Python Code[Leetcode]
6 mins
59.20
Longest Common Prefix: Approach 3[Leetcode]
7 mins
59.21
Longest Common Prefix: Python code [Leetcode]
9 mins
59.22
Longest Common Prefix: Approach 4 [Leetcode]
5 mins
59.23
Longest Common Prefix: Python code [Leetcode]
4 mins
59.24
Reorganize String: Problem Statement [Leetcode]
4 mins
59.25
Reorganize String: Approach 1 [Leetcode]
6 mins
59.26
Reorganize String: Approach 1 (Python code) [Leetcode]
7 mins
59.27
Reorganize String: Approach 2 [Leetcode]
13 mins
59.28
Reorganize String: Approach 2 (Python code) [Leetcode]
9 mins
59.29
Group Anagrams: Problem Statement [Leetcode]
3 mins
59.30
Group Anagrams: Approach1 [Leetcode]
6 mins
59.31
Group Anagrams: Approach1 (Python Code)[Leetcode]
4 mins
59.32
Group Anagrams: Approach2 [Leetcode]
6 mins
59.33
Group Anagrams: Approach2 (Python Code)[Leetcode]
4 mins
59.34
Sort Characters By Frequency
1 mins
59.35
check if strings are rotations of each other or not
1 mins
59.36
Find all distinct palindromic sub strings of a given string
1 mins
59.37
Find a excel column name from a given column number.
1 mins
59.38
Write a Program for String matching where one string contains wildcard characters
1 mins
62.1
Largest sum contiguous sub array
46 mins
62.2
Longest Palindromic sub sequence
50 mins
62.3
climbing stairs problem
16 mins
62.4
nth ugly number
38 mins
62.5
Rod cutting Problem
25 mins
62.6
Count all possible paths in a Grid
17 mins
62.7
Coin Change Problem
25 mins
62.8
Minimum Cost path Problem
19 mins
62.9
Fill a N*4 wall with 1*4 bricks problem
23 mins
62.10
Levenstein/Edit Distance Problem
29 mins
62.11
Egg dropping Problem
34 mins
62.12
Word Break Problem
21 mins
62.13
Longest Increasing Subsequence
20 mins
62.14
Longest Increasing Subsequence (O(nlogn))
27 mins
62.15
Subset Sum Problem
20 mins
62.16
Unique Paths: Problem Statment [Leetcode]
5 mins
62.17
Unique Paths: Approach 1 [Leetcode]
9 mins
62.18
Unique Paths: Python Code[Leetcode]
3 mins
62.19
Unique Paths: Approach 2 [Leetcode]
6 mins
62.20
Unique Paths: Python code[Leetcode]
4 mins
62.21
Unique Binary Search Trees: Problem Statement [Leetcode]
4 mins
62.22
Unique Binary Search Trees: Explanation [Leetcode]
17 mins
62.23
Unique Binary Search Trees: Python code [Leetcode]
6 mins
62.24
House Robber: Problem Statment [Leetcode]
6 mins
62.25
House Robber: Approach 1 [Leetcode]
13 mins
62.26
House Robber: Python code [Leetcode]
8 mins
62.27
House Robber: Approach 2 [Leetcode]
9 mins
62.28
House Robber: Python code [Leetcode]
6 mins
62.29
House Robber: Approach 3 & Python code [Leetcode]
9 mins
62.30
Longest Palindromic Substring: Problem Statement [Leetcode]
3 mins
62.31
Longest Palindromic Substring: Approach 1 [Leetcode]
4 mins
62.32
Longest Palindromic Substring: Approach 2 [Leetcode]
11 mins
62.33
Longest Palindromic Substring: Approach 2(Python code) [Leetcode]
11 mins
62.34
Longest Palindromic Substring: Approach 3 [Leetcode]
9 mins
62.35
Longest Palindromic Substring: Approach 3(Python code) [Leetcode]
13 mins
62.36
Write a Program for Maximum size square sub-matrix with all 1s
1 mins
62.37
Longest Valid Parentheses
1 mins
62.38
Binary Tree Cameras
1 mins
62.39
Write a Program for Partition problem
1 mins
62.40
Write a Program for Maximum sum rectangle in a 2D matrix
1 mins
66.1
Single Number 11: Problem Statement [Leetcode]
4 mins
66.2
Single Number 11: Approach 1 [Leetcode]
5 mins
66.3
Single Number 11: Python code [Leetcode]
5 mins
66.4
Single Number 11: Approach 2 [Leetcode]
12 mins
66.5
Single Number 11: Python code [Leetcode]
3 mins
66.6
Number of 1 Bits: Problem Statement [Leetcode]
3 mins
66.7
Number of 1 Bits: Approach1 [Leetcode]
7 mins
66.8
Number of 1 Bits: Approach 2 [Leetcode]
8 mins
66.9
Counting Bits: Problem Statement [Leetcode]
5 mins
66.10
Counting Bits: Approach 1 [Leetcode]
8 mins
66.11
Counting Bits: Approach 2 [Leetcode]
9 mins
66.12
Counting Bits: Python code [Leetcode]
3 mins
66.13
Counting Bits: Approach 3 [Leetcode]
3 mins
66.14
Maximum Product of Word Lengths: Problem Statment [Leetcode]
5 mins
66.15
Maximum Product of Word Lengths: Approach 1 [Leetcode]
5 mins
66.16
Maximum Product of word Lengths: Python Code [Leetcode]
5 mins
66.17
Maximum Product of word lengths: Approach 2 [Leetcode]
10 mins
66.18
Maximum product of word lengths: Python Code [Leetcode]
4 mins
66.19
Total Hamming distance: Problem Statement [Leetcode]
4 mins
66.20
Total Hamming Distance: Approach 1 [Leetcode]
8 mins
66.21
Total Hamming Distance: Approach 2 [Leetcode]
7 mins
66.22
Total Hamming Distance: Python code[Leetcode]
4 mins
66.23
pow(x, n) : problem statement [Leetcode]
3 mins
66.24
pow(x, n) : Approach 1 and Python code [Leetcode]
5 mins
66.25
pow(x, n) : Approach 2 and Python code [Leetcode]
6 mins
66.26
pow(x, n) : Iterative Approach [leetcode]
4 mins

94.1
INSERT
6 mins
94.2
UPDATE , DELETE
5 mins

107.1
Essentials of C++ To crack coding interviews
180 mins
107.2
Popular STL (C++ library) data structures and algorithms
150 mins
107.3
Data Structures:Container Data Structures (Arrays, Linked Lists, Matrices, sets) on 06-12-2021
150 mins
107.4
Design Techniques: Brute Force, Transform-and-Conquer (Presorting), Input Enhancement (Prefix Sum) on 08-12-2021
135 mins
107.5
Analysis: Linear and Quadratic time complexity classes on 10-12-2021
135 mins
107.6
Design Techniques: Input Enhancement (Prefix Sum) on 13-12-2021
130 mins
107.7
Data Structures_ Multidimensional arrays (Matrices)
135 mins
107.8
Design Techniques on Matrices
125 mins
107.9
Design Technique_ Two Pointers (moving at the same speed)
125 mins
107.10
Design Technique_ Two Pointers (Fixed-width Sliding Window)
120 mins
107.11
Design Technique_ Two Pointers (Slow-and-Fast Pointers) on 27-12-2021
127 mins
107.12
Design Technique_ Two Pointers (Greedy) on 29-12-2021
130 mins
107.13
Design Technique_ Two Pointers (Variable-width Sliding Window) on 31-12-2021
120 mins
107.14
Design Technique_ Two Pointers and Sliding Window Techniques Summarized on 03 -01-2022
120 mins
107.15
Designing a Container Data Structure_ Arrays, Linked Lists, Binary Trees and BSTs on 05-01-2022
125 mins
107.16
Designing a Container Data Structure_ Hash Tables, Deques, Stacks, Queues, and Priority Queues on 07-01-2022
130 mins
107.17
Designing a Container Data Structure_ Priority Queues (Heap data structure)
130 mins
107.18
Amortized Complexity Analysis
150 mins
107.19
Recursive Thinking - Tail Recursion and Head Recursion
150 mins
107.20
Recursive Thinking_ Math Introduction and Analysis of Recursive Algorithms on 17-01-2022
125 mins
107.21
Divide and Conquer and Merge sort on 19-01-2022
125 mins
107.22
Quicksort and Quickselect
125 mins
107.23
Strong Induction and Binary Search
125 mins
107.24
Recursive Thinking (DFS on Trees) with Binary Trees)
127 mins
107.25
Recursive Thinking (DFS on Trees) with BSTs
127 mins
107.26
DFS on Graphs
125 mins
107.27
BFS on Graphs
127 mins
107.28
BFS for Shortest Path Finding problems
137 mins
107.29
DAG and Topological Sorting
127 mins
107.30
Backtracking and State Space Tree
125 mins
107.31
Memoization and Dynamic Programming
125 mins
107.32
DP on Subsets and Subarrays
127 mins
107.33
DP on Path Finding Problems
128 mins
107.34
DP on Counting problems
128 mins
107.35
Miscellaneous Topics
128 mins
107.36
Miscellaneous Topics 2
1 mins
108.1
Essential C++ for Coding Interviews
150 mins
108.2
Using STL Containers in Coding Problems
150 mins
108.3
Using STL Algorithms in Coding Problems
126 mins
108.4
Designing a Container Data Structure_ Arrays, Linked Lists, Binary Tress and BST
128 mins
108.5
Designing a Container Data Structure_ Hash Tables, Deques, Stacks and Queues
127 mins
108.6
Designing a Container Data Structure_ Priority Queues (Heap data Structure)
126 mins
108.7
2-D Arrays(Matrices), Jagged Arrays
127 mins
108.8
Presorting(Preprocessing, Transform-and-Conquer)
125 mins
108.9
Prefix Sum(Preprocessing, Input Enhancement, Space-and-Time Tradeoff)
125 mins
108.10
Sliding Window- Part 1 (Fixed-Width-Window)
127 mins
108.11
Two Pointers- Part 1(Same Speed Pointers)
126 mins
108.12
Two Pointers- Part 2(Pointers On two Sequences, Slow-and-Fast Pointers)
125 mins
108.13
Amortised Complexity Analysis, Stacks, Queues and Deques
127 mins
108.14
Recursive Thinking-Tail Recursion and Head Recursion
127 mins
108.15
Recursive Thinking-Math Induction and Analysis of Recursive Algorithms
128 mins
108.16
Recursive Thinking- Divide and Conquer
128 mins
108.17
Recursive Thinking - Problems on Binary Trees
127 mins
108.18
DFS On Trees
129 mins
108.19
DFS on BSTs
129 mins
108.20
DFS On Graphs
129 mins
108.21
Graph Properties And Traversals
129 mins
108.22
BFS on Graphs
129 mins
108.23
Backtracking - State Space Tree - Subsets Generation
129 mins
108.24
BFS on Trees
129 mins
108.25
Backtracking- Combinations and permutations Generation
128 mins
108.26
Dynamic Programming-Memoization
128 mins
108.27
Dynamic Programming-Bottom-up
129 mins
108.28
DP - Optimal Subsets and the Knapsack Problem
130 mins
108.29
DP-Path Finding (Graph) Problems
129 mins
108.30
DP-Counting Problems
128 mins
108.31
Greedy_ Two Pointers Greedy, Variable-Width Sliding Window
128 mins
108.32
Conclusion- problem Solving
107 mins
109.1
Designing a Container Data Structure: Arrays, Linked Lists, Binary Trees, BSTs (Ordered Map)
120 mins
109.2
Designing a Container Data Structure: Hash Tables (Unordered Map), Deques, Stacks, Queues
120 mins
109.3
Amortised Complexity Analysis, Priority Queues (Heap data structure)
120 mins
109.4
2-D Arrays (Matrices and Jagged Arrays)
120 mins
109.5
Presorting (Preprocessing, Transform-and-Conquer)
120 mins
109.6
Prefix Sum (Preprocessing, Input Enhancement, Space-and-Time Tradeoff)
120 mins
109.7
Sliding Window - part 1 (Fixed-width window)
120 mins
109.8
Two Pointers - part 1 (Same speed pointers)
120 mins
109.9
Two Pointers - part 2 (Pointers on two sequences, Slow-and-Fast Pointers)
120 mins
109.10
Recursive Thinking - Tail Recursion and Head Recursion
120 mins
109.11
Recursive Thinking - Math Induction and Analysis of Recursive Algorithms
120 mins
109.12
Recursive Thinking - Divide and Conquer
120 mins
109.13
Recursive Thinking - Problems on Binary Trees (DFS on Trees)
120 mins
109.14
Recursive Thinking - Problems on BSTs (DFS on BSTs)
120 mins
109.15
DFS on Graphs - Graph Properties
120 mins
109.16
BFS on Graphs
120 mins
109.17
BFS on Trees
120 mins
109.18
Backtracking - State Space Tree - Subsets Generation
1 mins
109.19
Backtracking - Combinations and Permutations Generation
1 mins
109.20
Dynamic Programming - Memoization
1 mins
109.21
Dynamic Programming - Bottom-up
1 mins
109.22
DP - Path Finding (Graph) Problems
1 mins
109.23
DP - Counting Problems
1 mins
109.24
DP - Optimal Subarrays
1 mins
109.25
Sliding Window Greedy - (Variable Width)
1 mins
109.26
Two pointers greedy
1 mins
109.27
BFS Greedy and Dijkstras Algorithm
1 mins
109.28
Advanced Binary Search
1 mins
109.29
Advanced Bit Manipulation and Boolean Algebra
120 mins
109.30
How to solve an unseen algorithm problem from scratch in a coding interview
120 mins

Course Features
Lectures
150
Duration
150
Skill level
Medium
Language
English
Assessments
10

Cinque Terre
Admin

12.1
Satellite data and key
11 mins--
12.2
How it works: Card-sorting
20 mins--
12.3
Pseudo code
24 mins--
12.4
Correctness
6 mins--
12.5
In-place sorting
8 mins--
12.6
Stable sort
15 mins--
12.7
Online sorting
10 mins--
13.1
Introduction to Databases
22 mins--
13.2
Why SQL?
15 mins--
13.3
Execution of an SQL statement.
7 mins--
13.4
IMDB dataset
12 mins--
13.5
Installing MySQL
11 mins--
13.6
Load IMDB data
3 mins--

0 Reviews

OVERALL RATING

0/5.0

5
0%
4
0%
3
0%
2
0%
1
0%
Please Rate Your Experiance:*

Applied Coding Track

Category: INTERVIEW PREPARATION COURSE
₹18,000.00 ₹22,500.00
Cinque Terre
Instructor
Admin

156 Comment(s)

Login to comment
Powered By


Youtube
Facebook
Linkedin

Applied Courses

Diploma AI and ML
Applied AI course
Applied GATE Course
Applied Interviewprep Course

Contact Us

Applied AI Course

team@appliedaicourse.com
 

Applied GATE Course

gatecse@appliedroots.com
 

Applied Interviewprep Course

interviewprep@appliedroots.com
 

 

Diploma AI and ML

pgduoh@appliedroots.com
 

Corporate Solutions

enterprise@appliedroots.com

© 2020 - All rights are reserved- AAIC Technologies pvt ltd
Terms & Conditions Privacy Policy