x
×
Interview Preparation
A free course which contains frequently asked coding questions which will help you practice for interviews in top companies.
Students, Working Professionals

Starting Soon...

Check out previous batches
Course Rating
4.7

Course Overview

Do you have a job interview on your schedule or just failed an interview which you were very confident about? You just struck the right chord. Throughout this course, you will be taught how to strategize your coding interviews for the top product-based companies.

This course will help you to concentrate on the important topics required in the interviews which will save your time and also won't let your efforts go in vain. You will be given a mock placement test to analyze where you stand and plan your further preparation. To conclude: In this competitive world, everyone has the knowledge and the skills but this course helps you to be more efficient and well planned than the rest of the pack.

What You Will Learn

 

Course Features

1- Preparation Guideline

  • Resume Building
  • Application Procedure
  • Details about the interview rounds
  • Interview Experiences

2- Practice Tracks

  • Coding Practice question
  • Logical and most asked coding questions

3- Mock test

  • 3 Programming question
  • Questions of varying difficulty
 

Course Content

  Mathematics and Programming Puzzles

  • Mathematical Algorithms
  • Number Theory
  • Programming Questions on various Puzzles
  • Various Interview Questions on Mathematics and Puzzles
 

  Arrays

  • Basic Array Operations
  • Implementation of Array Operations
  • Array Rotation Algorithms
  • Subarray of Array
  • Various Interview Questions on Arrays
 

  String

  • Basic String Operations
  • Useful String Algorithms
  • Various Interview Questions on String
 

  Searching

  • Linear Search
  • Binary Search
  • Other Different Searching Algorithms
  • Various Interview Questions on Searching
 

  Sorting

  • Sorting Algorithms (Bubble Sort, Merge Sort, QuickSort, Insertion Sort, Selection Sort)
  • Various Interview Questions on Sorting
 

  Hashing

  • Different Hashing Techniques (map, array, etc.)
  • Various Interview Questions on Hashing
 

  Matrix

  • Operations on Matrix
  • Various Interview Questions on Matrix
 

  Recursion

  • Basic Concepts of Recursion
  • Famous Recursion Problems
  • Various Interview Questions on Recursion
 

  Divide and Conquer

  • Basics questions on Divide and conquer
  • Implementing Divide and Conquer in various array problems
  • Various Interview Questions on Divide and Conquer
 

  Linked List

  • Basic Operations on Linked List
  • Operating with two linked lists
  • Various Array Operations on Linked List
  • Various Interview Questions on Linked List
 

  Doubly and Circular Linked List

  • Basic Operations on Doubly and Circular Linked List.
  • Various Array problems on Circular and Doubly Linked List
  • Various Interview Questions on Doubly and Circular Linked List
 

  Stack

  • Implementation using Arrays
  • Basic Operations
  • Various Interview Questions on Stack
 

  Queue and Dequeue

  • Implementation using Arrays
  • Basic Operations
  • Various Interview Questions on Queue
 

  Prefix Sum and Sliding Window

  • Prefix Sum Algorithm
  • Two Pointer Approach
  • Various Interview Questions on Prefix Sum and Sliding Window
 

  Bit Magic

  • Bit Manipulation Techniques
  • Bit Algorithms
  • Mathematical use of Bit Magic
  • Various Interview Questions on Bit Manipulation
 

  Tree

  • Basic Tree Operations
  • Tree Traversal
  • Modified Tree Questions
  • Tree and Linked List Combinations
  • Various Interview Questions on Trees
 

  Binary Search Tree

  • Basic Binary Search Tree Operations
  • BST Traversal
  • Predecessor and Successor Concept
  • Merging BST's
  • Various Interview Questions on BST
 

  Heap

  • Basic Operations on Heap
  • Implementing Heap using Array
  • Various Interview Questions on Heap
 

  Graph

  • Basic Operations on Graph
  • Implementation using Adjacency Matrix
  • Implementation using Adjacency List
  • Various Graph Algorithms
  • Directed and Undirected Graph
  • Various Interview Questions on Graph
 

  Greedy Algorithms

  • Basics on Greedy Technique
  • Various Greedy Algorithms
  • Various Interview Questions on Greedy Algorithm
 

  Dynamic Programming

  • Basics of Dynamic Programming
  • Overlapping Substructre
  • Recursion To DP
  • Various Interview Questions on Dynamic Programming
 

  Backtracking

  • Basics of Backtracking
  • Various Interview Questions on Backtracking
 

  Trie

  • Basic Operations on Trie
  • Various Interview Questions on Trie
 

  Miscellaneous

  • Implementing various functionalities
  • Other useful Algorithms
  • Other Famous Interview Questions
 

 

 
Show More

FAQs

  • What is the duration of the course?
    The course is conditional. No fix duration. You can go to next track (if any), when you score passing marks in current track.
     
  • What are the contents of the course?
    The course includes:
    • Complete guidelines for placement preparation
    • Practice Tracks
    • Mock placement tests
 

Course Registration

Previous Batches

Batch Date Type Register
Interview Preparation 15 December '18 to 25 May '19 Online Classes
Registration Closed