Все публикации

0:14:48

Machine Learning : Overfitting and Regularization

0:42:23

Machine Learning: Polynomial Curve Fitting

0:19:30

19. Remove Nth Node From End of List || Leetcode || Medium

0:07:48

9. Palindrome Number || Leetcode || Easy

0:15:58

11. Container With Most Water || Leetcode || Medium

0:14:15

1. Two Sum || Leetcode || Easy

0:38:01

Dynamic Programming : Minimum Sum Partition || Amazon || Samsung ||Inspired by Subset Sum Problem :)

0:28:37

Dynamic Programming : Perfect Sum Problem | Count Subsets with given sum | Amazon | Microsoft |Tesco

0:20:25

Dynamic Programming: Partition Equal Subset Sum || Amazon|Microsoft|Adobe Inspired by Subset Sum :)

0:45:25

Dynamic Programming : Subset Sum Problem || Amazon || Microsoft || Inspired by 0/1 Knapsack :)

0:25:44

BST: Check for BST || Adobe || Amazon || Flipkart || Walmart || Samsung || Goldman Sachs

0:50:56

Dynamic Programming: 0/1 KnapSack ||Top Down Approach, Iterative, Explanation with Implementation.

0:45:52

Dynamic Programming: 0/1 Knapsack Recursion + Memoization Explained

0:26:10

Arrays: Smallest subarray with sum greater than x || Google || Amazon || Facebook || Accolite

0:35:48

0/1 Knapsack Problem : using Recursion OR Exhaustive Search. Recursive Code Explained.

0:30:47

Tree : Boundary Traversal of Binary tree || Amazon || Microsoft || Samsung || Snapdeal || Accolite

0:30:12

Greedy : Maximize sum after K negations

0:07:14

Greedy : Maximize sum(arr[i]*i) of an Array || Sap Labs

0:49:01

Greedy: CHOCOLA || SPOJ || Minimum cost to cut a board into squares || Explanation from Scratch

0:23:22

Greedy : Stock Buy and Sell || Google | Amazon | Microsoft | Oracle | Paytm | Flipkart

0:26:32

Greedy : Choose and Swap

0:18:11

Greedy : Swap and Maximize

0:21:01

Greedy : Smallest Number of D digits to get Sum of Digits S. || MAQ Software || Oyo Rooms

0:16:17

Bit Manipulation : Reverse Bits