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 basic program, first part of the series, aims at opening your mind for computational thinking and takes out your fear of coding by demonstrating LIVE THINKING and coding in each video. Each Concept is presented with VISUAL EXPERIENCE. 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: Array Problems, SortedArray Problems, Rotated SortedArray Problems, LinkedList Problems, BinaryTree Problems, BST Problems, BalancedBST Problems, Sorting Problem, Selection Problem, List Applications, Stack & Queue Applications, Set & Map Applications, SortedSet & SortedMap Applications, PriorityQueue Applications
DATA STRUCTURE PATTERNS:1D-Array, List, Stack, Queue, Set, MultiSet, Map, MutliMap, SortedSet, Sorted MultiSet, SortedMap, SortedMultiMap, Heap, PriorityQueue
ALGORITHMIC PATTERNS: Adhoc Thinking, Binary Search Thinking, Divide&Prune Thinking, Recursive Thinking, Divide&Conquer Thinking, 1D Dynamic Programming Thinking
ALGORITHMIC ANALYSIS: Time & Space Complexity, Asymptotic Complexity, Asymptotic Notation(BigOh, Theta, Small o, Omega), Worst & Average Analysis, Amortized Analysis
| Smart Coding And Interview Series Curriculum | 21 Min |
| Coding Test & Interviews Vs Competitive Coding vs Project Coding | 08:11 Min |
| Top 20 Basic Program Curriculum | 08:21 Min |
| Find Missing Number || Coding Interview Problem | 17 Min | ||
| Overview of Data Structure Patterns | 09:58 Min | ||
| Overview of Storage Patterns | 18:08 Min | ||
| Overview of Algorithmic Patterns | 02:35 Min | ||
| Overview of Algorithm Analysis | 03:42 Min | ||
| Overview of Language Learning | 03:20 Min |
| Coding Environment Setup | 7:24 Min |
| Need of Algorithm Analysis | 12:44 Min | ||
| Metrics for Algorithm Analysis | 09:43 Min | ||
| Understanding Log N | 16:41 Min | ||
| Applying Metrics || Sorted Array Search | 09:42 Min | ||
| Applying Metrics || Find Missing Number | 06:18 Min | ||
| Download Code |
| Need of Asymptotic Analysis | 7 Min | ||
| Big O Notation | 17 Min | ||
| Omega, Theta, Small o Notation | 23 Min | ||
| Rate Of Growth Of Functions | 10:18 Min |
| Simple Summations | 06:10 Min | ||
| Worst, Best, Average Case Analysis | 21:47 Min |
| Overview of 1D-Array Data Structure | 7:06 Min | ||
| Discussion of Storage Mappings for Array | 07:04 Min | ||
| Truth Behind Zero Indexing | 6 Min |
| Overview of Adhoc Thinking | 04:45 Min | ||
| Rotate Array by K Elements || Coding Interview Problem | 38:59 Min | ||
| Anagram Check || Coding Interview Problem | 36:30 Min | ||
| Find Duplicates in an Array -PART 1 || Coding Interview Problem | 23 Min | ||
| Find Duplicates in an Array - PART 2 || Coding Interview Problem | 11 Min | ||
| Find Duplicates in an Array - PART 3 || Coding Interview Problem | 15 Min | ||
| Find Duplicates in an Array - PART 4 || Coding Interview Problem | 14 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min | ||
| Practice Problems |
| Overview of Binary Search Thinking | 09:10 Min | ||
| Sorted Array Search || Coding Interview Problem | 48 Min | ||
| Lower Index of an Element In a Sorted Array || Coding Interview Problem | 19 Min | ||
| Higher Index of an Element In a Sorted Array || Coding Interview Problem | 15 Min | ||
| Sorted Matrix Search || Coding Interview Problem | 43 Min | ||
| Over Flow Bug in Binary Search - PART 1 | 13 Min | ||
| Over Flow Bug in Binary Search - PART 2 | 18 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min | ||
| Practice Problems |
| Overview of Divide & Prune Thinking | 9 Min | ||
| Count Zeros Right || Coding Interview Problem | 23 Min | ||
| Count Zeros Left || Coding Interview Problem | 13 Min | ||
| Minimum In Rotated Sorted Array || Coding Interview Problem | 18 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min |
| Overview of Linear List | 7 Min | ||
| Discussion of Storage Mappings for List-I | 22 Min | ||
| Implementation of Array List / Vector | 25 Min | ||
| Discussion of Storage Mappings for List-II | 22 Min | ||
| Implementation of Doubly Linked List | 28 Min | ||
| String Tokenizer || Coding Interview Problem | 17 Min | ||
| Unique Strings || Coding Interview Problem | 15 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min |
| Overview of Stack | 10 Min | ||
| Implementation of Stack(Storage Mappings, ArrayStack and LinkedStack) | 14 Min | ||
| Symbol Balancing || Coding Interview Problem | 24 Min | ||
| Postfix Expression Evaluation || Coding Interview Problem | 20 Min | ||
| Infix to Postfix Conversion || Coding Interview Problem | 39 Min | ||
| Implementation of Calculator || Coding Interview Problem | 18 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min |
| Overview of Queue | 7 Min | ||
| Implementation of Queue(Storage Mappings and LinkedQueue) | 13 Min | ||
| Queue with Stacks || Coding Interview Problem | 29 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min |
| Overview of Set & MultiSet | 8 Min | ||
| Discussion of Storage Mappings for Set | 22 Min | ||
| Implementation of HashSet | 34 Min | ||
| Finding Common Elements || Coding Interview Problem | 37 Min | ||
| Two Sum Problem || Coding Interview Problem | 41 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min | ||
| Practice Problems |
| Overview of Map & MultiMap | 8 Min | ||
| Discussion of Storage Mappings for Map | 17 Min | ||
| Implementation of HashMap | 10 Min | ||
| Group Anagrams || Coding Interview Problem | 50 Min | ||
| Identical Arrays || Coding Interview Problem | 25 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min | ||
| Practice Problems |
| Thinking Strategies for Solving Linked List Problems | 4 Min | ||
| Reversing a Singly linked List || Coding Interview Problem | 34 Min | ||
| Kth node from End of SLL || Coding Interview Problem | 17 Min | ||
| Kth node from End of SLL with Loop || Coding Interview Problem | 4 Min | ||
| First Common Node between Two SLL || Coding Interview Problem | 38 Min | ||
| Detection of Loop in SLL || Coding Interview Problem | 42 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion | Min | ||
| Practice Problems |
| Overview of Random Integer Generator | 5 Min | ||
| Random Generator || Coding Interview Problem | 30 Min | ||
| Shuffling Problem || Coding Interview Problem | 31 Min | ||
| Download Code | |||
| Assignment |
| Overview of Recursive Thinking | 16 Min | ||
| Space Complexity of Recursive Programs | 24 Min | ||
| Computing Power(X,N) || Coding Interview Problem | 23 Min | ||
| Towers of Hanoi -PART 1 || Coding Interview Problem | 29 Min | ||
| Towers of Hanoi -PART 2 || Coding Interview Problem | 26 Min | ||
| Download Code | |||
| Assignment | |||
| Assignment Solutions & Discussion - Part 1 | Min |
| Overview of Trees | 6 Min | ||
| Overview of Binary Tree | 11 Min | ||
| Thinking Strategies for solving Binary Tree problems | 11 Min | ||
| Tree Insertion || Coding Interview Problem | 16 Min | ||
| Pretty Display of Binary Tree || Coding Interview Problem | 30 Min | ||
| Size of Binary Tree || Coding Interview Problem | 37 Min | ||
| Longest Root to Leaf Path Length || Coding Interview Problem | 50 Min | ||
| Leaf Node Sum || Coding Interview Problem | 23 Min | ||
| Left Leaf Sum || Coding Interview Problem | 19 Min | ||
| Tree Search || Coding Interview Problem | 22 Min | ||
| Average Value Per Level || Coding Interview Problem | 20 Min | ||
| Download Code | |||
| Assignment Solutions & Discussion | Min | ||
| Assignment | |||
| Practice Problems |
| Overview of Binary Search Tree | 17 Min | ||
| Thinking Strategies for Solving Binary Search Tree problems | 4 Min | ||
| Creating Balanced BST || Coding Interview Problem | 19 Min | ||
| Creating Balanced BST from Sorted Array || Coding Interview Problem | 9 Min | ||
| Searching an Element in BST || Coding Interview Problem | 11 Min | ||
| Ceil of an Element in BST || Coding Interview Problem | 15 Min | ||
| Kth Smallest Element in BST || Coding Interview Problem | 41 Min | ||
| Download Code | |||
| Assignment | |||
| Practice Problems | |||
| Assignment Solutions & Discussion | Min |
| Overview of Sorted Set | 6 Min | ||
| Discussion of Storage Mappings for Sorted Set | 22 Min | ||
| Implementation of Tree Set using BST | 17 Min | ||
| Discussion of Balanced BST | 18 Min | ||
| Implementation of Tree Set using Balanced BST | 23 Min | ||
| K Empty Slots || Coding Interview Problem | 25 Min | ||
| Download Code | |||
| Assignment |
| Overview of Sorted Map | 4 Min | ||
| Implementation of SortedMap(Storage Mappings and TreeMap) | 24 Min | ||
| Calendar Event Booking || Coding Interview Problem | 35 Min | ||
| Download Code | |||
| Assignment | |||
| Practice Problems |
| Overview of Priority Queue | 6 Min | ||
| Discussion of Storage Mappings for Priority Queue | 19 Min | ||
| Discussion of Heap | 22 Min | ||
| Implementation of Heap based Priority Queue | 21 Min | ||
| Array to Heap Conversion || Coding Interview Problem | 35 Min | ||
| Merge K Sorted Arrays - PART1 ||Coding interview problem | 25 Min | ||
| Merge K Sorted Arrays - PART2 ||Coding interview problem | 14 Min | ||
| Download Code | |||
| Assignment | |||
| Practice Problems | |||
| Assignment Solutions & Discussion | Min |
| Overview of Sorting | 4 Min | ||
| Sorting Test Utilities | 9 Min |
| Selection Sort Algorithm & Coding | 14 Min | ||
| Selection Sort Analysis (Worst, Best, Average case) & Coding | 9 Min | ||
| Bubble Sort Algorithm & Coding | 14 Min | ||
| Bubble Sort Analysis (Worst, Best, Average case) & Coding | 6 Min | ||
| Insertion Sort Algorithm & Coding | 15 Min | ||
| Insertion Sort Analysis (Worst, Best case) & Coding | 10 Min | ||
| Insertion Sort Analysis (Average Case) &Coding | 11 Min | ||
| Download Code |
| Tree Sort Algorithm & Coding | 15 Min | ||
| Tree Sort Analysis (Worst, Best, Average case) & Coding | 9 Min | ||
| Priority Queue Algorithm & Coding | 29 Min | ||
| Priority Queue Analysis (Worst, Best, Average case) & Coding | 8 Min | ||
| Download Code |
| Merge Sort Algorithm & Coding | 13 Min | ||
| Merge Sort Analysis (Worst, Best, Average case) & Coding | 28 Min | ||
| Quick Sort Algorithm & Coding | 28 Min | ||
| Quick Sort (Worst, Best case) Analysis & Coding | 12 Min | ||
| Quick Sort Average Case Analysis & Coding (Fixed Element Pivot) | 8 Min | ||
| Randomized Quick Sort Algorithm & Coding | 19 Min | ||
| Median of Three Quick sort Algorithm & Coding | 19 Min | ||
| Download Code |
| Hybrid Sort Algorithm & Comparing with Library Provided Sort | 10 Min | ||
| Download Code |
| Lower Bound on Comparison Based Algorithms | 13 Min | ||
| Radix Sort Algorithm &Coding | 42 Min | ||
| Radix Sort Analysis (Worst, Best, Average case) & Coding | 7 Min | ||
| Download Code | |||
| Assignment | |||
| Practice Problems |
| Overview of Selection Problem | 3 Min | ||
| Adhoc Approaches to Solve Selection Problem || Finding kth Smallest Problem | 17 Min | ||
| Data Structure Approaches to Solve Selection Problem|| Finding kth Smallest Problem | 30 Min | ||
| Divide and Prune Approach to Solve Selection Problem|| Finding kth Smallest Problem | 19 Min | ||
| Download Code | |||
| Assignment |
| Overview of Dynamic Programming | 6 Min | ||
| Computing nth Fibonacci Number - Part 1 | 30 Min | ||
| Computing nth Fibonacci Number - Part 2 | 29 Min | ||
| Download Code | |||
| Assignment |
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.
