Programming interviews are like standard plays in professional sport - prepare accordingly. Don't let Programming Interview gotchas get you down!
- The course instruction is in Hindi
- Programming interviews differ from real programming jobs in several important aspects, so they merit being treated differently, just like set pieces in sport.
- Just like teams prepare for their opponent's playbooks in professional sport, it makes sense for you to approach programming interviews anticipating the interviewer's playbook
- This course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart
- Pointers: Memory layout of pointers and variables, pointer arithmetic, arrays, pointers to pointers, pointers to structures, argument passing to functions, pointer reassignment and modification - complete with visuals to help you conceptualize how things work.
- Strings: Strings, Character pointers, character arrays, null termination of strings, string.h function implementations with detailed explanations.
- Linked lists: Visualization, traversal, creating or deleting nodes, sorted merge, reversing a linked list and many many problems and solutions, doubly linked lists.
- Sorting and searching algorithms: Visualize how common sorting and searching algorithms work and the speed and efficiency of those algorithms
- Recursion: Master recursion with lots of practice! 8 common and uncommon recursive problems explained. Binary search, finding all subsets of a subset, finding all anagrams of a word, the infamous 8 Queens problem, executing dependent tasks, finding a path through a maze, implementing PaintFill, comparing two binary trees
- Step-by-step solutions to dozens of common programming problems: Palindromes, Game of Life, Sudoku Validator, Breaking a Document into Chunks, Run Length Encoding, Points within a distance are some of the problems solved and explained.
- Trees and Binary Search Trees
- Heaps and Binary Heaps
Using discussion forums
Please use the discussion forums on this course to engage with other students and to help each other out. Unfortunately, much as we would like to, it is not possible for us at Loonycorn to respond to individual questions from students:-(
We're super small and self-funded with only 2-3 people developing technical video content. Our mission is to make high-quality courses available at super low prices.
The only way to keep our prices this low is to *NOT offer additional technical support over email or in-person*. The truth is, direct support is hugely expensive and just does not scale.
We understand that this is not ideal and that a lot of students might benefit from this additional support. Hiring resources for additional support would make our offering much more expensive, thus defeating our original purpose.
It is a hard trade-off.
Thank you for your patience and understanding!
Who is the target audience?
- YEP! New engineering graduate students who are interviewing for software engineering jobs
- YEP! Professionals from other fields with some programming knowledge looking to change to a software role
- YEP! Software professionals with several years of experience who want to brush up on core concepts
- NOPE! Other technology related professionals who are looking for a high level overview of pointer concepts.
- This course requires some basic understanding of a programming language, preferably C. Some solutions are in Java, though Java is not a requirement
Pointer and Arrays
Introduction to pointers 00:20:00
Pointer problems and arrays 00:16:30
Practice makes perfect - pointer problems
Strings are just pointers at heart
Working with strings 00:17:46
Pointer as arguments to functions
Practice makes perfect - string problems
Linked lists can be fun!
Pointers to pointers - bend your mind 00:12:04
Pointers to pointers - reassignment and modification 00:13:04
Get started with linked lists 00:16:54
Warming up - Linked List get Tricky Quickly -1
Warming up to - Linked List get tricky Quickly -2 00:20:01
Cruising along - linked lists are fun aren't they?
Autopilot - linked lists are easy after all
Bit Manipulation - I 00:10:47
Bit Manipulation - II 00:09:33
Useful Bit Manipulation Techniques
Get And Set The Nth Bit
Print And Count Bits 00:19:47
Reverse The Bits In An Integer 00:11:21
General programming problems - practice makes perfect4
Starting up - palindromes and points within a distance 00:19:27
Play the Game Of Life 00:11:09
Break A Document Into Chunks 00:10:49
Run Length Encoding And Adding Numbers Digit By Digit 00:20:00
Sudoku Board Validation and Incrementing A Number In Another Number System
Big-O Notation, Sorting And Searching Algorithms
Performance and Complexity 00:15:56
Big O Notation More Examples 00:08:16
Sorting Trade-Offs 00:10:05
Binary Search - search quickly through a sorted list 00:12:00
Recursion and the recursive sense
What is recursion - why is it so hard? 00:17:50
Binary search - implemented recursively 00:14:24
Find all subsets of a set 00:16:43
Check whether 2 binary trees are the same
Implement paint fill to color a region on screen 00:13:42
Build A car Given Tasks And Dependencies
Generate Anagrams Of A Word 00:16:18
Help A Rat Find It's Way Through a Maze
Place 8 Queens On A Board Safely 00:19:48
Stacks And Queues
Meet The Stack - Simple But Powerful 00:15:36
Building A Stack Using Java 00:16:35
Match Parenthesis To Check A Well Formed Expression 00:11:19
Find The Minimum Element In A Stack In Constant Time 00:08:47
Meet The Queue - A Familiar Sight In Everyday Life 00:13:16
The Circular Queue - Tricky But Fast 00:19:59
Build A Queue With Two Stacks 00:17:36
Meet The Binary Tree - A Hierarchical Data Structure 00:13:28
Breadth First Traversal 00:17:23
Depth First - Pre-OrderTraversal
Depth First - In-Order and Post-Order Traversal
Binary Search Trees
The Binary Search Tree - an introduction
Insertion and Lookup in a Binary Search Tree 00:18:46
Binary Tree Problems
Minimum Value, Maximum Depth And Mirror
Count Trees, Print Range and Is BST 00:15:28
Has Path Sum, Print Paths, Least Common Ancestor
The Heap Is Just The Best Way to Implement a Priority Queue 00:15:55
Meet The Binary Heap - It's A Tree At Heart
The Binary Heap - Logically A Tree Really An Array 00:18:02
The Binary Heap - Making It Real With Code
Insert And Remove From A Heap 00:15:14
Revisiting Sorting - The Heap Sort