access
lifetime
content
24 Hours
enrolled
152
Description
Getting a little stressed about a job interview is completely natural. Interviews for programming jobs are a bit different, however, and it's important to plan accordingly so you have all of your many bases covered. This immersive course was compiled by a team that has conducted hundreds of technical interviews at Google and Flipkart, and will give you not just interview tips, but an in-depth review of all the programming knowledge you'll need to ace any programming interview.- Access 83 lectures & 20.5 hours of content 24/7
- Learn how to approach & prepare for coding interviews
- Understand pointer concepts & memory management at a deep & fundamental level
- Tackle a wide variety of linked list problems & know how to answer linked list questions in interviews
- Master a variety of general programming problems that may come up in an interview
- Visualize how common sorting & searching algorithms work
- Gain step-by-step solutions to dozens of programming problems from Game of Life to Sudoku Validator & more
Instructor
Loonycorn is comprised of two individuals—Janani Ravi and Vitthal Srinivasan—who have honed their respective tech expertise at Google and Flipkart. The duo graduated from Stanford University and believes it has distilled the instruction of complicated tech concepts into funny, practical, engaging courses, and is excited to be sharing its content with eager students.Important Details
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels
Terms
- Unredeemed licenses can be returned for store credit within 30 days of purchase. Once your license is redeemed, all sales are final.
Course Outline
- Introduction
- Coding interviews are tough - but beatable (17:13)
- Pointer and Arrays
- Introduction to pointers (20:01)
- Pointer problems and arrays (13:37)
- Pointer arithmetic (11:45)
- Practice makes perfect - pointer problems (7:39)
- Strings are just pointers at heart
- Working with strings (14:09)
- Pointer as arguments to functions (9:41)
- Practice makes perfect - string problems (19:25)
- Linked lists can be fun!
- Pointers to pointers - bend your mind (10:30)
- Pointers to pointers - reassignment and modification (11:14)
- Get started with linked lists (17:18)
- Warming up to - they get tricky quickly (16:21)
- Cruising along - linked lists are fun aren't they? (19:01)
- Autopilot - linked lists are easy after all (16:33)
- Do not overlook the doubly linked list (10:03)
- Bit Manipulation
- Bit Manipulation - I (10:09)
- Bit Manipulation - II (8:41)
- Useful Bit Manipulation Techniques (13:15)
- Get And Set The Nth Bit (13:32)
- Print And Count Bits (18:56)
- Reverse The Bits In An Integer (10:12)
- General programming problems - practice makes perfect
- Starting up - palindromes and points within a distance (18:18)
- Play the Game Of Life and Break A Document Into Chunks (18:35)
- Run Length Encoding And Adding Numbers Digit By Digit (19:48)
- Sudoku Board Validation and Incrementing A Number In Another Number System (19:57)
- Big-O Notation, Sorting And Searching Algorithms
- Performance and Complexity (16:04)
- Big O Notation (15:58)
- Big O Notation More Examples (19:15)
- Sorting Trade-Offs (10:54)
- Selection Sort (15:26)
- Bubble Sort (14:44)
- Insertion Sort (14:34)
- Shell Sort (14:26)
- Merge Sort (19:25)
- Quick Sort (15:30)
- Binary Search - search quickly through a sorted list (11:36)
- Recursion and the recursive sense
- What is recursion - why is it so hard? (17:35)
- Binary search - implemented recursively (13:50)
- Find all subsets of a set (15:26)
- Check whether 2 binary trees are the same (15:35)
- Implement paint fill to color a region on screen (11:44)
- Build A car Given Tasks And Dependencies (15:09)
- Generate Anagrams Of A Word (17:19)
- Help A Rat Find It's Way Through a Maze (13:03)
- Place 8 Queens On A Board Safely (17:52)
- Stacks And Queues
- Meet The Stack - Simple But Powerful (15:42)
- Building A Stack Using Java (16:55)
- Match Parenthesis To Check A Well Formed Expression (11:23)
- Find The Minimum Element In A Stack In Constant Time (8:53)
- Meet The Queue - A Familiar Sight In Everyday Life (14:13)
- The Circular Queue - Tricky But Fast (19:46)
- Build A Queue With Two Stacks (17:32)
- Binary Trees
- Meet The Binary Tree - A Hierarchical Data Structure (13:05)
- Breadth First Traversal (18:45)
- Depth First - Pre-OrderTraversal (14:37)
- Depth First - In-Order and Post-Order Traversal (13:53)
- Binary Search Trees
- The Binary Search Tree - an introduction (9:51)
- Insertion and Lookup in a Binary Search Tree (17:02)
- Binary Tree Problems
- Minimum Value, Maximum Depth and Mirror (12:14)
- Count Trees, Print Range and Is BST (14:41)
- Has Path Sum, Print Paths, Least Common Ancestor (14:51)
- Heaps
- The Heap Is Just The Best Way to Implement a Priority Queue (17:17)
- Meet The Binary Heap - It's A Tree At Heart (12:41)
- The Binary Heap - Logically A Tree Really An Array (17:16)
- The Binary Heap - Making It Real With Code (7:40)
- Heapify! (19:35)
- Insert And Remove From A Heap (16:36)
- Revisiting Sorting - The Heap Sort
- Heap Sort Phase I - Heapify (19:33)
- Heap Sort Phase II - The Actual Sort (17:44)
- Heap Problems
- Maximum Element In A Minimum Heap and K Largest Elements In A Stream (15:56)
- Merge K Sorted Lists Into One Sorted List Using A Heap (11:42)
- Find The Median In A Stream Of Elements (16:06)
- Graphs
- Introducing The Graph (15:42)
- Types Of Graphs (7:23)
- The Directed And Undirected Graph (14:31)
- Representing A Graph In Code (8:11)
- Graph Using An Adjacency Matrix (15:27)
- Graph Using An Adjacency List And Adjacency Set (17:55)
- Comparison Of Graph Representations (10:11)
- Graph Traversal - Depth First And Breadth First (14:58)
- Graph Algorithms
- Topological Sort In A Graph (17:30)
- Implementation Of Topological Sort (6:56)
- Design A Course Schedule Considering Pre-reqs For Courses (13:01)
- Shortest Path Algorithms
- Introduction To Shortest Path In An Unweighted Graph - The Distance Table (12:38)
- The Shortest Path Algorithm Visualized (14:15)
- Implementation Of The Shortest Path In An Unweighted Graph (6:19)
- Introduction To The Weighted Graph (3:29)
- Shortest Path In A Weighted Graph - A Greedy Algorithm (18:47)
- Dijkstra's Algorithm Visualized (14:14)
- Implementation Of Dijkstra's Algorithm (8:15)
- Introduction To The Bellman Ford Algorithm (8:40)
- The Bellman Ford Algorithm Visualized (11:22)
- Dealing With Negative Cycles In The Bellman Ford Algorithm (7:36)
- Implementation Of The Bellman Ford Algorithm (6:54)
- Spanning Tree Algorithms
- Prim's Algorithm For a Minimal Spanning Tree (17:27)
- Use Cases And Implementation Of Prim's Algorithm (9:52)
- Kruskal's Algorithm For a Minimal Spanning Tree (8:43)
- Implementation Of Kruskal's Algorithm (7:33)
- Graph Problems
- Design A Course Schedule Considering Pre-reqs For Courses (13:01)
- Find The Shortest Path In A Weighted Graphs - Fewer Edges Better (14:31)
access
lifetime
content
24 Hours
enrolled
152