Course Information
Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
20 Hour(s) 11 Minute(s)
Language
English
Taught by
Loony Corn
Rating
2 views
Course Overview
A course that teaches pointers, linked lists, general programming, algorithms and recursion like no one else
Programming interviews are like standard plays in professional sport - prepare accordingly. Don't let Programming Interview gotchas get you down!
- 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.
- Bit Manipulation: Work with bits and bit operations.
- 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
- Data Structures: Understand queues, stacks, heaps, binary trees and graphs in detail along with common operations and their complexity. Includes code for every data structure along with solved interview problems based on these data structures.
- 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.
Course Content
- 10 section(s)
- 84 lecture(s)
- Section 1 Introduction
- 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
- Section 10 Binary Trees
What You’ll Learn
- Know how to approach and prepare for coding interviews
- Understand pointer concepts and memory management at a very deep and fundamental level
- Tackle a wide variety of linked list problems and know how to get started when asked linked list questions as a part of interviews
- Tackle a wide variety of general pointer and string problems and know how to answer questions on them during interviews
- Tackle a wide variety of general programming problems which involve just plain logic, no standard algorithms or data structures, these help you get the details right!
Skills covered in this course
Reviews
-
SSatish Mundru
Course is well structured and explained very well by examples and implementation. Course is more opted to junior to mid level however it helps to every one. I think it would be helpful to add more examples/explanation w.r.to real world scenarios. ~Thanks
-
SSantosh Giri Govind Marthi
Really very well laid out course for anyone who is planning to learn Data Structures. And this is a must for anyone who is preparing for interviews
-
PPrashant Joshi
This is an outstanding course, and comes in handy with respect to building your Data Structures skills. The lessons will help you understand DS from scratch and/or refresh your knowledge in case if you have prior understanding of them. The presentation style is really what makes the course outstanding. Typical flow of explanation is: 1) Explain certain topic. This is more of a elaboration of what certain topic is (say selection sort or what binary tree is etc.). The use of jargon is kept at bay so that first timers don't find it difficult to grasp. 2) Then comes pictorial explanation. With use of simple pictures and animations, the point 1 is explained again to understand it better. In fact, in most of the cases, the animations are thorough and entire algorithm is explained using animation even if it means doing some tasks which may look boring. For example, while explaining sorting, entire algorithm is explained by creating animations that go through each step of algorithm for all 10 elements of array. This really shows the dedication of Loony Corn team to create this course.
-
MMohit
Though I had taken programming classes, I wasn't comfortable with many important concepts, such as recursion, when to use what data structure and why. The practice problems of this course made me face such problems confidently.
