Hi Everyone,
Greetings from Apt4u.
This is Avinash S Anand,
I'm a Post Graduate in Mathematics and Computing from Indian Institute of Technology Patna.
As the name of the channel suggests, This channel is Apt for you to make you learn every possible concepts related to data.
I started Apt4u with an objective of making Data Structures and Algorithms simple and easy to understand which will be very helpful to the beginners in coding.
I am also working on adding videos related to other aspects of data too including Data Analytics, Data Engineering and Data Science.
The objective is clear. We'll learn all possible concepts related to data!
Because ...
Data is the new oil !
I hope the channel will be helpful to you :)
Best Wishes.
Regards.


Machine Learning : Overfitting and Regularization
14:48
Machine Learning : Overfitting and Regularization
Machine Learning: Polynomial Curve Fitting
42:23
Machine Learning: Polynomial Curve Fitting
19. Remove Nth Node From End of List || Leetcode || Medium
19:30
19. Remove Nth Node From End of List || Leetcode || Medium
9. Palindrome Number || Leetcode || Easy
7:48
9. Palindrome Number || Leetcode || Easy
11. Container With Most Water || Leetcode || Medium
15:58
11. Container With Most Water || Leetcode || Medium
1. Two Sum || Leetcode || Easy
14:15
1. Two Sum || Leetcode || Easy
Dynamic Programming : Minimum Sum Partition || Amazon || Samsung ||Inspired by Subset Sum Problem :)
38:01
Dynamic Programming : Minimum Sum Partition || Amazon || Samsung ||Inspired by Subset Sum Problem :)
Dynamic Programming : Perfect Sum Problem | Count Subsets with given sum | Amazon | Microsoft |Tesco
28:37
Dynamic Programming : Perfect Sum Problem | Count Subsets with given sum | Amazon | Microsoft |Tesco
Dynamic Programming: Partition Equal Subset Sum || Amazon|Microsoft|Adobe Inspired by Subset Sum :)
20:25
Dynamic Programming: Partition Equal Subset Sum || Amazon|Microsoft|Adobe Inspired by Subset Sum :)
Dynamic Programming : Subset Sum Problem || Amazon || Microsoft || Inspired by 0/1 Knapsack :)
45:25
Dynamic Programming : Subset Sum Problem || Amazon || Microsoft || Inspired by 0/1 Knapsack :)
BST: Check for BST || Adobe || Amazon || Flipkart || Walmart || Samsung || Goldman Sachs
25:44
BST: Check for BST || Adobe || Amazon || Flipkart || Walmart || Samsung || Goldman Sachs
Dynamic Programming: 0/1 KnapSack ||Top Down Approach, Iterative, Explanation with Implementation.
50:56
Dynamic Programming: 0/1 KnapSack ||Top Down Approach, Iterative, Explanation with Implementation.
Dynamic Programming: 0/1 Knapsack Recursion + Memoization Explained
45:52
Dynamic Programming: 0/1 Knapsack Recursion + Memoization Explained
Arrays: Smallest subarray with sum greater than x || Google || Amazon || Facebook || Accolite
26:10
Arrays: Smallest subarray with sum greater than x || Google || Amazon || Facebook || Accolite
0/1 Knapsack Problem : using Recursion OR Exhaustive Search. Recursive Code Explained.
35:48
0/1 Knapsack Problem : using Recursion OR Exhaustive Search. Recursive Code Explained.
Tree : Boundary Traversal of Binary tree || Amazon || Microsoft || Samsung || Snapdeal || Accolite
30:47
Tree : Boundary Traversal of Binary tree || Amazon || Microsoft || Samsung || Snapdeal || Accolite
Greedy : Maximize sum after K negations
30:12
Greedy : Maximize sum after K negations
Greedy : Maximize sum(arr[i]*i) of an Array || Sap Labs
7:14
Greedy : Maximize sum(arr[i]*i) of an Array || Sap Labs
Greedy: CHOCOLA || SPOJ || Minimum cost to cut a board into squares || Explanation from Scratch
49:01
Greedy: CHOCOLA || SPOJ || Minimum cost to cut a board into squares || Explanation from Scratch
Greedy : Stock Buy and Sell || Google | Amazon | Microsoft | Oracle | Paytm | Flipkart
23:22
Greedy : Stock Buy and Sell || Google | Amazon | Microsoft | Oracle | Paytm | Flipkart
Greedy : Choose and Swap
26:32
Greedy : Choose and Swap
Greedy : Swap and Maximize
18:11
Greedy : Swap and Maximize
Greedy : Smallest Number of D digits to get Sum of Digits S. || MAQ Software || Oyo Rooms
21:01
Greedy : Smallest Number of D digits to get Sum of Digits S. || MAQ Software || Oyo Rooms
Bit Manipulation : Reverse Bits
16:17
Bit Manipulation : Reverse Bits
Bit Manipulation: Check whether number is a Power of 2 or not
7:28
Bit Manipulation: Check whether number is a Power of 2 or not
Bit Manipulation : Isolating Rightmost Zero Bit
6:14
Bit Manipulation : Isolating Rightmost Zero Bit
Bit Manipulation : Isolating Rightmost One bit
4:06
Bit Manipulation : Isolating Rightmost One bit
Tree: Sum Tree || Amazon || Microsoft || Adobe || Goldman Sachs || D-E-Shaw
18:54
Tree: Sum Tree || Amazon || Microsoft || Adobe || Goldman Sachs || D-E-Shaw
Tree : Check for Balanced Tree || Amazon || Walmart || Microsoft || LeetCode : 110
22:16
Tree : Check for Balanced Tree || Amazon || Walmart || Microsoft || LeetCode : 110
Heap : Merge two binary Max heaps in O(n) time.
27:19
Heap : Merge two binary Max heaps in O(n) time.