Share Description
In this course, you will learn :
- At the top tech companies (Google, Amazon, Facebook, Apple, Microsoft, Netflix, and others), ace the coding interview.
- A step-by-step guide to common interview questions, including how to solve, optimise, and present them.
- The ultimate resource for preparing for coding, tech, and programming interviews.
- Learn exactly what you need to know to answer difficult questions, as well as the framework you need to answer ANY questions they throw at you.
- To pass coding interview questions with the best solution, use the right Data Structures and Algorithms.
- Master the fundamentals of computer science to become a better developer.
Syllabus :
- Arrays - Question #1 Google Interview Question Two Sum (Easy)
- Arrays - Questions #2 - Container With Most Water (Medium)
- Arrays - Questions #3 - Trapping Rainwater (Hard)
- Strings - Question #4 - Typed Out Strings (Easy)
- Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)
- Strings - Question #6 - Valid Palindrome & Almost Palindrome
- Introducing Linked Lists - Basics and Reverse A Linked List
- Linked List - Question #7 - M, N Reversals (Medium)
- Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)
- Linked List - Question #9 - Cycle Detection (Medium)
- Stacks - Question #10 - Valid Parentheses (Easy)
- Stacks - Question #11 - Minimum Brackets To Remove (Medium)
- Queues - Question #12 - Implement Queue With Stacks (Easy)
- Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element
- Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)
- Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)
- Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)
- Binary Trees - Question #17 - Right Side View of Tree (Medium)
- Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree
- Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)
- Heaps & Priority Queues
- Intro To 2D-Arrays - Basics & Traversal Algorithms
- 2D-Arrays - Question #20 Number Of Islands (Medium)
- 2D-Arrays - Question #21 Rotting Oranges (Medium)
- 2D-Arrays - Question #22 - Walls And Gates (Medium)
- Intro to Graphs - Representation & Traversal Algorithms
- Graphs - Question #23 - Time Needed to Inform All Employees (Medium)
- Graphs - Question #24 - Course Scheduler (Medium)
- Graphs - Question #25 - Network Time Delay (Medium)
- Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)
- Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)
- Backtracking - Question #28 - Sudoku Solver (Hard)
- Interface Design - Question #29 - Monarchy
- Tries - Question #30 - Implement Prefix Trie (Medium)
