Smart Coding & Interview Series is designed to crack top product based companies Like Google, Facebook, Microsoft, Amazon, Apple, Uber, LinkedIn, Twitter etc., and to Master Datastructures, Algorithms and Coding.
The top20 advanced program, second part of the series, aims at opening your mind for computational thinking and takes out your fear of coding by demonstrating Alorithmica's method of learning in each video. The Algorithmica's unique method of learning focus upon INTUITION/THOUGHT building, THOUGHT-to-CODE Creation and PATTERNS to master problem solving required for coding interviews & competitive programming. The curriculum and assignments are scientifically designed to give joyful journey of learning and we want to see every one of you as part of our great alumni after finishing this course. The course covers following topics in-depth.
PROBLEM DOMAINS: Mini System Design Problems, String Optimization Problems, Graph Problems, 1D-Dynamic Programming Problems, 2D-Dynamic Programming Problems, Tree Dynaic Programming Problems, Combinatorial Problems, Combinatorial Puzzles, Bitwise Problems, Pattern Matching Problems
DATA STRUCTURE PATTERNS: Trie, SuffixArray, Suffix Trie, Suffix Tree, Disjoint Set, Tournament Tree
ALGORITHMIC PATTERNS: Adhoc Thinking, Recursive Thinking, Divide&Conquer Thinking, Dynamic Programming Thinking, Greedy Thinking, BackTracking Thinking & Complete Search Thinking
ALGORITHMIC ANALYSIS: Time & Space Complexity, Asymptotic Complexity, Asymptotic Notation(BigOh, Theta, Small o, Omega), Worst & Average Analysis, Amortized Analysis
| 1.1. Traditional Method of Learning | 12 Min | ||
| 1.2. Algorithmica's Method of Learning | 8 Min | ||
| 1.3. Smart Learning Strategy for Top-20 Series | 7 Min | ||
| 1.4. Overview of Top-20 Advanced Curriculum | 7 Min |
| 1.1. Overview of Adhoc Thinking | 2 Min | ||
| 2.1. Finding Minimum and Maximum Elements - Intuition Building | 17 Min | ||
| 2.2. Finding Minimum and Maximum Elements - Coding Experience | 8 Min | ||
| 3.1. Finding Majority Element - Intuition Building | 26 Min | ||
| 3.2. Finding Majority Element - Coding Experience | 5 Min | ||
| Download Code |
| 1.1. Next Highest Permutation - Intuition Building | 14 Min | ||
| 1.2. Next Highest Permutation - Coding Experience | 9 Min | ||
| 2.1. Finding Second Smallest Element - Intuition Building | 27 Min | ||
| 2.2. Finding Second Smallest Element - Coding Experience | 14 Min | ||
| Download Code |
| 1.1. Overview of Tree Problems | 3 Min | ||
| 2.1 Serialization & Deserialization of BinaryTree (Preorder) - Intuition Building | 18 Min | ||
| 2.2 Serialization & Deserialization of BinaryTree (Preorder) - Coding Experience | 14 Min | ||
| 2.3. Serialization & Deserialization of BinaryTree (Level order) - Intuition Building | 15 Min | ||
| 2.4. Serialization & Deserialization of BinaryTree (Level order) - Coding Experience | 12 Min | ||
| 2.5. Serialization & Deserialization of BinaryTree (Inorder & Preorder)- Intuition Building | 14 Min | ||
| 2.6. Serialization & Deserialization of BinaryTree (Inorder & Preorder) - Coding Experience | 13 Min | ||
| Download Code |
| 1.1. Need of Recursive Programs to Non Recursive Programs | 8 Min | ||
| 2.1. Recursion to Non-recursion Translation (Preorder) - Intuition Building | 25 Min | ||
| 2.2. Recursion to Non-recursion Translation (Preorder) - Coding Experience | 13 Min | ||
| 3.1. Recursion to Non-recursion Translation (Inorder) - Intuition Building & Coding Experience | 7 Min | ||
| 4.1. Maximum Root to Leaf Path Sum - Intuition Building | 15 Min | ||
| 4.2. Maximum Root to Leaf Path Sum - Coding Experience | 7 Min | ||
| Download Code |
| 1.1. Overview of System Design vs Mini System Design | 5 Min |
| 1.1. Design SuperStack - Intuition Building | 28 Min | ||
| 1.2. Design SuperStack - Coding Experience | 17 Min | ||
| 2.1. Design LRU Cache - Intuition Building | 37 Min | ||
| 2.2. Design LRU Cache - Coding Experience | 31 Min | ||
| Download Code |
| 1.1. Design Mini Twitter - Intuition Building | 23 Min | ||
| 1.2. Design Mini Twitter - Coding Experience | 36 Min | ||
| 2.1. Design Mini Cassandra - Intuition Building | 28 Min | ||
| 2.2. Design Mini Cassandra - Coding Experience | 21 Min | ||
| Download Code |
| 1.1. Overview of Optimization Problems | Min |
| 1.1. Intuition of Greedy Thinking Pattern | 5 Min | ||
| 2.1. Minimum Cost File Merging - Intuition Building | 32 Min | ||
| 2.2. Minimum Cost File Merging - Coding Experience | 10 Min | ||
| 3.1. Job Scheduling with Minimum Waiting Time - Intuition Building | 17 Min | ||
| 3.2. Job Scheduling with Minimum Waiting Time - Coding Experience | 5 Min | ||
| 4.1. Maximum Number of Matchings - Intuition Building | 25 Min | ||
| 4.2. Maximum Number of Matchings - Coding Experience | 8 Min | ||
| Download Code |
| 1.1. Minimum Coin Change using Powers of 2 Denominations - Intuition Building | 16 Min | ||
| 1.2. Minimum Coin Change using Powers of 2 Denominations - Coding Experience | 10 Min | ||
| 2.1. Minimum Coin Change using Fibanocci Sequence Denominations - Intuition Building | 17 Min | ||
| 2.2. Minimum Coin Change using Fibanocci Sequence Denominations - Coding Experience | 8 Min | ||
| 3.1. Minimum Number of Candies - Intuition Building | 20 Min | ||
| 3.2. Minimum Number of Candies - Coding Experience | 11 Min | ||
| Download Code |
| 1.1. Intuition of Dynamic Programming Pattern | 7 Min | ||
| 2.1. Maximum Sum with Non-Adjacent Elements (Left to Right Recursion) - Intuition Building & Coding Experience#Part 1 | 37 Min | ||
| 2.2. Maximum Sum with Non-Adjacent Elements (Left to Right Recursion) - Intuition Building & Coding Experience#Part 2 | 21 Min | ||
| 2.3. Maximum Sum with Non-Adjacent Elements (Left to Right Recursion) - Intuition Building & Coding Experience#Part 3 | 20 Min | ||
| 2.4. Maximum Sum with Non-Adjacent Elements (Left to Right Recursion) - Intuition Building & Coding Experience#Part 4 | 16 Min | ||
| 2.5. Maximum Sum with Non-Adjacent Elements (Left to Right Recursion) - Tracing Optimal Route | 14 Min | ||
| 3.1. Maximum Sum with Non-Adjacent Elements (Right to Left Recursion) - Intuition Building & Coding Experience#Part 1 | 18 Min | ||
| 3.2. Maximum Sum with Non-Adjacent Elements (Right to Left Recursion) - Intuition Building & Coding Experience#Part 2 | 24 Min | ||
| 3.3. Maximum Sum with Non-Adjacent Elements (Right to Left Recursion) - Tracing Optimal Route | 9 Min | ||
| 4.1. Left-Right vs Right-Left Recursion Summary | 3 Min | ||
| Download Code |
| 1.1. Longest Increasing Subsequence - Intuition Building & Coding Experience#Part 1 | 60 Min | ||
| 1.2. Longest Increasing Subsequence - Intuition Building & Coding Experience#Part 2 | 21 Min | ||
| 1.3. Longest Increasing Subsequence - Intuition Building & Coding Experience#Part 3 | 17 Min | ||
| 1.4. Longest Increasing Subsequence - Intuition Building & Coding Experience#Part 4 | 16 Min | ||
| 1.5. Longest Increasing Subsequence - Greedy Intuition | 13 Min | ||
| 1.6. Longest Increasing Subsequence - Tracing Optimal Route | 12 Min | ||
| 2.1. Minimum Cost Frog Jump - Intuition Building | 37 Min | ||
| 2.2. Minimum Cost Frog Jump - Coding Experience | 11 Min | ||
| 3.1. Maximum SubArray Sum - Intuition Building#Part 1 | 20 Min | ||
| 3.2. Maximum SubArray Sum - Intuition Building#Part 2 | 26 Min | ||
| 3.3. Maximum SubArray Sum - Coding Experience | 10 Min | ||
| Download Code |
| 1.1. Overview of 2D Dynamic Programming | Min | ||
| 2.1. Maximum Coin Collection in a Grid - Intuition Building#Part 1 | 23 Min | ||
| 2.2. Maximum Coin Collection in a Grid - Intuition Building#Part 2 | 38 Min | ||
| 2.3. Maximum Coin Collection in a Grid - Coding Experience | 25 Min | ||
| 2.4. Maximum Coin Collection in a Grid - Tracing Optimal Route | 7 Min | ||
| 3.1. Integer Partitioning (Perspective I) - Intuition Building#Part 1 | 45 Min | ||
| 3.2. Integer Partitioning (Perspective I) - Coding Experience#Part 1 | 7 Min | ||
| 3.3. Integer Partitioning (Perspective I) - Intuition Building#Part 2 | 7 Min | ||
| 3.4. Integer Partitioning (Perspective I) - Coding Experience#Part 2 | 3 Min | ||
| 4.1. Integer Partitioning (Perspective II) - Intuition Building | 28 Min | ||
| Download Code |
| 1.1. Overview of Combinatorial Problems | 3 Min | ||
| 2.1. Enumeration of All Sequences - Intuition Building | 11 Min | ||
| 2.2. Enumeration of All Sequences - Coding Experience | 7 Min | ||
| 3.1. Enumeration of Permutations - Intuition Building & Coding Experience#Part 1 | 29 Min | ||
| 3.2. Enumeration of Permutations - Intuition Building & Coding Experience#Part 2 | 14 Min | ||
| Download Code |
| 1.1. Enumeration of Combinations - Intuition Building & Coding Experience#Part 1 | 20 Min | ||
| 1.2. Enumeration of Combinations - Intuition Building & Coding Experience#Part 2 | 14 Min | ||
| 1.3. Enumeration of Combinations - Intuition Building & Coding Experience#Part 3 | 13 Min | ||
| 2.1. Enumeration of Partitions - Intuition Building | 13 Min | ||
| 2.2. Enumeration of Partitions - Coding Experience | 6 Min | ||
| Download Code |
| 1.1. Minimum Coin Change (Perspective I) - Intuition Building | 36 Min | ||
| 1.2. Minimum Coin Change (Perspective I ) - Coding Experience | 10 Min | ||
| 2.1. Minimum Coin Change - Perspective II - Intuition Building | 37 Min | ||
| 2.2. Minimum Coin Change (Perspective II) - Coding Experience | 14 Min | ||
| 3.1. 0-1 Knapsack Problem - Intuition Building#Part 1 | 21 Min | ||
| 3.2. 0-1 Knapsack Problem - Coding Experience#Part 1 | 13 Min | ||
| 3.3. 0-1 Knapsack Problem - Intuition Building#Part 2 | 34 Min | ||
| 3.4. 0-1 Knapsack Problem - Coding Experience#Part 2 | 9 Min | ||
| Download Code |
| 1.1. Intuition of Complete-Search & BackTracking Patterns | 4 Min | ||
| 2.1. Enumeration of Beautiful Arrangements - Intuition Building | 15 Min | ||
| 2.2. Enumeration of Beautiful Arrangements - Coding Experience | 16 Min | ||
| 3.1. Expression with Operators ("+" & "-") - Intuition Building | 19 Min | ||
| 3.2. Expression with Operators ("+" & "-") - Coding Experience | 15 Min | ||
| Download Coode |
| 1.1. Overview of Combinatorial Puzzles | Min | ||
| 2.1. N-queens Puzzle - Intuition Building | 21 Min | ||
| 2.2. N-queens Puzzle - Coding Experience | 24 Min | ||
| 3.1. Sudoku Puzzle - Intuition Building | 18 Min | ||
| 3.2. Sudoku Puzzle - Coding Experience | 33 Min | ||
| Download Code |
| 1.1. Overview of Trie | 6 Min | ||
| 2.1. Radix Trie - Intuition Building | 34 Min | ||
| 2.2. Radix Trie - Coding Experience | 19 Min | ||
| 2.3. Radix Trie With Map - Intuition Building & Coding Experience | 9 Min | ||
| 3.1. TST Trie - Intuition Building | 18 Min | ||
| 3.2. TST Trie - Coding Experience | 32 Min | ||
| 4.1. Type Ahead System - Intuition Building | 23 Min | ||
| 4.2. Type Ahead System - Coding Experience | 19 Min | ||
| Download Code |
| 1.1. Overview of String Problems | Min | ||
| 2.1. Enumeration of All Substrings - Intuition Building | 9 Min | ||
| 2.2. Enumeration of All Substrings - Coding Experience | 9 Min | ||
| 3.1. Enumeration of All Subsequences - Intuition Building | 10 Min | ||
| 3.2. Enumeration of All Subsequences - Coding Experience | 3 Min | ||
| 4.1. Subsequence Check - Intuition Building | 9 Min | ||
| 4.2. Subsequence Check - Coding Experience | 7 Min | ||
| 5.1. Substring Check - Intuition Building | Min | ||
| 5.2. Substring Check - Coding Experience | Min | ||
| Download Code |
| 1.1. Longest Common Substring - Intuition Building & Coding Experience#Part 1 | 30 Min | ||
| 1.2. Longest Common Substring - Intuition Building & Coding Experience#Part 2 | 31 Min | ||
| 1.3. Longest Common Substring - Intuition Building & Coding Experience#Part 3 | 20 Min | ||
| 2.1. Longest Palindromic Substring - Intuition Building & Coding Experience#Part 1 | 49 Min | ||
| 2.2. Longest Palindromic Substring - Intuition Building & Coding Experience#Part 2 | 18 Min | ||
| Download Code |
| 1.1. Longest Common Subsequence - Intuition Building | 44 Min | ||
| 1.2. Longest Common Subsequence - Coding Experience | 12 Min | ||
| 2.1. Longest Palindromic Subsequence - Intuition Building | 31 Min | ||
| 2.2. Longest Palindromic Subsequence - Coding Experience | 6 Min | ||
| 2.3. Longest Palindromic Subsequence - Tracing Optimal Route | 15 Min | ||
| Edit Distance - Intuition Building | 48 Min | ||
| Edit Distance - Coding Experience | 9 Min | ||
| Edit Distance - Tracing Optimal Route | 14 Min | ||
| Download Code |
| 1.1. Huffman Encoding & Decoding - Intuition Building | 40 Min | ||
| 1.2. Huffman Encoding & Decoding - Coding Experience | 32 Min | ||
| Download Code |
| 1.1. Overview of Tree Dynamic Programming | Min | ||
| 2.1. Maximum Non-adjacent Sum in a Binary Tree - Intuition Building#Part 1 | 31 Min | ||
| 2.2. Maximum Non-adjacent Sum in a Binary Tree - Coding Experience#Part 1 | 13 Min | ||
| 2.3. Maximum Non-adjacent Sum in a Binary Tree - Intuition Building#Part 2 | 11 Min | ||
| 2.4. Maximum Non-adjacent Sum in a Binary Tree - Coding Experience#Part 2 | 6 Min |
| 1.1. Overview of Graph Problems | Min |
| 1.1. Overview of DisjointSet | Min | ||
| 2.1. Design Disjoint Set - Intuition of Storage Mappings#Part 1 | 36 Min | ||
| 2.2. Design Disjoint Set - Implementation of DisjointSet#Part 1 | 17 Min | ||
| 2.3. Design Disjoint Set - Intuition & Implementation of Disjoint Set#Part 2 | 15 Min |
| 1.1. Count Friend Circles - Intuition Building & Coding Experience#Part 1 | 43 Min | ||
| 1.2. Count Friend Circles - Intuition Building & Coding Experience#Part 2 | 16 Min | ||
| 1.3. Count Friend Circles - Intuition Building & Coding Experience#Part 3 | 9 Min | ||
| 2.1. Detect Cycle - Intuition Building & Coding Experience#Part 1 | 24 Min | ||
| 2.2. Detect Cycle - Intuition Building & Coding Experience#Part 2 | 11 Min | ||
| 2.3. Detect Cycle - Intuition Building & Coding Experience#Part 3 | 7 Min | ||
| 3.1. Bipartite or not - Intuition Building | 21 Min | ||
| 3.2. Bipartite or not ? - Coding Experience | 13 Min |
| 1.1. Count Number of Islands - Intuition Building & Coding Experience#Part 1 | 29 Min | ||
| 1.2. Count Number of Islands - Intuition Building & Coding Experience#Part 2 | 14 Min | ||
| 1.3. Count Number of Islands - Intuition Building & Coding Experience#Part 3 | 15 Min | ||
| 2.1. Check Flight Routes - Intuition Building | 13 Min | ||
| 2.2. Check Flight Routes - Coding Experience | 11 Min | ||
| 3.1. Explore All Flight Routes - Intuition Building | 15 Min | ||
| 3.2. Explore All Flight Routes - Coding Experience | Min |
| 1.1. Overview of Bitwise Thinking | Min | ||
| 2.1. Applied View of Bitwise Operators | 28 Min | ||
| 3.1. Integer Representation Internals | 13 Min | ||
| 4.1. Display Binary Representation of An Integer - Intuition Building | 10 Min | ||
| 4.2. Display Binary Representation of An Integer - Coding Experience | 8 Min | ||
| 5.1. Check an Integer is a Power of 2 or Not - Intuition Building & Coding Experience | 17 Min | ||
| Download Code |
| 1.1. Count the Number of 1s at Bitlevel - Intuition Building & Coding Experience | 17 Min | ||
| 2.1. Find Immediate Lowest Multiple of 8 - Intuition Building & Coding Experience | 17 Min | ||
| 3.1. Find Immediate Highest Multiple of 8 - Intuition Building & Coding Experience | 12 Min | ||
| 4.1. Reverse Bits of an Integer - Intuition Building | 21 Min | ||
| 4.2. Reverse Bits of an Integer - Coding Experience | 7 Min | ||
| Download Code |
ThimmaReddy is the founder of Algorithmica and holds Master Degree from IIT-Guwahati. He believes that education means training of the mind to think and solve problems with direct experience. Prior to founding Algorithmica, ThimmaReddy worked at LSI Logic, Agami Systems, Applied Discovery & some other startups as an Engineer, Architect & AI Strategist. He strongly asserts that the current education system is outdated & needs complete overhaul to upbring the people to solve the problems posed by companies & research.
To get guranteed success in any area of skill, he advocates three needed things: scienitifc curriculum, experiential learning & mentorship. At Algorithmica, he transformed thousands of students and working professionals to quality thinkers and he also created different scientifc curriculum for different pressing problems faced by students, working professionals and companies. ThimmaReddy loves to explore every aspect of computing field and is very passionate to share his experiential knowledge too.
His Alumni works in top-notch companies like Google, Mircosoft, Facebook, Amazon, Uber, WallMart Labs, LinkedIn, Twitter, etc., spread around the world. He is now acting as mentor for some startup AI companies and in parallel leading algorithmica for THE ultimate destination for quality experiential learning in whole computational field/domain.
