Data Structures And Algorithms Course | Interview Questions

course features

Prerequisite
• Should have basic knowledge of Java/Python/C++ Programming
• All Concepts Explains From Very Basic to
Who Should Subscribe For this Course
• Working professionals preparing for interviews of Big-5(Google,Amazon Microsoft,Facebook,Apple) and Top Product Based organization
• B.Tech/MCA/MS Students looking for data structures,Algorithms & System Design training
• Candidates preparing for competitive programming
• Job seekers who are preparing for interview in Product MNC/ecommerce companies
• Anyone who has deep desire to learn data structures,algorithms and system design to improve programming/coding skills and designing skills
Cracking the Technical Interview For Freshers
Cracking the Placement Interview
Road Map To A High Package Job
Course Content 242 lectures56:16:7

Course Information 05:26

This course explains all the deep concepts of Data structure and Algorithms with the help of problems. These problems are frequently asked during interviews. System Design problems also explains with all core components of distributed system

Practice Session

Interview Tips 05:58

In this lecture, we share tips and tricks to crack the interview and course preparation guidance

Practice Session

Understanding Space and Time Complexity of Algorithms by Using Big O Notation 14:37

Understanding the space and time complexity by using Big O language is recommended. From space and time complexity we can measure the complexity of an Algorithms

Practice Session

Searching Algorithms Introduction & Implementation 16:18

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored. Binary Search is most widely used search algorithm when array is sorted

Code: Analyze in:

Practice Session

Sorting Algorithms in Data Structure 08:50

Sorting Algorithms are methods of reorganizing a large number of items into some specific order such as highest to lowest, or vice-versa, or even in some alphabetical order. There are lots of sorting algorithms available in data structure and algorithms through which complexity can be optimized

Practice Session

Implementation Of Sorting Algorithms 23:9

This Lecture we will discuss the implementation of the sorting Algorithms, We required these sorting algorithms during solving multiple problems throughout this course

Code: Analyze in:

Practice Session

Maximum Value in an array of Increasing and Decreasing using Binary Search Assignment13:30

One array of integers is given as an input ,which is initially increasing and then decreasing or it can be only increasing or decreasing , you need to find the maximum value in the array in O(Log n) Time complexity and O(1) Space Complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Binary Search Asked in : Linkedin Goldman Sachs
[Lecture] Assignment Discussion 13:46

Code:

Segregation logic to Sort an array of 0's, 1's and 2's  Assignment12:27

Array consist of only 0's, 1's and 2's. Write an algorithm to sort  this array in O(n) time complexity and O(1) Space complexity with only one traversal

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Segregation logic Asked in : Microsoft Amazon
[Lecture] Assignment Discussion 10:19

Code:

Linear time approach to solve jump game problem Assignment08:41

You have an array of non-negative integers,you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are able to reach the last index in O(n) Time complexity and O(1) Space Complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Jump Game Problem Asked in : Microsoft Amazon
[Lecture] Assignment Discussion 08:56

Code:

Digit rearrangement method to find next greater number with same set of digits Assignment12:23

Write an algorithm to find out next greater number to given number with the same set of digits

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Digit rearrangement method Asked in : Amazon Akamai J P Morgan
[Lecture] Assignment Discussion 10:36

Code:

Rectangle Overlap problem Assignment11:16

Rectangle that is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinates of its top-left corner, and (x2, y2) is the coordinates of its bottam-right corner. Now two rectangles overlap if the area of their intersection is positive.Two rectangles that only touch at the corner or edges do not overlap.Check in O(1) Time complexity and O(1) Space complexity that both rectangle overlap or not

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Array Manipulation in Triangle Asked in : Microsoft Facebook
[Lecture] Assignment Discussion 07:47

Code:

Greedy Techniques to find minimum number of platforms Assignment11:4

List of arrival and departure time is given, Find the minimum number of platforms are required for the railway as no train waits

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Greedy Techniques Asked in : Flipkart Amazon Microsoft
[Lecture] Assignment Discussion 15:3

Code:

Techniques to print matrix in spiral order without any extra space Assignment12:31

you are given a matrix of m x n elements (m rows, n columns), Print all elements of the matrix in spiral order in O(m*n) Time Complexity and O(1) Space Complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Matrix Manipulation Asked in : Facebook Citrix Flipkart
[Lecture] Assignment Discussion 09:30

Code:

Count frequencies of array elements in O(n) time complexity Assignment18:5

Array of length n having integers 1 to n with some elements being repeated. Count frequencies of all elements from 1 to n in Time Complexity O(n) and Space Complexity O(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of counting sort Asked in : Yahoo Linkedin
[Lecture] Assignment Discussion 16:30

Code:

Linear time approach to solve Stock Buy Sell Problem Assignment15:14

An array is given as Input where ith element is the price of a given stock on day You were permitted to complete unlimited transaction. Derive an algorithm to find the maximum profit in O(n) Time complexity and O(n) Space Complexity

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 05:36

Code:

In-place techniques matrix rotation method by 90 degree Assignment12:20

You are given a square matrix, You need to rotate the matrix in a clockwise direction by 90 degrees in Time Complexity O(m*n) and No Extra Space i.e O(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Binary Search In Matrix Asked in : Cisco Vmware Amazon
[Lecture] Assignment Discussion 06:3

Code:

Array puzzle of solving celebrity problem Assignment08:59

You are in a party of N people, where only one person is known to everyone. Such a person may be present at the party, if yes, (s)he doesn’t know anyone at the party. Your task is to find the celebrity at the party in Time Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Array Manupulation Asked in : Yahoo Expedia MMT
[Lecture] Assignment Discussion 18:45

Code:

Lexicographical order method to solve next smallest palindrome Assignment17:30

Find next smallest palindrome larger than this given number

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Array Manipulation Asked in : Samsung Adobe
[Lecture] Assignment Discussion 10:49

Code:

QuickSelect Algorithm to find the Kth smallest Element in array - 1 Assignment10:47

Find kth smallest element in that in an unsorted integer array in Time Complexity O(n) and Space Complexity O(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Quick Select Method Asked in : Uber Facebook WalmartLabs
[Lecture] Assignment Discussion 11:58

Code:

QuickSelect Algorithm to find the Kth smallest Element in array - 2 13:48

Continuation of Kth smallest Element

Practice Session

Xor method to find the element that occurs one Assignment04:8

Given an array where every element occurs two times, except one element which occurs only once. Find the element that occurs once. Expected time complexity is O(n) and O(1) extra space

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Xor Method Asked in : Google OLA
[Lecture] Assignment Discussion 08:24

Code:

Binary search method to find square root of an element Assignment05:35

Find square root of Guven Num without sqrt() function in Time Complexity O(Logn) and No Space Complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Binary Search Asked in : Sap Labs IBM ISL Mcafee
[Lecture] Assignment Discussion 08:20

Code:

Trapping Rain Water Efficiently Assignment09:52

N non-negative integers representing an elevation map where the width of each bar is 1. Write an algorithm to find how much water it is able to trap after raining in Time Complexity O(n) and Space Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Rain Water Problem Asked in : Google Amazon Microsoft
[Lecture] Assignment Discussion 17:13

Code:

Merge sort method to Count inversion in an array 12:26

Given an unsorted Array, Find the count of Inversion required to make this array sorted in Time Complexity:O(nlogn) and Space Complexity: O(n)

Code: Analyze in:

Practice Session

Binary search method to find Median of two sorted Array Assignment20:19

There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log n)) and Space Complexity O(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Median in an Array Asked in : Google Microsoft
[Lecture] Assignment Discussion 08:17

Code:

Design a data Structure which support Insert delete, Random in O(1) time Assignment19:13

Design a data structure which performs the following operations(Insert an element/Remove an element /find random element) in O(1) time complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Array operation in O(1) Time Asked in : Intuit WalmartLabs
[Lecture] Assignment Discussion 17:15

Code:

Minimum Window Substring - 1 Assignment15:39

Given two strings string1 and string2 , return the minimum window in string1 which will contain all the characters in string2 in Time Complexity O(n) and Space Complexity O(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Minimum window string Asked in : Cisco Intuit
[Lecture] Assignment Discussion 01:37

Minimum Window Substring - 2 14:25

Continuation of Smallest window in a string

Practice Session

- -MORE- -

Binary tree Introduction with Implementation 12:31

This is Introduction Lecture of BT. We Explain all the concept of Binary Tree with code.

Practice Session

Binary Tree Traversal Implementation Assignment06:56

Traversal scheme is core Concept of BT. Almost all the problems of Binary tree involves the complete understanding of traversal process.

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Traversal of Tree Asked in : Uber Akamai Amazon
[Lecture] Assignment Discussion 05:46

Code:

Check if two N-ary trees are Mirror image or not Assignment16:21

Two n-ary trees given , Check if they are mirror of each other or not In Time and Space Complexity O(n)

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 04:6

Code:

Connect Nodes at Same level in a Binary Tree Assignment11:58

Algorithm to Connect all the nodes in same level of a binary tree in Constant Space and O(n) Time Compelxity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Nodes Connected at Same Level Asked in : Intuit Amazon WalmartLabs
[Lecture] Assignment Discussion 07:3

Code:

Binary Tree to Doubly Linked List Conversion Assignment13:11

Convert BT to DLL such that the left pointer of the node should be pointing to the previous node in the doubly linked list, and the right pointer should be pointing to the next node in the doubly linked list in Time Complexity O(n) and Space O(Height)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of BT to DLL Asked in : Cisco Intuit
[Lecture] Assignment Discussion 03:15

Code:

Print nodes at k distance from root Assignment06:35

Print all the nodes which are at k distance from the root. Root of the Binary tree and K is given as Input in Time Complexity O(n)

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 12:54

Code:

Find All Nodes Distance K in Binary Tree Assignment17:15

This is a bit complex problem from previous problem. Now you need print all the nodes k distance from any random node in the tree in Time Complexity O(n) and Space Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Distance Node Asked in : Google Amazon
[Lecture] Assignment Discussion 10:55

Code:

Print all the boundary nodes of Binary Tree Assignment11:8

Print all the boundary nodes in the binary tree.Boundary includes left boundary, leaves, and right boundary in anti clockwise direction in O(n) Time Complexity

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Traversal of Tree Asked in : Amazon Microsoft Vmware
[Lecture] Assignment Discussion 06:59

Code:

Bottom View of Binary Tree Assignment16:50

Given a binary tree, print the values of nodes which would be present in bottom of view of binary tree

Code: Analyze in:

Practice Session
Assignment Based on similar concept of View of Tree Asked in : Intuit Thoughtworks Aricent
[Lecture] Assignment Discussion 08:50

Code:

Construct Tree from PostOrder Assignment18:24

We have the inorder and postorder traversal sequence of a binary tree to generate the Binary tree

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Construction of Tree Asked in : Broadcom Qualcomm
[Lecture] Assignment Discussion 04:6

Code:

Diameter of Binary tree Assignment12:49

The diameter of a binary tree is the length of the longest path between any two nodes in a tree. Find diameter of tree in Time Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Finding Diameter Asked in : Adobe J P Morgan
[Lecture] Assignment Discussion 16:56

Code:

Print Left View of Binary Tree Assignment08:46

Printing the left view of a binary tree involves printing the left-most node, at each level, in the binary tree In Time Complexity O(n) and Space Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Binary Tree View Asked in : Oracle Citrix
[Lecture] Assignment Discussion 06:53

Code:

Binary Tree Reverse Level Order Traversal Assignment06:5

Algorithm to print Binary Tree nodes level by level in reverse order. It means all the nodes at the last level should be printed first followed by the nodes of second last level and so on in Time Complexity O(n) and Space Complexity O(n) and

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Reverse Level Order Asked in : Flipkart Verizon
[Lecture] Assignment Discussion 07:2

Code:

Vertical sum of Binary Tree Assignment12:11

Binary tree is given and you need find vertical sum of the nodes that are in same vertical line in Time and Space Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Binary Tree Traversal Asked in : Microsoft Swiggy
[Lecture] Assignment Discussion 02:36

Code:

Spiral Order of Binary Tree Assignment13:29

Given a binary tree, print its nodes level by level in spiral order in Time and Space Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Spiral Traversal Tree Asked in : Microsoft Facebook Amazon
[Lecture] Assignment Discussion 10:49

Code:

Serialize and Deserialize Binary Tree 18:0

Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back from the file to reconstruct the exact same binary tree is 'deserialization' in Time and Space Complexity O(n)
Asked in : MicrosoftQualcommJ P morganSandisk

Code:

Practice Session

Maximum Path Sum in a Binary Tree Assignment18:29

Given a non-empty binary tree, find the maximum path sum in Time Complexity O(n)

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 15:58

Code:

- -MORE- -

Linked List Introduction & Implementation 08:21

A linked list is a linear data structure where each element is a separate object. Two types of linked List mostly asked during interview Single Linked List and Doubly Linked List

Practice Session

Linked List Operations: Traverse, Insert and Delete 12:44

In this lecture you will learn different operations on a linked list. Also, you will find implementation of linked list operations.

Practice Session

Doubly Linked List Implementation covered in this lecture. Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list

Code:

Practice Session

Linked list is given also, in addition to the next reference, each node has a child pointer that can point to a separate list. With the head node, flatten the list to a single-level linked list in Time Complexity O(n)

Code: Analyze in:

Practice Session
Assignment Discussion Lecture 10:55

Code:

Merge two Sorted Linked List Assignment11:1

Given two sorted linked lists, merge them so that the resulting linked list is also sorted in Time Complexity O(n) and Space Complexity(1)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Linked-List Merge Operation Asked in : Cisco SapLabs
Assignment Discussion Lecture 12:57

Code:

Sort Linked List using Merge Sort Assignment17:31

You are given a linked list as input , you need to sort it using merge sort algorithm using merge sort in Time Complexity O(nLogn)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Linked-List Merge Sort Asked in : Flipkart Amazon
[Lecture] Assignment Discussion 18:44

Code:

You are given a double Link List with one reference of each node pointing to the next node just like in a single link list. The second reference however can point to any node in the list and not just the previous node.Write a program in O(n) time which will create a copy of this list
Asked in : MyntraExpdiaMicrosoftJ P Morgan

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 05:58

Code:

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list in Time Complexity O(n) .

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Reverse K LinkedList Asked in : Amazon.Flipkart WalmartLabs Ariba
[Lecture] Assignment Discussion 05:44

Code:

Rearrange a Single Linked List in Time Complexity O(n) and Space Complexity O(1) such one node selected from start next node from end

Code: Analyze in:

Practice Session

- -MORE- -

Min/Max Heap Implementation 06:50

Min/Max Heap Implementation

Analyze in:

Practice Session

Heapify operation implementation 09:13

Basic Introduction lecture of heap and heap operations

Code: Analyze in:

Practice Session

Minimum Window Substring 30:3

Given two strings string1 and string2, the task is to find the smallest substring in string1 containing all characters of string2

Code: Analyze in:

Practice Session

Group Anagrams Together 11:34

Given an array of strings, return all groups of strings that are anagrams

Code: Analyze in:

Practice Session

Find first non-repeating character from a stream of characters 13:48

Given a stream of characters, find the first non-repeating character from stream. You need to tell the first non-repeating character in O(1) time at any moment

Code: Analyze in:

Practice Session

Design and implement LRU 21:12

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get(key)and set(key,value)

Code:

Practice Session

Four Sum Problem 13:25

Given an array  of n integers and an integer target, Find if there elements a, b, c, and d in integers present in array  such that a + b + c + d = target. Find unique quadruplets in the array which gives the sum of target

Code: Analyze in:

Practice Session

Convert Number to Words Problems 14:45

Write an efficient algorithm to convert a given number into words.

Code: Analyze in:

Practice Session

Median of running data streams problem 20:11

Given that integers are being read from a data stream. Find median of all the elements read so far starting from the first integer till the last integer. The data stream can be any source of data, example: a file, an array of integers etc

Code: Analyze in:

Practice Session

Merge k Sorted arrays 09:11

Given k sorted array, write an efficient algorithm to merge them into one sorted array

Code: Analyze in:

Practice Session

Relative Sorting 22:11

Given two integer array, Sort first array based on the Order of second array in Time and Space Complexity O(n)

Code: Analyze in:

Practice Session

- -MORE- -

Recursion & Backtracking Concept and Implementation with Multiple Example 15:24

This is probably the most important lecture of this course. Without Complete understanding of recursion Algorithms can be imagine. Binary Tree , DP, Graph , backtracking and many topics root is Recursion

Practice Session

Sudoku Solving Problem - 1 Assignment12:20

Given a sudoko puzzle, solve this sudoko puzzle by using backtracking algorithm

Code:

Practice Session
Assignment Based on similar concept of application of recursion Asked in : Amazon.Google Uber
[Lecture] Assignment Discussion 13:12

Code:

Rat Maze Problem Assignment20:35

Given a maze, NxN matrix.matrix[0][0] (left top corner)is the source and matrix[N-1][N-1](right bottom corner) is destination. There are few cells which are blocked, means rat cannot enter into those cells. Rat can move in direction ( forward,down). A rat has to find a path from source to destination

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Matrix Recursion Asked in : Microsoft WalmartLabs
[Lecture] Assignment Discussion 16:1

Code:

Sudoku solving Problem - 2 10:14

[part-2] Given a sudoku puzzle, solve this sudoko puzzle by using backtracking algorithm

Practice Session

Print all Permutations of a given String Assignment13:12

You are given a string and you are supposed to print all the distinct permutations of the string

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Permutation of String Asked in : Yahoo Morgan Stanley
[Lecture] Assignment Discussion 15:39

Code:

Knight Walk Problem 13:30

Given a square chessboard of N x N size, the position of Knight and position of a target is given. We need to find out minimum steps a Knight will take to reach the target position

Code: Analyze in:

Practice Session

Implement pow(x, n) 07:14

Given an integer x and a positive number n, write a efficient algorithm to computes x^n

Code: Analyze in:

Practice Session

N Queen Problem Assignment13:27

find an arrangement of N queens on a chess board, such that no queen can attack any other queens on the board. The chess queens can attack in any direction as horizontal, vertical, horizontal and diagonal way [

Code: Analyze in:

Practice Session
Assignment Based on similar concept of N Queen Problem Asked in : Yahoo Samsung Expedia
[Lecture] Assignment Discussion 10:4

Code:

- -MORE- -

Stack Introduction & Implementation 10:13

Stacks are dynamic data structures that follow the Last In First Out (LIFO) principle. The last item to be inserted into a stack is the first one to be deleted from it

Code:

Practice Session

Queue Introduction & Implementation 08:15

Queue is a linear data structure where the first element is inserted from one end called REAR and deleted from the other end called as FRONT

Code:

Practice Session

Circular Queue Introduction & Implementation 10:8

circular queue is a linear data structure in which operations are performed based on the FIFO (First In First Out) principle; t?he last position is connected back to the first position to make a circle

Practice Session

Histogram Problem Assignment13:35

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the this histogram

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Histogram Asked in : Cisco Intuit
[Lecture] Assignment Discussion 08:39

Code:

Stack that Supports getMin() in O(1) Assignment16:48

Design a data structure which support push()/pop()/findminimum() operation in O(1) time

Code: Analyze in:

Practice Session
Assignment Based on similar concept of stack LIFO Operation Asked in : Vmware Samsung J P Morgan
[Lecture] Assignment Discussion 09:41

Code:

Find Maximum size rectangle in Binary Sub-matrix Assignment08:18

Given a binary matrix, find the maximum size rectangle binary-sub-matrix with all 1’s

Code: Analyze in:

Practice Session
Assignment Based on similar concept of LIFO stack operation Asked in : Amazon Uber Intuit
[Lecture] Assignment Discussion 14:19

Code:

Sliding Window Problem using deque Data Structure 22:36

Given an array and an integer K, find the maximum for each and every contiguous subarray of size k

Code: Analyze in:

Practice Session

- -MORE- -

Graph Implementation and traversal with Code Assignment02:41

The is the introduction Lecture of Graph where we explain how to design graph and perform the traversal process with complete code

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Graph Traversal Asked in : Linkedin Yatra
[Lecture] Assignment Discussion 07:0

Code:

Depth-first search method to find cycle in a graph Assignment13:55

Given a undirected graph, write an algorithm to find out whether graph contains cycle or not in Time Complexity O(Vertex + Edge) and Space Complexity O(Vertex) :

Code: Analyze in:

Practice Session
Assignment Based on similar concept of DFS Asked in : Amazon Cisco IBM
[Lecture] Assignment Discussion 05:50

Code:

Topological sorting concepts and implementation 16:18

The topological sort algorithm takes a directed graph and returns an array of the nodes where each node appears before all the nodes it points to.

Code: Analyze in:

Practice Session

Breadth first search algorithm to find Number of IsLand in matrix Assignment14:35

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands in Time Complexity O(Vertices + Edges) .

Code: Analyze in:

Practice Session
Assignment Based on similar concept of BFS Island Problem Asked in : Google Amazon Microsoft
[Lecture] Assignment Discussion 04:40

Code:

Dijkstra Algorithm explanation with example 19:5

Design and implement Dijkstra's algorithm which allows us to find the shortest path between any two vertices of a graph in Time Complexity O(Edge Log(Vertices))

Code: Analyze in:

Practice Session

Verifying an Alien Dictionary using Topological Algorithm Assignment12:15

You receive a list of non-empty words from the dictionary, where words are sorted lexicographically by the rules of this new language used by aliens. Write Algorithm to Derive the order of letters in this in Time Complexity O(edges +vertices)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Topological Sort Asked in : Microsoft Facebook
[Lecture] Assignment Discussion 15:20

Code:

Breadth first search algorithm to solve Rotten Orange Problem Assignment18:14

A matrix of m*n where each cell in the matrix have Fresh,Rotten and Empty Cell. Write algorithm to find minimum time required so that all the oranges become rotten in Time Complexity O(m*n) and Space Complexity O*m*n) i.e extra matrix space

Code: Analyze in:

Practice Session
Assignment Based on similar concept of BFS Traversal Asked in : Yahoo Yandex Flipkart
[Lecture] Assignment Discussion 03:12

Code:

Trie data structure approach to find word in matrix Assignment11:58

Given an m x n board of characters and a list of strings words, return all words present in the board

Code: Analyze in:

Practice Session
Assignment Based on similar concept of using trie Data structure Asked in : Amazon WalmartLabs
[Lecture] Assignment Discussion 09:47

Code:

Snake and ladder board is given as matrix, find the minimum number of dice throws required to reach the last cell from source cell in Space Complexity O(n)

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 14:49

Code:

Understanding Queue based approach to Jumping Number problem Assignment11:42

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not considered as 1. Given a positive number x, print all Jumping Numbers smaller than or equal to x in Time Complexity O(Jumping_Numer)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of BFS Queue Asked in : Microsoft Qualcomm
[Lecture] Assignment Discussion 04:28

Code:

Trie data Structure implementation 15:9

Trie is the data structure very similar to Binary Tree. Trie data structure stores the data in particular fashion, so that retrieval of data became much faster and helps in performance

Code: Analyze in:

Practice Session

Trie data structure approach to implement Autocomplete suggestion problem Assignment16:9

Design the autocomplete feature for example : Google search auto suggestion .Desired Complexity O(Length of the word) and Space Complexity O(1)

Practice Session
Assignment Based on similar concept of ype head suggestion problem Asked in : Flipkart Intuit
[Lecture] Assignment Discussion 01:0

Code:

Package Dependency Problem Using Topological Sorting 20:19

There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses? Desired Time Complexity : O(n)

Code:

Practice Session

- -MORE- -

How to Solve DP problems 07:40

Tips and Tricks to Solve DP Problems

Practice Session

Longest Common Subsequences Assignment11:8

Given two strings of length m and n , Find algorithm the length of their longest common subsequence in Time Complexity and Space complexity O(mn)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of LCS Asked in : Uber Akamai Flipkart
[Lecture] Assignment Discussion 09:46

Code:

String Edit Distance Algorithm Assignment13:38

Given two words word1 of length m and word2 of length n, find the minimum number of operations required to convert word1 to word2 in Time and Space Complexity O(mn). You have the following 3 operations permitted on a word: 1. Insert a character 2. Delete a character 3. Replace a character

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Edit Distance Algorithm Asked in : WalmartLabs verizon Citrix
[Lecture] Assignment Discussion 09:46

Code:

Coin Change Problem Assignment11:50

Given an unlimited supply of coins of given denominations, find the total number of distinct ways to get a desired change in Time and Space Complexity in O(n^2)

Code: Analyze in:

Practice Session
[Lecture] Assignment Discussion 13:30

Code:

Longest Palindrome Subsequences Assignment10:9

The Longest Palindromic Subsequence (LPS) problem is the problem of finding the longest subsequences of a string of length n that is also a palindrome In Time and Space Complexity of O(n^2)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Palindrome Subsequence Asked in : Flipkart Amazon
[Lecture] Assignment Discussion 01:47

Code:

Word Break Using Memoization Assignment13:5

Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words in Space Complexity O(n^2)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Work Break Techniques Asked in : Yatra Yahoo Amazon
[Lecture] Assignment Discussion 10:20

Code:

DP Approach to Solve Egg Dropping Puzzle Assignment09:27

There are n number of eggs and building which has k floors. Write an algorithm to find the minimum number of drops is required to know the floor from which if egg is dropped, it will break

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Increasing Subsequence Asked in : Flipkart Amazon
[Lecture] Assignment Discussion 12:9

Code:

Optimization Of KnapSack Problems Assignment17:45

Given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W in Time and Space Complexity O(n^2)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Knapsack Problem Asked in : Microsoft Aricent
[Lecture] Assignment Discussion 10:44

Code:

Keystroke Problem Assignment10:58

we have a specially made keyboard which has following four keys 1. This key prints character 'A' 2. (Ctrl-A) 3. (Ctrl-C) 4. (Ctrl-V) If you are allowed to press keys of this special keyboard N times, write a program which calculates maximum numbers of A's possible

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Memorization Techniques Asked in : LinkedIn Samsung
[Lecture] Assignment Discussion 07:9

Code:

Interleaving Strings 13:52

Given three strings A, B and C. Write a function that checks whether C is an interleaving of A of length m and B of length n. C is said to be interleaving A and B, if it contains all characters of A and B and order of all characters in individual strings is preserved in Time and Space Complexity O(mn)

Code: Analyze in:

Practice Session

Subset Partition By using Memorization Approach Assignment15:41

Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is same in Time and Space Complexity of O(n*Sum)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of subset partition problem Asked in : Intuit Novel
[Lecture] Assignment Discussion 07:48

Code:

Wildcard Pattern Matching Assignment20:39

Given an input string (s) of length n and a pattern (p), implement wildcard pattern matching in Time and Space Complexity O(n^2) with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string.

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Wild Card Techniques Asked in : Flipkart Apple Uber
[Lecture] Assignment Discussion 14:54

Code:

Count Path in a Matrix Assignment07:47

You need to find the count all the possible paths from top left to bottom right of a matrix of length m and n with the constraints that from each cell you can either move only to right or down in Time Complexity and Space Complexity O(m*n)

Code: Analyze in:

Practice Session
Assignment Based on similar concept of Increasing Subsequence Asked in : Amazon Google
[Lecture] Assignment Discussion 10:30

Code:

Count ways to reach the n'th stair 08:15

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top in Time and Space Complexity O(n)

Code: Analyze in:

Practice Session

- -MORE- -

Basics of Object oriented principals with examples 11:32

Classes and its entities objects is the soul of object oriented paradigm.We learn how we can defined and used it. Also, basic oops feature like encapsulation etc discussed in detail

Practice Session

Reusability feature of inheritances 11:13

Inheritance is most used functionality in any oops languages. We will see with multiples examples how reusability feature reduces programming complexity

Practice Session

Various types of inheritance and its properties 09:40

This lecture we will go in depth of inheritance and understand different types of inheritance that supported different languages. Why multi level inheritance creates diamond problem in different languages

Practice Session

In this lecture we explain the Polymorphism concept with code example in different languages, method overloading and overriding concept

Practice Session

Latency, Throughput , Load Balancer 15:43

Understand the basic terminology used in system design problems. Latency, Throughput, Response time , processing time and working structure of Load Balancer

Practice Session

Http Polling, Long Polling , WebSockets, Server Side Events 11:38

Client and server communicate using Http Polling, Long Pooling , WebSockets, Server Side Events. We used these different methods of communication depends on the business requirement

Practice Session

System design component: Sharding techniques 12:16

Understanding the sharding techniques used in Distributed System. Sharding is technique to break up a big database (DB) into many smaller parts. For understanding scalable architecture, sharding is mandatory to understand

Practice Session

Backend System techniques for distributed system and CAP theorem 13:39

Understanding of scalable architecture of DB. This section explains the relational databases and non-relational databases and CAP theorem used in distributed system

Practice Session

Relational Database, SQL-NoSQL , Key Value Store & Document Store (MongoDB) 15:34

Detail Description of SQL and NoSQL, Key value No-SQL storage and Document Based(JSON) MongoDB NoSQL storage

Practice Session

- -MORE- -

OS Concepts, Process Internals & Context Switch 11:31

Process Internal Concepts in OS, Process Management, Context Switching Internal Flow & Segmentation Fault with example

Practice Session

Process states & Its Life cycle, PCB 15:33

Process States and execution, Process Control Blocks(PCB) internal structure, Process Life Cycle

Practice Session

Process vs Thread with OS internal architecture, System Calls, User Level and Kernel Level Threads in OS

Practice Session

Inter-Process Communication examples with Code flow 10:6

Understanding various ways process communicate with code examples, System calls internal Flow

Practice Session

Schedulers and Its types in OS, Various Scheduling Algorithms 15:33

Schedulers internal steps of process scheduling, Various Scheduling Algorithms available in OS

Practice Session

Scheduling Algorithm – FCFS, SJF Non-Preemptive 16:35

FCFS Algorithms with examples, Non Preemptive SJF Algorithms with examples

Practice Session

SJF Preemptive,Completion Time, TurnAround Time, Burst Time 09:50

SJF Preemptive algorithms with examples, Various time involved during process execution, Grant chart

Practice Session

Internal Architecture of Memory Management System in OS 12:21

Understanding in detail about Memory Management System,Contiguous and Non-Contiguous memory Partition,Fixed Partition, Variable partition,various page allocation method

Practice Session

Paging concepts, virtual memory internal flow 13:52

Understanding paging concepts in memory management , virtual memory architecture in detail with example

Practice Session

Page fault, Demand paging, logical & physical address, thrashing 12:25

Page fault is most imp concept of memory management, understanding the cpu generated logical and physical address , thrashing concept with example

Practice Session

Page replacement Algorithm , FIFO,LRU, Belady's Anomaly 13:33

Various page replacement algorithms with example like FIFO & LRU

Practice Session

Translation look aside Buffer(TLB),Segmentation in detail 09:5

Paging concepts drawback solved using TLB, TLB internal message flow, Segmentation concepts in memory management

Practice Session

- -MORE- -

Design a two Player Online Chess Game 29:58

Design Object Oriented Design of Chess game which is played between two players

Practice Session

Design Online Shopping System Like Amazon, Flipkart 13:33

Object Oriented Design of Online Shopping System Like Amazon, Flipkart, ebay

Practice Session

Design Generic Deck of Cards 08:38

Design the data structures for a generic deck of cards by using objected oriented principal

Practice Session

Design Black Jack Game using deck of card 16:16

For a given deck of cards, there are two people playing. The dealer and the player. The dealer takes two cards and one of them is hidden. The player gets two cards after that he can choose to HIT or STAND

Practice Session

Design Tiny URL 15:15

Design internal architecture and low level design of Tiny URL(URL shortening service)

Practice Session

Design Customs Map Implementation Internals 00:0

Design custom implementation hashmap, how hashmap works internally

Practice Session

Practice Session

Design Zoom Car System 13:32

Object Oriented Design of Car Renting System like Zoom Car where user can book the vehicle for renting

Practice Session

Design parking Lot 13:32

Design a parking lot System using object-oriented principles

Practice Session

Design Garbage Collector System 00:0

Garbage collection is the process of recycling the dynamically allocated memory. It is performed by a garbage collector whose job is to recycle the memory which will never be used again

Practice Session

Design Online Hotel Booking System 11:54

Design online hotel booking system (like Agoda, OLX ) using Object Oriented Principal

Practice Session

Object Oriented design of Food Ordering System(Swiggy , Zomato) 00:0

Design Food Ordering System Architecture with object oriented Design

Practice Session

Design Stock Exchange System( Zerodha, Upstox) 12:7

Object Oriented Design of Online Stock Brokerage System which allows its users for buying and selling stocks online. Users can their portfolio. Its Functionality should be similar to Zerodha App

Practice Session

Design Cricinfo 00:0

Design a System like CricInfo which gives the details of a match along with all the players details and live ball by ball coverage of Match

Practice Session

Design Airline Reservation System 18:15

Object Oriented Design of Airline Reservation System(Like MakeMyTrip,Yatra.com) .

Practice Session

- -MORE- -

S.O.L.I.D: The First 5 Principles of Object Oriented Design 13:1

S - Single-responsiblity principle O - Open-closed principle L - Liskov substitution principle I - Interface segregation principle D - Dependency Inversion Principle

Practice Session

SOLID Principles

Practice Session

Singleton Design Pattern 08:29

singleton class is a class that can have only one object at a time

Practice Session

Factory Design Pattern 11:24

Factory method is creational design pattern, this method provides one of the best ways to create an object

Practice Session

Abstract Factory Design Pattern 11:46

Abstract factory pattern provides a way to encapsulate a group of individual factories that have a common theme

Practice Session

Builder Design Pattern 09:1

Builder Design pattern designed to provide a flexible solution to creating complex in oops programming

Practice Session

Adapter pattern makes two incompatible interfaces compatible without changing their existing code

Practice Session

Decorator Design Pattern 15:47

Decorator pattern is a design pattern that allows behavior to be added to an individual object,dynamically

Practice Session

Strategy Design Pattern 08:51

Strategy design pattern helps to choose a specific implementation of algorithm or task in run time

Practice Session

Observer Design Pattern 13:52

Observer design pattern has a one-to-many relationship so that when one object changes state, the others are notified and updated automatically

Practice Session

Chain-of-responsibility Pattern 12:42

chain-of-responsibility pattern is a design pattern consisting of a source of command objects and a series of processing objects

Practice Session

- -MORE- -

Multithreading concepts with Examples and Code 12:38

Multiple Threads access the critical section in race condition, So protect that we used Synchronization instance or block to protect it

Practice Session

How to Achieve the synchronization between Multithreaded Environment 08:38

Most of the projects used multithreading system, Multiple ways are there to create and instantiate threads along with that maintain the lifecycle of threads.

Practice Session

Implementation of communication between the threads using wait & Notify methods. Also, Create deadlock and then Remove it.

Practice Session

Print sequence of Natural numbers using Three Threads 16:57

You are given 3 threads. You need to print sequence of natural number using these 3 threads

Practice Session

Readers-Writers Problem consists of multiple threads that are reading from and writing to a shared resource Queue

Practice Session

- -MORE- -

How to showcase soft skills(Teamwork,Leadership skills, Adaptability, DecisionMaking etc) in interview 06:48

Behavioral interview questions are one main criteria for selecting any candidates in interview.This round interviewer checks that the candidates are fit with the company culture or not. All tech giants companies now give equal wastage to technical skills as well as soft skills

Practice Session

Amazon 14 Leadership Principal with examples 12:54

Amazon leadership principal is very famous for preparing behaviour interview round.These leadership principle will help you not just in amazon interview but also in general any tech soft skills test

Practice Session

How you will resolve conflict with team members in project 09:6

Resolving conflicts is the unique skills that orgs are looking into there candidates.We explain how answer this question in behavior round with sample answer for experienced as well as entry level candidates

Practice Session

How you handle situation, when you failed to deliver the project within project estimation timeline 08:56

Failure is the part of any technical carrier, point is, how you present that failure and what you learn from it. In this lecture, we give sample answer how to showcase your failure and how failure helps you learn new skills

Practice Session

Biggest Technical mistake you have done in your project 10:22

In this lecture, we explain how to answer biggest technical mistake your tech carrier till now. We explain with sample answer for experienced as well as entry level candidates

Practice Session

Situation when you had solved a very difficult problem in project 07:20

The purpose of this question to test your problem solving skills. Also it checks that you stand with the team during any difficult technical issues. We explain it with sample answer of how to answer this question

Practice Session

Why your CGPA is not high, When you have taken initiative in a project 06:43

Mostly entry level candidates face this questions in behavior rounds. CGPA reflects how serious you are in your curriculum and takes initiative means you are innovative. Even if your don't have these you can present very decent answer so interviews wont consider you as a bad hire

Practice Session

Time when you have failed to meet customer deadline in project 07:33

This is mostly happens in real project that you missed deadlines. But through this question interviewer want to judge your technical skills. Take time explain properly. We provide sample answer for experienced as well as freshers level candidates, how to answer this question

Practice Session

What is your greatest achievement in a project 04:53

You need explain most impressive accomplishment in your tech carrier or college curricula. You should answer this question based on your resume. But, we provide sample answer for this question for experienced as well as entry level candidates, they can refer it and frame there answer before interview

Practice Session

Time when you successfully meet the tight deadline of a project 07:35

This shows that you can work and perform in pressure situation also. Explain with sample answer how you use this question to showcase your technical competency

Practice Session

Tell me the time when you regret your decision in a project deliverables 10:7

As a leader of any project, many times we take wrong decisions which can make our customers unhappy. This is quite common in tech jobs. This questions required you to elaborate and think outside the box

Practice Session

- -MORE- -

4.8 Review

5246 Learners Subscribed

Current price \$83 \$84

LECTURES PREVIEW

Sort an array of 0's, 1's and 2's

Process & Context Switch in Operating System

Data Structure which support Insert delete, Random in O(1) time

Below are the frequently asked questions from students

• 1. If you just finished this course only, we guarantee that you can crack the interview of any top organization across the globe.
• 2. It's a Lifetime access course, so whenever in future you have an interview coming in your carrier just revise topics from our course and nailed the interview
• 3. We discussed every lecture with complete code line by line explanation
• 4. There are no prerequisites for this course and is best for someone working in other IT/Non-IT domain and wants to start their career in data science
• 5. Course content is structured and designed to fulfill the current job requirement and need of IT industry

Yes!!

Subscribers can access all lecture's lifetime. Subscribers will also get all updates that will come in the future.

Just Click on "Enroll Now"for registration. During registration you need to provide a mobile number then you click on the "Generate Coupon Code" Button and the coupon code will come to the subscriber mobile

Subscribe apply that discount coupon and price of the course will reduce further

Just Click on "View Course Details" and Subscribe for the course

Users can participate in Online Weekly Code forever and Doubt clearing session will be available for 5 month period

We want candidates should also put their effort into completing the course and participate in the Weekly online coding test. All the performant subscribers in the coding test will be eligible for Mock interviews as well as Job referral program

Yes, every problem in this course is explained with code and examples. Our main intension is to make the programming skills of our candidates strong. So line by line code explains while solving any problems

We don't put any constraint of the batch system in our course, as soon as aspirant subscribe for the course complete course content will be available

Batch System always restricts aspirants for accessing the complete course. If a student has an interview after a few weeks and he/she want to prepare for advanced topics, then the batch system will not allow accessing the course content

Yes, you can access the complete course in mobile or tablet

logicmojoContact

HAVE A QUESTION? GIVE US A CALL OR CONTACT US – WE'D LOVE TO HEAR FROM YOU

PHONE: +91 80889-75867

Email: [email protected]