Home Courses Interview Preparation Course

Interview Preparation Course

Category: INTERVIEW PREPARATION COURSE

Interview Preparation Course

Category: INTERVIEW PREPARATION COURSE
Cinque Terre
Instructor
Applied Roots


Bank PO Mock Test 2
NA
Bank PO Mock Test 2
NA
13.1
If else
23 mins
13.2
While-loop
25 mins
13.3
Do-while
7 mins
13.4
For loop
36 mins
13.5
Nested and Infinite loops
14 mins
13.6
Break & Continue
23 mins
13.7
goto
11 mins
13.8
switch-case
12 mins
13.9
Sample Problem 1
11 mins
13.10
Solved Problem 2
6 mins
13.11
Solved Problem 3
5 mins
13.12
Solved Problem 4
9 mins
13.13
Solved Problem 5
2 mins
13.14
Solved Problem 6
5 mins
13.15
Solved Problem 7
7 mins
MOCK GT-01
NA
Mock GT-02
NA
Mock GT-03
NA
22.1
Static And Dynamic Scoping
18 mins
22.2
Function Pointers
24 mins
22.3
Enum
10 mins

Insertion Sort and Asymptotic Notations
NA
IBPS OFFICE ASSISTANT – GT-1
NA
38.1
Solved Problem 1
6 mins
IBPS RRB SCALE-1 MAINS GT-02
NA

49.1
Solved Problem 1
6 mins
IBPS RRB OFFICE ASSISTANT MAINS GT-01
NA
IBPS CLERK MAINS -02
NA
RRB NTPC GT-01
NA
71.1
problem 1
7 mins
71.2
Problem 2
4 mins
71.3
Problem 3
4 mins
71.4
Problem 4
9 mins
71.5
Problem 5
5 mins
71.6
Problem 6
8 mins
71.7
Problem 7
1 mins
71.8
Problem 8
1 mins
71.9
Problem 9
2 mins
71.10
Problem 10
4 mins
71.11
Problem 11
6 mins
71.12
Problem 12
4 mins
71.13
Problem 13
5 mins
71.14
Problem 14
6 mins
71.15
Problem 15
3 mins
RRB NPTC GT-02
NA

IBPS OFFICE ASSISTANT – GT- 2
NA
84.1
Intuition
19 mins
84.2
Pseudo code
9 mins
Exercise at end of chapter 2
NA

88.1
Find Missing Number
16 mins
88.2
Find Missing Number [Python Code]
5 mins
88.3
Find Majority Element in an array
17 mins
88.4
Rotate Array
18 mins
88.5
Single Number
13 mins
88.6
Write a Program for Given an array A[] and a number x, check for pair in A[] with sum as x
1 mins
88.7
How Many Numbers Are Smaller Than the Current Number: Problem Statement [Leetcode]
5 mins
88.8
How Many Numbers Are Smaller Than the Current Number: Approach1 [Leetcode]
5 mins
88.9
Write a Program for Segregate 0s and 1s in an array
1 mins
88.10
How Many Numbers Are Smaller Than the Current Number: Approach2 [Leetcode]
8 mins
88.11
How Many Numbers Are Smaller Than the Current Number: Appraoch2 (Python Code): [Leetcode]
5 mins
88.12
How Many Numbers Are Smaller Than the Current Number: Approach3 [Leetcode]
9 mins
88.13
How Many Numbers Are Smaller Than the Current Number: Approach3(Python Code) [Leetcode]
5 mins
88.14
Sort Array by Parity: Problem Statement [Leetcode]
4 mins
88.15
Sort Array by Parity: Approach1 [Leetcode]
4 mins
88.16
Sort Array by Parity: Approach2 and Python Code [Leetcode]
9 mins
88.17
Create Target Array in the Given Order: Problem Statement[Leetcode]
6 mins
88.18
Create Target Array in the Given Order: Explanation & Python Code [Leetcode]
6 mins
88.19
Replace Elements with Greatest Element on Right Side: Problem Statement [Leetcode]
4 mins
88.20
Replace Elements with Greatest Element on Right Side: Approach 1 [Leetcode]
4 mins
88.21
Replace Elements with Greatest Element on Right Side: Approach 2 [Leetcode]
6 mins
88.22
Replace Elements with Greatest Element on Right Side: Approach 2 (Python Code) [Leetcode]
4 mins
88.23
Shortest Unsorted Continuous Subarray: Problem Statement [Leetcode]
5 mins
88.24
Trapping rain water problem
1 mins
88.25
Shortest Unsorted Continuous Subarray: Approach 1 [Leetcode]
12 mins
88.26
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
5 mins
88.27
Write a Program for Write a program to reverse an array
1 mins
88.28
Write a Program for Block swap algorithm for array rotation
1 mins
88.29
Shortest Unsorted Continuous Subarray: Approach2 [Leetcode]
6 mins
88.30
Given a positive number X, print all jumping numbers(all adjacent digits in it differ by 1) smaller than or equal to X
1 mins
88.31
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
4 mins
88.32
Write a Program for Largest subarray with equal number of 0s and 1s
1 mins
88.33
Write a Program for Find subarray with given sum
1 mins
88.34
Shortest Unsorted Continuous Subarray: Approach 3 [Leetcode]
9 mins
88.35
Write a Program for Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space
1 mins
88.36
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
8 mins
88.37
Find Leaders in an array
15 mins
88.38
Write a Program for Print a given matrix in spiral form
1 mins
88.39
Search in Rotated Sorted Array
23 mins
88.40
Two Sum Problem
1 mins
88.41
Sort Colors
19 mins
88.42
Similar Problems for Two Sum Problem
1 mins
88.43
Inversions in an array
24 mins
88.44
Increasing Triplet Subsequence
19 mins
88.45
Inversions in an array
24 mins
88.46
Partition Equal Subset Sum
11 mins
88.47
Array Product Problem
16 mins
88.48
Find two Missing Numbers in a Sequence of Consecutive Numbers
20 mins
88.49
Inversions in an array
24 mins
88.50
Find two reapting elements in an array
26 mins
88.51
Merge Overlapping Intervals
20 mins
88.52
Rotate Matrix by 90 degrees
12 mins
88.53
3 Sum : Problem Statement [Leetcode]
3 mins
88.54
3 Sum: Brute Force Approach: [Leetcode]
5 mins
88.55
3 Sum: Two pointer Approach: [Leetcode]
9 mins
88.56
3 Sum: Two pointer Approach[Python code]: [Leetcode]
5 mins
88.57
Set Matrix Zeros: Problem statement [Leetcode]
3 mins
88.58
Set Matrix Zeros: Approach 1 [Leetcode]
8 mins
88.59
Set Matrix Zeros: Approach 1(Python Code) [Leetcode]
5 mins
88.60
Set MatriX Zeros: Approach 2 [Leetcode]
7 mins
88.61
Set Matrix Zeros: Approach 2 (Python Code) [Leetcode]
6 mins
88.62
Write a program to rotate array of size 'n' by 'd' elements
1 mins
88.63
Count Negative numbers in a sorted matrix: Problem statement [Leetcode]
4 mins
88.64
Count Negative Numbers in a Sorted Matrix: Approach1[Leetcode]
3 mins
88.65
Write a program to find the number of triangles that can be formed with three different array elements as three sides of triangles, for a given unsorted array of n elements
1 mins
88.66
Count Negative Numbers in a Sorted Matrix: Approach 2 [Leetcode]
6 mins
88.67
Count Negative Numbers in a Sorted Matrix: Python code [Leetcode]
5 mins
88.68
The K Weakest Rows in a Matrix: Problem Statement [Leetcode]
6 mins
88.69
The K Weakest Rows in a Matrix: Approach 1 [Leetcode]
8 mins
88.70
The K Weakest Rows in a Matrix: Python code [Leetcode]
4 mins
88.71
The K Weakest Rows in a Matrix: Approach 2 [Leetcode]
7 mins
88.72
The K Weakest Rows in a Matrix: Python code [Leetcode]
5 mins
88.73
Squares of a Sorted Array
1 mins
88.74
The K Weakest Rows in a Matrix: Approach 3 [Leetcode]
8 mins
88.75
Write a program to find duplicate elements in O(n) time and O(1) extra space, for a given array of size 'n'
1 mins
88.76
Given an array of integers, sort the array into a wave like array and return it. (arrange the element into a sequence such that a1>=a2<=a3>=a4<=a5----etc.)
1 mins
88.77
Median Of two sorted arrays
34 mins
88.78
First Missing Positive: Problem Statement [Leetcode]
3 mins
88.79
Write a Program for Maximum difference between two elements such that larger element appears after the smaller number
1 mins
88.80
First Missing Positive: Approach 1 [Leetcode]
4 mins
88.81
Write a program to find the maximum difference of j - i such that a[j] > a[i], for a given an array of 'n' elements.
1 mins
88.82
Write a program to Maximize arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l. Find the maximum value of arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l
1 mins
88.83
First Missing Positive: Python Code [Leetcode]
5 mins
88.84
Write a Program for Find a triplet that sum to a given value
1 mins
88.85
First Missing Positive: Approach 2 [Leetcode]
14 mins
88.86
Write a program to find the smallest integer value that can't be represented as sum of any subset of a given array.
1 mins
88.87
First Missing Positive: Python Code [Leetcode]
6 mins
88.88
Find Numbers with Even Number of Digits: Problem Statement [Leetcode]
3 mins
88.89
Find Numbers with Even Number of Digits: Exaplnation [Leetcode]
7 mins
88.90
Game of Life: Problem Statement [Leetcode]
8 mins
88.91
Game of Life: Approach 1[Leetcode]
9 mins
88.92
Game of Life: Approach 1(Python Code)[Leetcode]
9 mins
88.93
Game of Life: Approach 2[Leetcode]
10 mins
88.94
Game of Life: Approach 2(Python Code)[Leetcode]
8 mins
90.1
Find Kth Node from end of linked list
15 mins
90.2
Middle Node of the Linked List
1 mins
90.3
Linked List Cycle
40 mins
90.4
Remove Nth node from End of a linked list
23 mins
90.5
Assignment Problem 2 on kth node of the linked list from the end of the list
1 mins
90.6
Assignment Problem 3 on kth node of the linked list from the end of the list
1 mins
90.7
Similar Problems on Kth node from end of linked list (Practice)
1 mins
90.8
Assignment Problem 1 on detect loop in the linked list
1 mins
90.9
Similar Problems on Detect Loop in a linked list (Practice)
1 mins
90.10
Assignment Problem 2 on detect loop in the linked list
1 mins
90.11
Palindrome Linked List
40 mins
90.12
Assingment Problem 1 on Palindrome linked list
1 mins
90.13
Intersection point of Two Linked Lists
25 mins
90.14
Assignment problem 1 on Intersection of two linked list
1 mins
90.15
Alternative split of singly Linked list
20 mins
90.16
Assignment problem 1 Alternating split of Linked list
1 mins
90.17
Assignment problem 2 Alternating split of linked list
1 mins
90.18
Assignment problem 3 Alternating split of linked list
1 mins
90.19
Clone List with Random Pointer
34 mins
90.20
XOR Linked List - A Memory Efficient Doubly Linked List
30 mins
90.21
Write a Program for Nth node from the end of a Linked List
1 mins
90.22
Add Two numbers
16 mins
90.23
Assignment Problem 1 on Add two linked list
1 mins
90.24
Split a Circular Linked List into two halves
12 mins
90.25
Reverse K alternative nodes in a linked list
19 mins
90.26
Assignment Problem 1 on Reverse alternate k nodes
1 mins
90.27
Assignment problem 2 on Reverse Alternative K nodes
1 mins
90.28
Write a Program to reverse a linked list
1 mins
90.29
Merge Two Sorted Linked Lists
19 mins
90.30
Assignment Problem 1 on Merge Two sorted Linked lists
1 mins
90.31
similar questions
1 mins
90.32
Assignment Problem 2 on Merge Two sorted Linked lists
1 mins
90.33
Flattening a Linked List
13 mins
90.34
Merge sort for Linked List
12 mins
90.35
Assignment problem 1 on Flatten Linked list
1 mins
90.36
Assignment problem 1 on Merge sort
1 mins
90.37
Union and Intersection of two Linked Lists
24 mins
90.38
Assignment problem 2 on Flatten Linked list
1 mins
90.39
Assignment problem 3 on Flatten linked list.
1 mins
90.40
Assignment problem 1 on Union and intersection
1 mins
90.41
Swap Nodes in pairs (practice)
1 mins
90.42
Assignment Problem 1 on Swap Nodes in a pairs
1 mins
90.43
Find Next Greater Node In a Linked List(practice)
1 mins
90.44
Assignment problem 2 on Mergesort
1 mins
90.45
Rotate Linked List(practice)
1 mins
90.46
Remove duplicate nodes from a sorted linked list(practice)
1 mins
90.47
Assignment problem 1 on remove duplicates from sorted linked list.
1 mins
90.48
Find Middle Element in a linked list
22 mins
90.49
Write a Program for Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
1 mins
90.50
Write a Program for Pairwise swap elements of a given linked list by changing links
1 mins
90.51
Reverse a linked list (Iterative Approach)
14 mins
90.52
Write a Program for Delete nodes which have a greater value on right side
1 mins
90.53
Remove Duplicates from Sorted linked list
19 mins
90.54
Odd Even Linked list
18 mins
90.55
Inserted Into a sorted circular linked list
25 mins
90.56
Assignment problem 1 on Rotate Linked list
1 mins
90.57
Assignment problem 2 on Rotate Linked List
1 mins
90.58
test
20 mins
91.1
Design a stack such that getMinium() should be O(1) time and O(1) space
22 mins
91.2
Print Next Greater Element
28 mins
91.3
Design and Implement Special Stack Data Structure. push(), pop(), getMinimum(), findMiddleElement(), deleteMiddleElement()
24 mins
91.4
Check if parenthesis are balanced or not
16 mins
91.5
Stock Span Problem
24 mins
91.6
The Celebrity Problem
26 mins
91.7
Reverse a stack using recursion
21 mins
91.8
Implement two stacks in single array
16 mins
91.9
Petrol Filling Problem
24 mins
91.10
Implement stack using Queues
15 mins
91.11
Largest Rectangle in Histogram: Problem Statement [Leetcode]
4 mins
91.12
Largest Rectangle in Histogram: Approach1 [Leetcode]
9 mins
91.13
Largest Rectangle in Histogram: Approach 1 (Python Code) [Leetcode]
9 mins
91.14
Largest Rectangle in Histogram: Approach 2 [Leetcode]
15 mins
91.15
Similar Problems
1 mins
91.16
Largest Rectangle in Histogram: Python code [Leetcode]
8 mins
91.17
Write a Program for Implement Queue using Stacks
1 mins
91.18
Trapping Rain Water
1 mins
91.19
Trapping Rain Water: Problem Statement [Leetcode]
4 mins
91.20
Trapping Rain Water: Approach 1 [Leetcode]
7 mins
91.21
Trapping Rain Water: Approach 1 (Python code)[Leetcode]
6 mins
91.22
Trapping Rain Water: Approach 2 [Leetcode]
6 mins
91.23
Trapping Rain Water: Approach 2 (Python code)[Leetcode]
5 mins
91.24
Trapping Rain Water: Approach 3 [Leetcode]
14 mins
91.25
Trapping Rain Water: Approach 3 (Python code)[Leetcode]
6 mins
91.26
Trapping Rain Water: Approach 4 [Leetcode]
11 mins
91.27
Asteroid Collision: Problem Statement [Leetcode]
5 mins
91.28
Asteroid Collision: Approach 1[Leetcode]
10 mins
91.29
Asteroid Collision: Approach 1 (Python code)[Leetcode]
6 mins
91.30
Asteroid Collision: Approach 2 and Python code[Leetcode]
10 mins
92.1
Count number of nodes in the binary tree
12 mins
92.2
Check if two trees are identical or not
9 mins
92.3
Level Order Tree Traversal
16 mins
92.4
Print Level order traversal in spiral form
37 mins
92.5
Convert a Binary Tree into its Mirror Tree
15 mins
92.6
Print Ancestors of a given node in Binary Tree
20 mins
92.7
Find Lowest Common Ancestor in a Binary Search Tree
22 mins
92.8
Children sum property in a binary tree
25 mins
92.9
Print Lowest Common Ancestor in a Binary Tree
11 mins
92.10
count leaf nodes in a binary tree
10 mins
92.11
Construct a binary tree from inorder and postorder traversals
26 mins
92.12
Convert a given tree to its Sum Tree
12 mins
92.13
Find the Maximum Depth or Height of a Tree
1 mins
92.14
Find the maximum sum leaf to root path in a Binary Tree
14 mins
92.15
Find Diameter of a Binary Tree
20 mins
92.16
Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
1 mins
92.17
Convert a given Binary Tree to Doubly Linked List
14 mins
92.18
Vertical Traversal of binary tree
14 mins
92.19
Inorder Tree Traversal without recursion and without stack (Threaded binary tree)
21 mins
92.20
Serialize and deserialize of a binay tree
23 mins
92.21
Boundary Traversal of a Binary Tree
22 mins
92.22
Merge Two binary trees [Leetcode]
16 mins
92.23
Range Sum of Binary Search Tree [Leetcode]
19 mins
92.24
Trim a BInary Search Tree (Practice Problem)
1 mins
92.25
Search in a Binary Search Tree [Leet code]
19 mins
92.26
Given two binary trees, write a function to check if they are the same or not.
15 mins
92.27
Print Right View of a Binary Tree
1 mins
92.28
Given a binary tree, find maximum value we can get by subtracting value of node B from value of node A
1 mins
92.29
Invert Binary Tree [Leetcode]
17 mins
92.30
Path In Zigzag Labelled Binary Tree
1 mins
92.31
Binary Tree Maximum Path Sum
1 mins
92.32
Given a binary tree, find its maximum depth. [Leetcode]
17 mins
92.33
Path Sum [Leetcode]
16 mins
92.34
Leaf-Similar Trees
1 mins
92.35
Find Leaves of Binary Tree
1 mins
92.36
Find largest sub tree having identical left and right subtree.
1 mins
92.37
Find the sum of all left leaves in a given binary tree. [Leetcode]
14 mins
92.38
Given two binary trees, write a function to check if they are the same or not [Leetcode]
15 mins
92.39
All Elements in Two Binary Search Trees [Leetcode]
33 mins
92.40
Maximum Binary Tree: Problem Statement [Leetcode]
5 mins
92.41
Maximum Binay Tree: Explanation: [LeetCode]
10 mins
92.42
Maximum Binay Tree: Python Code: [LeetCode]
5 mins
92.43
Binary Tree Pruning: Problem Statement [Leetcode]
4 mins
92.44
Binary Tree Pruning: Explanation: [Leetcode]
7 mins
92.45
Binary Tree Pruning: Python Code[Leetcode]
6 mins
92.46
Validate Binary Search Tree: Problem Statement [Leetcode]
5 mins
92.47
Validate Binary Search Tree: Explanation[Part1] : [Leetcode]
2 mins
92.48
Validate Binary Search Tree: Explanation[Part2] : Leetcode
10 mins
92.49
Validate Binary Search Tree: Python Code : [Leetcode]
6 mins
92.50
Validate Binary Search Tree: Iterative Approach: [Leetcode]
7 mins
92.51
Binary Tree Zigzag Level Order Traversal: Problem Statement [Leetcode]
4 mins
92.52
Binary Tree Zigzag Traversal : Explanation [Leetcode]
8 mins
92.53
Binary Tree Zigzag Traversal: Python code [Leetcode]
11 mins
92.54
Populating Next Right Pointers in Each Node: Problem Statement [Leetcode]
5 mins
92.55
Populating Next Right Pointers in Each Node: Explanation [Leetcode]
10 mins
92.56
Populating Next Right Pointers in Each Node: Python code [Leetcode]
5 mins
92.57
Binary Tree Right Side View: Problem Statement [Leetcode]
3 mins
92.58
Binary Tree Right Side View: Explanation [Leetcode]
7 mins
92.59
Binary Tree Right Side View: Python Code [Leetcode]
7 mins
92.60
Kth Smallest Element in a BST: Problem Statement [Leetcode]
5 mins
92.61
Kth Smallest Element in a BST: Approach 1 [Leetcode]
7 mins
92.62
Kth Smallest Element in a BST: Approach 1 (python code) [Leetcode]
5 mins
92.63
Kth Smallest Element in a BST: Approach 2 [Leetcode]
10 mins
92.64
Kth Smallest Element in a BST: Approach 3[Leetcode]
3 mins
94.1
Remove all duplicates from the input string.
22 mins
94.2
Reverse words in a given string
15 mins
94.3
Run Length Encoding
13 mins
94.4
Remove all adjacent duplicate characters in a string
23 mins
94.5
First Non-repeating character in a string
12 mins
94.6
Find first non-repeating character in a stream
21 mins
94.7
Find the smallest window in a string containing all characters of another string
31 mins
94.8
Print all anagrams in a list of words
14 mins
94.9
Rearrange Characters to form a palindrome
16 mins
94.10
Reorder Data In log files
15 mins
94.11
Decode Ways: Problem Statement [Leetcode]
4 mins
94.12
Decode Ways: Approach 1 [Leetcode]
11 mins
94.13
Decode Ways: Python Code [Leetcode]
6 mins
94.14
Decode Ways: Approach 2 [Leetcode]
5 mins
94.15
Write a Program for Find the first non-repeating character from a stream of characters
1 mins
94.16
Longest Common Prefix: Problem Statement [Leetcode]
3 mins
94.17
Naive Pattern Matching Algorithm
16 mins
94.18
Write a Program for Given a sequence of words, print all anagrams together
1 mins
94.19
Longest Common Prefix: Approach 1 [Leetcode]
6 mins
94.20
Longest Common Prefix: Python code [Leetcode]
8 mins
94.21
Write a Program for Recursively remove all adjacent duplicates
1 mins
94.22
Convert one string to another using minimum number of given operation
1 mins
94.23
Longest Common Prefix: Approach 2[Leetcode]
4 mins
94.24
Longest Common Prefix: Python Code[Leetcode]
6 mins
94.25
String matching: Finite Automata
1 mins
94.26
Longest Common Prefix: Approach 3[Leetcode]
7 mins
94.27
Longest Common Prefix: Python code [Leetcode]
9 mins
94.28
String matching algorithm: Boyer Moore Algorithm – Bad Character Heuristic
1 mins
94.29
String Matching: KMP Algorithm
1 mins
94.30
Longest Common Prefix: Approach 4 [Leetcode]
5 mins
94.31
Longest Common Prefix: Python code [Leetcode]
4 mins
94.32
Reorganize String: Problem Statement [Leetcode]
4 mins
94.33
Reorganize String: Approach 1 [Leetcode]
6 mins
94.34
Reorganize String: Approach 1 (Python code) [Leetcode]
7 mins
94.35
Reorganize String: Approach 2 [Leetcode]
13 mins
94.36
Reorganize String: Approach 2 (Python code) [Leetcode]
9 mins
94.37
Group Anagrams: Problem Statement [Leetcode]
3 mins
94.38
Group Anagrams: Approach1 [Leetcode]
6 mins
94.39
Group Anagrams: Approach1 (Python Code)[Leetcode]
4 mins
94.40
Group Anagrams: Approach2 [Leetcode]
6 mins
94.41
Group Anagrams: Approach2 (Python Code)[Leetcode]
4 mins
94.42
Sort Characters By Frequency
1 mins
94.43
check if strings are rotations of each other or not
1 mins
94.44
Find all distinct palindromic sub strings of a given string
1 mins
94.45
Find a excel column name from a given column number.
1 mins
94.46
Write a Program for String matching where one string contains wildcard characters
1 mins
98.1
Largest sum contiguous sub array
46 mins
98.2
Longest Palindromic sub sequence
50 mins
98.3
climbing stairs problem
16 mins
98.4
nth ugly number
38 mins
98.5
Rod cutting Problem
25 mins
98.6
Count all possible paths in a Grid
17 mins
98.7
Coin Change Problem
25 mins
98.8
Minimum Cost path Problem
19 mins
98.9
Fill a N*4 wall with 1*4 bricks problem
23 mins
98.10
Levenstein/Edit Distance Problem
29 mins
98.11
Write a Program for Program for Fibonacci numbers
1 mins
98.12
Egg dropping Problem
34 mins
98.13
Write a Program for Longest Common Subsequence
1 mins
98.14
Word Break Problem
21 mins
98.15
Longest Increasing Subsequence
20 mins
98.16
Write a Program for 0-1 Knapsack Problem
1 mins
98.17
Longest Increasing Subsequence (O(nlogn))
27 mins
98.18
Write a Program for Floyd Warshall Algorithm
1 mins
98.19
Write a Program for Bellman–Ford Algorithm
1 mins
98.20
Subset Sum Problem
20 mins
98.21
Unique Paths: Problem Statment [Leetcode]
5 mins
98.22
Write a Program for Maximum Sum Increasing Subsequence
1 mins
98.23
Unique Paths: Approach 1 [Leetcode]
9 mins
98.24
Unique Paths: Python Code[Leetcode]
3 mins
98.25
Write a Program for Longest Palindromic Substring
1 mins
98.26
Unique Paths: Approach 2 [Leetcode]
6 mins
98.27
Unique Paths: Python code[Leetcode]
4 mins
98.28
Write a Program for Longest Common Substring
1 mins
98.29
Unique Binary Search Trees: Problem Statement [Leetcode]
4 mins
98.30
You have a rectangular grid of dimension 2 x n. You need to find out the maximum sum such that no two chosen numbers are adjacent , vertically, diagonally (or) horizontally.
1 mins
98.31
Write a Program for Matrix Chain Multiplication
1 mins
98.32
Unique Binary Search Trees: Explanation [Leetcode]
17 mins
98.33
Unique Binary Search Trees: Python code [Leetcode]
6 mins
98.34
House Robber: Problem Statment [Leetcode]
6 mins
98.35
Write a Program for Optimal Binary Search Tree
1 mins
98.36
House Robber: Approach 1 [Leetcode]
13 mins
98.37
House Robber: Python code [Leetcode]
8 mins
98.38
Write a Program for Travelling Salesman Problem
1 mins
98.39
House Robber: Approach 2 [Leetcode]
9 mins
98.40
House Robber: Python code [Leetcode]
6 mins
98.41
Decode Ways
1 mins
98.42
House Robber: Approach 3 & Python code [Leetcode]
9 mins
98.43
Longest Palindromic Substring: Problem Statement [Leetcode]
3 mins
98.44
Longest Palindromic Substring: Approach 1 [Leetcode]
4 mins
98.45
Longest Palindromic Substring: Approach 2 [Leetcode]
11 mins
98.46
Longest Palindromic Substring: Approach 2(Python code) [Leetcode]
11 mins
98.47
Longest Palindromic Substring: Approach 3 [Leetcode]
9 mins
98.48
Longest Palindromic Substring: Approach 3(Python code) [Leetcode]
13 mins
98.49
Write a Program for Maximum size square sub-matrix with all 1s
1 mins
98.50
Longest Valid Parentheses
1 mins
98.51
Binary Tree Cameras
1 mins
98.52
Write a Program for Partition problem
1 mins
98.53
Write a Program for Maximum sum rectangle in a 2D matrix
1 mins
100.1
Write a Program for Check whether a given graph is Bipartite or not
23 mins
100.2
Given a directed graph G=(V,E), find whether there is path between two vertices vi and vj.
1 mins
100.3
Clone Graph: Problem Statement [Leetcode]
7 mins
100.4
Clone Graph: Explanation [Leetcode]
12 mins
100.5
Clone Graph: Python Code [Leetcode]
5 mins
100.6
Write a Program for Depth First Traversal for a Graph
1 mins
100.7
Rotting Oranges: Problem Statement [Leetcode]
5 mins
100.8
Write a Program for Clone a graph
1 mins
100.9
Rotting Oranges: Explanation [Leetcode]
13 mins
100.10
Write a Program for Breadth First Traversal for a Graph
1 mins
100.11
Rotting Oranges: Python code [Leetcode]
14 mins
100.12
Number of Islands: Problem Statment [Leetcode]
5 mins
100.13
Number of Islands: Explanation [Leetcode]
11 mins
100.14
Write a Program for Detect Cycle in a Directed Graph
1 mins
100.15
Number of Islands: Python Code [Leetcode]
9 mins
100.16
Critical Connections in a Network: Problem Statement [Leetcode]
5 mins
100.17
Write a Program for Prim’s Minimum Spanning Tree (MST))
1 mins
100.18
Critical Connections in a Network: Approach 1 [Leetcode]
6 mins
100.19
Redundant connections
1 mins
100.20
Bridges and Articulation points
4 mins
100.21
Write a Program Dijkstra’s shortest path algorithm
1 mins
100.22
Critical Connections in a Network: Approach 2 [Leetcode]
12 mins
100.23
Critical Connections in a Network: Approach 2 (Python Code)[Leetcode]
12 mins
100.24
Write a Program for Detect cycle in an undirected graph
1 mins
100.25
Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island.
1 mins
100.26
Write a Program for Topological Sorting
1 mins
100.27
Write a Program for Strongly Connected Components
1 mins
100.28
Write a Program for Articulation Points (or Cut Vertices) in a Graph
1 mins
100.29
Write a Program for Bridges in a graph
1 mins
101.1
Find Missing Number: Level [Easy]
16 mins
101.2
Single Number 11: Problem Statement [Leetcode]
4 mins
101.3
Single Number 11: Approach 1 [Leetcode]
5 mins
101.4
Single Number 11: Python code [Leetcode]
5 mins
101.5
Single Number 11: Approach 2 [Leetcode]
12 mins
101.6
Single Number 11: Python code [Leetcode]
3 mins
101.7
Number of 1 Bits: Problem Statement [Leetcode]
3 mins
101.8
Number of 1 Bits: Approach1 [Leetcode]
7 mins
101.9
Number of 1 Bits: Approach 2 [Leetcode]
8 mins
101.10
Counting Bits: Problem Statement [Leetcode]
5 mins
101.11
Counting Bits: Approach 1 [Leetcode]
8 mins
101.12
Counting Bits: Approach 2 [Leetcode]
9 mins
101.13
Counting Bits: Python code [Leetcode]
3 mins
101.14
Counting Bits: Approach 3 [Leetcode]
3 mins
101.15
Maximum Product of Word Lengths: Problem Statment [Leetcode]
5 mins
101.16
Maximum Product of Word Lengths: Approach 1 [Leetcode]
5 mins
101.17
Maximum Product of word Lengths: Python Code [Leetcode]
5 mins
101.18
Maximum Product of word lengths: Approach 2 [Leetcode]
10 mins
101.19
Maximum product of word lengths: Python Code [Leetcode]
4 mins
101.20
Total Hamming distance: Problem Statement [Leetcode]
4 mins
101.21
Total Hamming Distance: Approach 1 [Leetcode]
8 mins
101.22
Total Hamming Distance: Approach 2 [Leetcode]
7 mins
101.23
Total Hamming Distance: Python code[Leetcode]
4 mins
101.24
pow(x, n) : problem statement [Leetcode]
3 mins
101.25
pow(x, n) : Approach 1 and Python code [Leetcode]
5 mins
101.26
pow(x, n) : Approach 2 and Python code [Leetcode]
6 mins
101.27
pow(x, n) : Iterative Approach [leetcode]
4 mins

106.1
Ternary Search Tree
35 mins

117.1
INSERT
6 mins
117.2
UPDATE , DELETE
5 mins
121.1
Solved problems-1
26 mins
121.2
Solved Problems-2
13 mins
121.3
Solved Problems-3
15 mins

137.1
Partnership
13 mins
137.2
Partnership problems
33 mins
146.1
Introduction
20 mins
146.2
Circles
13 mins
146.3
Quadilaterals
18 mins
146.4
Polygons
15 mins
146.5
Combinations
9 mins
146.6
Pathways
9 mins
146.7
Example problems
22 mins
146.8
Example problems
40 mins
146.9
Example problems
4 mins
148.1
Introduction
11 mins
148.2
Solved problems
9 mins
148.3
Solved problems
10 mins
148.4
Solved problems
7 mins
Sample Test
NA
New Course
NA
Sample Test
NA
Sample test 1
NA
Mock Test -1 (Essentials of AI)
NA
Mock Test -2 (Essentials of AI)
NA
Mid Term 1 (Essentials of AI)
NA
Exercise for Plotting for EDA
NA
157.1
PART-1
12 mins
157.2
PART-2
6 mins
157.3
PART-3
4 mins
157.4
PART-4
3 mins
158.1
PART-1
5 mins
158.2
PART-2
1 mins
159.1
1
6 mins
159.2
2
17 mins
160.1
PART-1
2 mins
160.2
PART-2
6 mins
160.3
PART-3
3 mins
161.1
1
4 mins
161.2
2
8 mins
161.3
3
8 mins
161.4
4
5 mins
162.1
PART-1
3 mins
162.2
PART-2
4 mins
162.3
PART-3
1 mins
162.4
PART-4
2 mins
162.5
PART-5
4 mins
162.6
PART-6
3 mins
163.1
1
13 mins
163.2
2
1 mins
163.3
3
10 mins
164.1
Adverb Part-1
5 mins
164.2
Adverb Part-2
3 mins
164.3
Adverb Part-3
8 mins
164.4
Adverb Part-4
4 mins
165.1
PART-1
5 mins
165.2
PART-2
7 mins
165.3
PART-3
5 mins
165.4
PART-4
1 mins
165.5
PART-5
3 mins
165.6
PART-6
8 mins
165.7
PART-7
6 mins
165.8
PART-8
3 mins
165.9
PART-9
4 mins
165.10
PART-10
4 mins
166.1
1
10 mins
166.2
2
9 mins
166.3
3
10 mins
167.1
PART-1
3 mins
167.2
PART-2
4 mins
167.3
PART-3
5 mins
167.4
PART-4
3 mins
167.5
PART-5
3 mins
167.6
PART-6
3 mins
167.7
PART-7
4 mins
167.8
PART-8
4 mins
167.9
PART-9
2 mins
167.10
PART-10
3 mins
168.1
1
9 mins
168.2
2
10 mins
168.3
3
5 mins
168.4
4
8 mins
169.1
PART-1
12 mins
169.2
PART-2
16 mins
169.3
PART-3
7 mins
169.4
PART-4
7 mins
169.5
PART-5
4 mins
169.6
PART-6
5 mins
170.1
PART-1
20 mins
170.2
PART-2
10 mins
170.3
PART-3
15 mins
170.4
PART-4
13 mins
170.5
PART-5
7 mins
171.1
PART-1
54 mins
171.2
PART-2
38 mins
171.3
PART-3
12 mins
171.4
PART-4
1 mins
172.1
PART-1
5 mins
172.2
PART-2
5 mins
172.3
PART-3
6 mins
173.1
PART-1
4 mins
173.2
PART-2
4 mins
173.3
PART-3
7 mins
173.4
PART-4
4 mins
174.1
PART-1
21 mins
174.2
PART-2
3 mins
174.3
PART-3
8 mins


C -Programming:

C language Tutorial with programming approach for beginners and professionals, helps you to understand the C language tutorial easily. Our C tutorial explains each topic with programs.

The C Language is developed for creating system applications that directly interact with the hardware devices such as drivers, kernels, etc.

C programming is considered as the base for other programming languages, that is why it is known as mother language.

It can be defined by the following ways:

  1. Mother language
  2. System programming language
  3. Procedure-oriented programming language
  4. Structured programming language
  5. Mid-level programming language


Data Structure:
For many problems, the ability to formulate an efficient algorithm depends on being able to organize the data in an appropriate manner. The term data structure is used to denote a particular way of organizing data for particular types of operation. These concepts will look at numerous data structures ranging from familiar arrays and lists to more complex structures such as trees, heaps and graphs, and we will see how their choice affects the efficiency of the algorithms based upon them.

We will start by studying some key data structures, such as arrays, lists, queues, stacks and trees, and then move on to explore their use in a range of different searching and sorting algorithms. This leads on to the consideration of approaches for more efficient storage of data in hash tables. Finally, we will look at graph based representations and cover the kinds of algorithms needed to work efficiently with them. Throughout, we will investigate the computational efficiency of the algorithms we develop, and gain intuitions about the pros and cons of the various potential approaches for each task.

 

Algorithm:
An algorithm for a particular task can be defined as “a finite sequence of instructions, each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time”. As such, an algorithm must be precise enough to be understood by human beings. However, in order to be executed by a computer, we will generally need a program that is written in a rigorous formal language; and since computers are quite inflexible compared to the human mind, programs usually need to contain more details than algorithms. Here we shall ignore most of those programming details and concentrate on the design of algorithms rather than programs.
Fundamental questions about algorithms
Given an algorithm to solve a particular problem, we are naturally led to ask:

  1. What is it supposed to do?
  2. Does it really do what it is supposed to do?
  3. How efficiently does it do it?

The technical terms normally used for these three aspects are:

  1. Specification.
  2. Verification.
  3. Performance analysis
Course Features
Lectures
500+
Duration
150+ hours
Skill level
Beginner
Language
English
Assessments
yes

Cinque Terre
Applied Roots

5.1
Character Set in C
15 mins--
5.2
Keywords and Identifiers
13 mins--
5.3
Data Types
29 mins--
5.4
Variables
14 mins--
5.5
Constants
25 mins--
5.6
Input and Output
30 mins--
5.7
Formatting input and output
30 mins--
9.1
Satellite data and key
11 mins--
9.2
How it works: Card-sorting
20 mins--
9.3
Pseudo code
24 mins--
9.4
Correctness
6 mins--
9.5
In-place sorting
8 mins--
9.6
Stable sort
15 mins--
9.7
Online sorting
10 mins--
12.1
Introduction to Databases
22 mins--
12.2
Why SQL?
15 mins--
12.3
Execution of an SQL statement.
7 mins--
12.4
IMDB dataset
12 mins--
12.5
Installing MySQL
11 mins--
12.6
Load IMDB data
3 mins--
15.1
How to Use Github?
90 mins--
16.1
3. Maximum Sub Array
46 mins--
23.1
Solved Problem 1
5 mins--
23.2
Solved problem 2
4 mins--
23.3
Solved Problem 3
5 mins--

0 Reviews

OVERALL RATING

0/5.0

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

Interview Preparation Course

Category: INTERVIEW PREPARATION COURSE
₹12,000.00 ₹15,000.00
Cinque Terre
Instructor
Applied Roots

136 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