Programming interviews are like standard plays in professional sport – prepare accordingly. Don’t let Programming Interview gotchas get you down! This course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart
This course is about the Programming interviews which are different from real interviews, and has been taught by highly experienced professionals from Google and Flipkart.
The following has been covered in this course:-
- Pointers
- Memory layout of pointers and variables,
- Pointer arithmetic and Arrays,
- Pointers to pointers,
- Pointers to structures,
- Argument passing to functions,
- pointer reassignment and modification
- Character pointers & Character arrays,
- Null termination of strings,
- h function implementations with detailed explanations.
- Linked lists:
- Visualization and Traversal,
- Creating or deleting nodes,
- Sorted merge,
- Reversing a linked list
- Doubly linked lists.
- Bit Manipulation:
- Work with bits and bit operations.
- Sorting and searching 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
- Data Structures: Understand queues,
- Stacks and Heaps,
- Binary trees and graphs in detail
- Step-by-step solutions
- Palindromes,
- Game of Life,
- Sudoku Validator,
- Breaking a Document into Chunks,
- Run Length Encoding,
- Points
This course can be taken up by Computer Science students, software engineers, Folks with zero programming experience, Machine Learning and Language Processing folks.
Some exceptional benefits associated with this course enrollment are:
- Quality course material
- Instant & free course updates
- Access to all Questions & Answers initiated by other students as well
- Personalized support from the instructor’s end on any issue related to the course
- Few free lectures for a quick overview
Grab the opportunity and enroll today!
Curriculum
- 16 Sections
- 82 Lessons
- 52 Weeks
- Pointer and Arrays4
- Strings are just pointers at heart3
- Linked lists can be fun!7
- 5.1Pointers to pointers – bend your mind10 Minutes
- 5.1Pointers to pointers – reassignment and modification11 Minutes
- 5.1Get started with linked lists17 Minutes
- 5.1Warming up to – they get tricky quickly16 Minutes
- 5.1Cruising along – linked lists are fun aren’t they?18 Minutes
- 5.1Autopilot – linked lists are easy after all16 Minutes
- 5.1Do not overlook the doubly linked list10 Minutes
- Bit Manipulation6
- General programming problems - practice makes perfect4
- Big-O Notation, Sorting And Searching Algorithms 11 Lectures11
- 8.1Performance and Complexity19 Minutes
- 8.1Big O Notation16 Minutes
- 8.1Big O Notation More Examples15 Minutes
- 8.1Sorting Trade-Offs10 Minutes
- 8.1Selection Sort15 Minutes
- 8.1Bubble Sort14 Minutes
- 8.1Insertion Sort14 Minutes
- 8.1Shell Sort3415 Minutes
- 8.1Merge Sort19 Minutes
- 8.1Quick Sort15 Minutes
- 8.1Binary Search – search quickly through a sorted list3711 Minutes
- Recursion and the recursive sense9
- 9.1What is Recursion – Why is it so hard?16 Minutes
- 9.1Binary search – implemented recursively13 Minutes
- 9.1Find all subsets of a set13 Minutes
- 9.1Check whether 2 binary trees are the same14 Minutes
- 9.1Implement paint fill to color a region on screen14 Minutes
- 9.1Build A car Given Tasks And Dependencies11 Minutes
- 9.1Generate Anagrams Of A Word16 Minutes
- 9.1Help A Rat Find It’s Way Through a Maze13 Minutes
- 9.1Place 8 Queens On A Board Safely17 Minutes
- Stacks And Queues7
- 10.1Meet The Stack – Simple But Powerful15 Minutes
- 10.1Building A Stack Using Java15 Minutes
- 10.1Match Parenthesis To Check A Well Formed Expression11 Minutes
- 10.1Find The Minimum Element In A Stack In Constant Time8 Minutes
- 10.1Meet The Queue – A Familiar Sight In Everyday Life14 Minutes
- 10.1The Circular Queue – Tricky But Fast19 Minutes
- 10.1Build A Queue With Two Stacks17 Minutes
- Binary Trees4
- Binary Search Trees2
- Binary Tree Problems3
- Heaps6
- 14.1The Heap Is Just The Best Way to Implement a Priority Queue17 Minutes
- 14.1Meet The Binary Heap – It’s A Tree At Heart12 Minutes
- 14.1The Binary Heap – Logically A Tree Really An Array17 Minutes
- 14.1The Binary Heap – Making It Real With Code7 Minutes
- 14.1Heapify!19 Minutes
- 14.1Insert And Remove From A Heap16 Minutes
- Revisiting Sorting - The Heap Sort2
- Heap Problems3
- Graphs8
- 17.1Introducing The Graph15 Minutes
- 17.1Types Of Graphs7 Minutes
- 17.1The Directed And Undirected Graph14 Minutes
- 17.1Representing A Graph In Code8 Minutes
- 17.1Graph Using An Adjacency Matrix15 Minutes
- 17.1Graph Using An Adjacency List And Adjacency Set17 Minutes
- 17.1Comparison Of Graph Representations10 Minutes
- 17.1Graph Traversal – Depth First And Breadth First14 Minutes
- Graph Algorithms3
An ex-Google, Stanford and Flipkart team
Loonycorn is a team by Janani Ravi and Vitthal Srinivasan, product of Stanford University and IIM Ahmedabad.
We hold several years of working experience in the field of technology in Bay Area, New York, Singapore and Bangalore.
Janani Ravi: 7 Years of work experience (Google, Flipkart and Microsoft)
Vitthal Srinivasan: Worked at Google, Flipkart, Credit Suisse and INSEAD
We have come together to teach and educate on various technological courses in the most easiest and entertaining manner. Also, our courses will be based on practical elaborations & illustrations.
Courses you might be interested in
-
15 Lessons
-
10 Lessons
-
13 Lessons
-
39 Lessons