Are you prepared for
GOOGLE CODING INTERVIEW?

   ENHANCE YOUR LOGIC BUILDING AND PROBLEM-SOLVING  


A personalized one-month coaching thru live classes (online chat / screen share / Whiteboard)


Online CODING INTERVIEWS Preparation


Fresh batch starts 1st of every month.

Programming Interview (also called Coding Interview) focuses on problem-solving abilities, using data structure and Algorithms and are not specific to any technology/programming language.

This 30-days online course is personalised live coaching that helps you crack the Coding Interviews of Top IT companies like Google, Amazon, Facebook, Microsoft, etc. and is designed meticulously keeping the selection pattern of such companies in mind. 

COURSE HIGHLIGHTS ?


COMPREHENSIVE COVERAGE. Covering entire syllabus and not limiting to just Data Structure and Algorithms. The candidates are expected to be good problem solver.

UIQUE TEACHING METHOD. Teaching concepts thru questions.

PERSONAL MENTORSHIP. Less than 5 students per batch enabling constructive 2-way discussions.

EXPERT TRAINER. Employee of Microsoft, Amazon, Adobe

100% ONLINE. Live classes - No Prerecorded Videos

CONTINOUS SUPPORT. Even after the course is over.

MOCK-TEST. MOCK-INTERVIEWS

SAMPLE CLASS VIDEOS

STUDENT'S FEEDBACK

Chances are that the question that you will be asked in a coding interview will be an unknown problem that you have not seen till now. This course will enhance your problem-solving abilities
Our trainers have worked in Microsoft, Adobe, Amazon and have been taking programming interviews for more than 10 years. We have designed our course keeping in mind the selection pattern of top companies. Many people from these companies are on board as mentors and take mock interviews.


WHAT YOU'LL LEARN


  • Your problem solving abilities will be enhanced like never before.
  • You will be able to approach almost all the problems. i.e you will not go blank in an interview after looking at the problem.
  • You will learn lot of templates that you can apply on different types of problems .
  • You will be able to analyse your solution in a much better way. Describing your solution to the interviewer, analysing it and talking about the scope of improvements is almost as important as solving the problem itself.
  • You will be able to test your code thoroughly before submitting it to the interviewer.

When we think about problem solving, we tend to focus on only data structure and algorithms. Problem-Solving is actually much more than that. In this course we focus on enhancing the logical capacity and application of core computer science concepts in problem solving.

COURSE CONTENTS


Basic Concepts:
    - What happens under the hood: Life cycle of a program, the memory internals, etc
    - Understanding Time and Space Complexities and how to compute them intuitively without any equation.
    - Pointers and Memory: Pointers are rampant in coding data structure and need to be well understood, not just from usage point of view, but also how they look internally.
    - Conceptualising your abstract logic as code.
Data Structure:
    - Covers all major data structures starting from Arrays, Strings, Struct, Union, Linked list, Stack, Queue, Binary Trees, Graphs, Hash table, Heap and some of the not so common DS like sparse arrays, skip list, etc. Others data structure like Class are covered in OOPs.
    - Variations of above data structures are also covered. For example, while discussing Binary Tree, we also discuss, General tree, BST, Multi-way search tree, balanced binary tree, B-Tree and Trie.
    - Multiple implementations for each data structure is covered while studying that data structure.
    - After the tutorial, a good amount of time is spent on the interview questions asked around each data structure. After studying Stack, we also discuss questions like, “Add getMinimum function to stack that returns minimum element of stack in constant time”.
    - Understanding the Data Structure from creators point of view. For example, how implementation of HashMap in Java is changed over time to improve its performance (with changing the interface).
Algorithms:
There are many problem solving tools. We cover every algorithm that is important from Coding interviews.
    - Searching: Linear search & Binary search for all the data structures like Array, Linked list, Binary tree, Graphs.
    - Sorting: Starting with the basics concepts like Stable-Unstable sorting, Comparison-Non- Comparison sorting, Divide & Conquer, in-place sorting we move to discussing every important sorting algorithm like Bubble, Selection, Insertion, Quick, Heap, Merge, Counting, Bucket and Radix along with their major variation (like Shell sort, library sort, etc.).
    - Recursion: Recursion is one the most powerful tool to problem solving even when it takes more time and memory compared to non-recursive. Problem like tower-of-hanoi or even tree traversals are very difficult to do without recursion. It is covered in great detail.
    - Dynamic Programming: some of the most difficult questions asked in Coding interviews are from DP.
    - Greedy Approach: It may not be applicable to all situations, but where it works, it give us the best solutions.
    - Divide & Conquer: Another problem solving approach that is rampant from Binary search to Quick sort.
    - Back tracking: Identifying & solving problems using back tracking.
    - String Matching: This is a separate area in itself, because of its usage. We cover major string matching algorithms like KMP, Robin karp, etc.
Puzzles & Logic Building:
Google has changed their policy of asking abstract puzzles. But companies still ask logical puzzles. In this section we focus on different types of puzzles and logical questions asked in coding interviews.
Using Bit-wise Operations in problem-solving
Logical Templates that can be used in problem solving (e.g Sliding Window, Permutations, etc.)
Introduction to Online Competitive coding platforms like HackerRank, CodeChef, etc.

HAVE MORE QUESTIONS? BOOK A DEMO CLASS.