Course Description
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
What's Covered:
- 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
- Graphs
Talk to us!
Mail us about anything - anything! - and we will always reply :-)
Curriculum
Autopilot - linked lists are easy after all
Big O Notation
Big O Notation More Examples
Binary search - implemented recursively
Binary Search - search quickly through a sorted list
Bit Manipulation - I
Bit Manipulation - II
Breadth First Traversal
Break A Document Into Chunks
Bubble Sort
Build A car Given Tasks And Dependencies
Build A Queue With Two Stacks
Building A Stack Using Java
Check whether 2 binary trees are the same
Coding interviews are tough - but beatable
Comparison Of Graph Representations
Count Trees, Print Range and Is BST
Cruising along - linked lists are fun aren't they?
Depth First - In-Order and Post-Order Traversal
Depth First - Pre-OrderTraversal
Find all subsets of a set
Find The Median In A Stream Of Elements
Find The Minimum Element In A Stack In Constant Time
Generate Anagrams Of A Word
Get And Set The Nth Bit
Get started with linked lists
Graph Traversal - Depth First And Breadth First
Graph Using An Adjacency List And Adjacency Set
Graph Using An Adjacency Matrix
Has Path Sum, Print Paths, Least Common Ancestor
Heap Sort Phase I - Heapify
Heap Sort Phase II - The Actual Sort
Heapify!
Help A Rat Find It's Way Through a Maze
Implement paint fill to color a region on screen
Insert And Remove From A Heap
Insertion and Lookup in a Binary Search Tree
Insertion Sort
Introducing The Graph
Introduction
Introduction to pointers
Match Parenthesis To Check A Well Formed Expression
Maximum Element In A Minimum Heap and K Largest Elements In A Stream
Meet The Binary Heap - It's A Tree At Heart
Meet The Binary Tree - A Hierarchical Data Structure
Meet The Queue - A Familiar Sight In Everyday Life
Meet The Stack - Simple But Powerful
Merge K Sorted Lists Into One Sorted List Using A Heap
Merge Sort
Minimum Value, Maximum Depth And Mirror
Performance and Complexity
Place 8 Queens On A Board Safely
Play the Game Of Life
Pointer arithmetic
Pointer as arguments to functions
Pointer problems and arrays
Pointers to pointers - bend your mind
Pointers to pointers - reassignment and modification
Practice makes perfect - pointer problems
Practice makes perfect - string problems
Print And Count Bits
Quick Sort
Representing A Graph In Code
Reverse The Bits In An Integer
Run Length Encoding And Adding Numbers Digit By Digit
Section 1: Introduction
Section 10: Binary Trees
Section 11: Binary Search Trees
Section 12: Binary Tree Problems
Section 13: Heaps
Section 14: Revisiting Sorting - The Heap Sort
Section 15: Heap Problems
Section 16: Graphs
Section 2: Pointer and Arrays
Section 3: Strings are just pointers at heart
Section 4: Linked lists can be fun!
Section 5: Bit Manipulation
Section 6: General programming problems - practice makes perfect
Section 7: Big-O Notation, Sorting And Searching Algorithms
Section 8: Recursion and the recursive sense
Section 9: Stacks And Queues
Selection Sort
Shell Sort
Sorting Trade-Offs
Starting up - palindromes and points within a distance
Sudoku Board Validation and Incrementing A Number In Another Number System
The Binary Heap - Logically A Tree Really An Array
The Binary Heap - Making It Real With Code
The Binary Search Tree - an introduction
The Circular Queue - Tricky But Fast
The Directed And Undirected Graph
The Heap Is Just The Best Way to Implement a Priority Queue
Types Of Graphs
Useful Bit Manipulation Techniques
Warming up - Linked List get Tricky Quickly -1
Warming up to - Linked List get tricky Quickly -2
What is recursion - why is it so hard?
Working with strings
LINK FOR THE FREE COURSE
100% Off, Udemy 100% Off, Udemy Coupon, Udemy Coupon Code, Udemy course, Udemy course download, Udemy course reviews, Udemy courses, Udemy courses for free, Udemy courses free, Udemy courses free download, Udemy discount, Udemy download, Udemy education, Udemy free, Udemy free course, Udemy free courses, Udemy free online courses, Udemy online, Udemy online course, Udemy online courses, Udemy online courses review, Udemy reviews, Udemy tutorial, Udemy tutorials, Udemy.com free courses,
