- Basic loop understanding in Python is required as a prerequisite of this course, rest all we will teach as part of the course
- All Concepts Explains From Very Basic to

Advanced level

- 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 Coding & Competitive Programming.

Road Map To A High Package Job

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

Practice Session

Practice Session

Practice Session

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

Practice Session

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

Asked in : WalmartLabsMicrosoft

Practice Session

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

Asked in : AmazonMicrosoftUber

Practice Session

Assignment Based on similar concept of Binary Search Asked in : Linkedin Goldman Sachs

[Lecture] Assignment Discussion

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

Asked in : AmazonMicrosoftAdobeWalmartLabs

Practice Session

Assignment Based on similar concept of Segregation logic Asked in : Microsoft Amazon

[Lecture] Assignment Discussion

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

Asked in : AdobeIntuit

Practice Session

Assignment Based on similar concept of Jump Game Problem Asked in : Microsoft Amazon

[Lecture] Assignment Discussion

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

Asked in : Morgan StanleyMakemytripAmazon

Practice Session

Assignment Based on similar concept of Digit rearrangement method Asked in : Amazon Akamai J P Morgan

[Lecture] Assignment Discussion

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

Asked in : GoldmanSachsExpediaOLA

Practice Session

Assignment Based on similar concept of Array Manipulation in Triangle Asked in : Microsoft Facebook

[Lecture] Assignment Discussion

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

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

Asked in : MicrosoftOLAPayTmOracle

Practice Session

Assignment Based on similar concept of Matrix Manipulation Asked in : Facebook Citrix Flipkart

[Lecture] Assignment Discussion

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)

Asked in : PayTmVmWareAmazon

Practice Session

Assignment Based on similar concept of counting sort Asked in : Yahoo Linkedin

[Lecture] Assignment Discussion

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

Asked in : FlipkartAmazonPayTm

Practice Session

Assignment Based on similar concept of Xor Method Asked in : Google OLA

[Lecture] Assignment Discussion

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

Asked in : AmazonMicrosoftFlipkartDE-Shaw

Practice Session

Assignment Based on similar concept of Stock Buy Sell Techniques Asked in : Linkedin Yahoo

[Lecture] Assignment Discussion

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)

Asked in : FacebookGoogle AmazonMicrosoft

Practice Session

Assignment Based on similar concept of Binary Search In Matrix Asked in : Cisco Vmware Amazon

[Lecture] Assignment Discussion

Find next smallest palindrome larger than this given number

Asked in : FlipkartOracle

Practice Session

Assignment Based on similar concept of Array Manipulation Asked in : Samsung Adobe

[Lecture] Assignment Discussion

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)

Asked in : GoogleFlipkartAmazonMicrosoft

Practice Session

Assignment Based on similar concept of Array Manupulation Asked in : Yahoo Expedia MMT

[Lecture] Assignment Discussion

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

Asked in : VmwareSapLabsWalmartLabs

Practice Session

Assignment Based on similar concept of Quick Select Method Asked in : Uber Facebook WalmartLabs

[Lecture] Assignment Discussion

Continuation of Kth smallest Element

Practice Session

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

Asked in : AccoliteQualcomm

Practice Session

Assignment Based on similar concept of Binary Search Asked in : Sap Labs IBM ISL Mcafee

[Lecture] Assignment Discussion

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)

Asked in : MicrosoftDE-ShawAmazonAdobe

Practice Session

Assignment Based on similar concept of Rain Water Problem Asked in : Google Amazon Microsoft

[Lecture] Assignment Discussion

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)

Asked in : GoogleMicrosoft

Practice Session

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)

Asked in : WalmartLabsFacebook

Assignment Based on similar concept of Minimum window string Asked in : Cisco Intuit

[Lecture] Assignment Discussion

You need to design a data structure that supports the below operation in O(1) time complexity 1) Insert() which adds an element to the data structure 2) remove() which removes an element from the data structure 3) findMiddle() which will return middle element 4) deleteMiddle() which will delete the middle element. Insert(1) --- O(1) time complexity Insert(2) Insert(3) findMiddle() – 2 in O(1) time complexity Insert(4) Insert(5) deleteMiddle() - remove 3 in O(1) time complexity remove(5) – in O(1) time complexity

Code:
Practice Session

Assignment Based on similar concept of Array operation in O(1) Time Asked in : Intuit WalmartLabs

[Lecture] Assignment Discussion

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)

Asked in : IntuitAdobe

Practice Session

Assignment Based on similar concept of Median in an Array Asked in : Google Microsoft

[Lecture] Assignment Discussion

- -MORE- -

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

Practice Session

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

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)

Asked in : AmazonMicrosoftFlipkartWalmartLabs

Practice Session

Assignment Based on similar concept of BT to DLL Asked in : Cisco Intuit

[Lecture] Assignment Discussion

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)

Asked in : FlipkartAmazonMicrosoftFacebookIntuitBroadcom

Practice Session

Assignment Based on similar concept of Finding Diameter Asked in : Adobe J P Morgan

[Lecture] Assignment Discussion

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)

Asked in : AmazonEMC2SAP-Labs

Practice Session

Assignment Based on similar concept of Binary Tree View Asked in : Oracle Citrix

[Lecture] Assignment Discussion

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

Asked in : Sap LabsCisco

Practice Session

Assignment Based on similar concept of Reverse Level Order Asked in : Flipkart Verizon

[Lecture] Assignment Discussion

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)

Asked in : FacebookOLAMyntra

Practice Session

Assignment Based on similar concept of Binary Tree Traversal Asked in : Microsoft Swiggy

[Lecture] Assignment Discussion

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

Practice Session

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

Asked in : AdobeJ P MorganFlipkart

Practice Session

Assignment Based on similar concept of Spiral Traversal Tree Asked in : Microsoft Facebook Amazon

[Lecture] Assignment Discussion

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

Asked in : SamsungWalmartLabs

Practice Session

Assignment Based on similar concept of Construction of Tree Asked in : Broadcom Qualcomm

[Lecture] Assignment Discussion

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

Asked in : PaypalAmazonPaytm

Practice Session

Assignment Based on similar concept of View of Tree Asked in : Intuit Thoughtworks Aricent

[Lecture] Assignment Discussion

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

Asked in : FlipkartOLAInMobi

Practice Session

Assignment Based on similar concept of Traversal of Tree Asked in : Amazon Microsoft Vmware

[Lecture] Assignment Discussion

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)

Asked in : UberFlipkartSamsung

Practice Session

Assignment Based on similar concept of Node distance Asked in : Yahoo Facebook Google

[Lecture] Assignment Discussion

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)

Asked in : GoogleAmazonFacebook

Practice Session

Assignment Based on similar concept of Distance Node Asked in : Google Amazon

[Lecture] Assignment Discussion

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

Asked in : FlipkartVMware

Practice Session

Assignment Based on similar concept of Maximum Path Sum Asked in : Flipkart Google Facebook

[Lecture] Assignment Discussion

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

Asked in : FlipkartUberOLA

Practice Session

Assignment Based on similar concept of Nodes Connected at Same Level Asked in : Intuit Amazon WalmartLabs

[Lecture] Assignment Discussion

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

Asked in : GoogleUber

Practice Session

Assignment Based on similar concept of Binary Tree Mirroring Asked in : Google Facebook Flipkart

[Lecture] Assignment Discussion

- -MORE- -

Practice Session

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

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

Asked in : AmazonGoogle

Practice Session

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) .

Asked in : CiscoInmobiBroadcomOLAExpedia

Practice Session

Assignment Based on similar concept of Reverse K LinkedList Asked in : Amazon.Flipkart WalmartLabs Ariba

[Lecture] Assignment Discussion

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

Practice Session

Assignment Based on similar concept of Clone of Linked-list Asked in : Samsung Radisys

[Lecture] Assignment Discussion

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)

Asked in : GoogleAmazonFlipkart

Practice Session

Assignment Based on similar concept of Linked-List Merge Sort Asked in : Flipkart Amazon

[Lecture] Assignment Discussion

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)

Asked in : WalmartLabsAmazonEMC2

Practice Session

Assignment Based on similar concept of Linked-List Merge Operation Asked in : Cisco SapLabs

Assignment Discussion Lecture

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)

Asked in : LinkedinYahooMicrosoft

Practice Session

Assignment Based on similar Concept of Flattering of Linked-List Asked in : Citrix Facebook Novel

Assignment Discussion Lecture

- -MORE- -

Min/Max Heap Implementation

Analyze in:
Practice Session

Asked in : Flipkart Amazon

Basic Introduction lecture of heap and heap operations

Code: Analyze in:
Practice Session

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

Asked in : AmazonFlipkartUber

Practice Session

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

Asked in : GoogleAmazonFlipkart

Practice Session

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

Asked in : GoogleAmazonFlipkartSapLabsWalmartLabs

Practice Session

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

Asked in : WalmartLabsOLAGoogle

Practice Session

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

Asked in : Oracle,Amazon,Microsoft

Practice Session

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

Asked in : FacebookWalmartLabsYatraMakemytrip

Practice Session

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

Asked in : MyntraOLAMicrosoft

Practice Session

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

Asked in : SnapdealMakeMyTrip

Practice Session

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

Asked in : FacebookJ P morgan]

Practice Session

- -MORE- -

Practice Session

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 [

Asked in : VISAIntuit]

Practice Session

Assignment Based on similar concept of N Queen Problem Asked in : Yahoo Samsung Expedia

[Lecture] Assignment Discussion

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

Asked in : FlipkartWalmartLabs

Practice Session

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

Asked in : AmazonWalmartLabs

Practice Session

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

Asked in : MakeMyTripYatraExpedia

Practice Session

Assignment Based on similar concept of Matrix Recursion Asked in : Microsoft WalmartLabs

[Lecture] Assignment Discussion

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

Asked in : AppleCiscoSamsung

Practice Session

Assignment Based on similar concept of Permutation of String Asked in : Yahoo Morgan Stanley

[Lecture] Assignment Discussion

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

Asked in : MicrosoftAmazonFlipkartOracle

Practice Session

Assignment Based on similar concept of application of recursion Asked in : Amazon.Google Uber

[Lecture] Assignment Discussion

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

Practice Session

- -MORE- -

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 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 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

Code:
Practice Session

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

Asked in : Google,Facebook,DE-Shaw

Practice Session

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

Asked in : FacebookGoogleUber

Practice Session

Assignment Based on similar concept of LIFO stack operation Asked in : Amazon Uber Intuit

[Lecture] Assignment Discussion

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

Asked in : SapLabsLinkedin

Practice Session

Assignment Based on similar concept of stack LIFO Operation Asked in : Vmware Samsung J P Morgan

[Lecture] Assignment Discussion

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

Asked in : AmazonIBM-ISL

Practice Session

Assignment Based on similar concept of Histogram Asked in : Cisco Intuit

[Lecture] Assignment Discussion

- -MORE- -

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

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) :

Asked in : AdobeMakemyTripIntuit

Practice Session

Assignment Based on similar concept of DFS Asked in : Amazon Cisco IBM

[Lecture] Assignment Discussion

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

Asked in : NetAppIntuitOracle

Practice Session

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.

Asked in : AccoliteFlipkart

Practice Session

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)

Asked in : AmazonFlipkart

Practice Session

Assignment Based on similar concept of BFS Snake Ladder Asked in : Google WalmartLabs

[Lecture] Assignment Discussion

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)

Asked in : Morgan StanleyOLANetApp

Practice Session

Assignment Based on similar concept of BFS Queue Asked in : Microsoft Qualcomm

[Lecture] Assignment Discussion

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

Asked in : GoogleFacebookAmazon

Practice Session

Assignment Based on similar concept of using trie Data structure Asked in : Amazon WalmartLabs

[Lecture] Assignment Discussion

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

Asked in : MicrosoftAmazonExpedia

Practice Session

Assignment Based on similar concept of BFS Traversal Asked in : Yahoo Yandex Flipkart

[Lecture] Assignment Discussion

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

Asked in : CitrixInformaticaExpedia

Practice Session

Assignment Based on similar concept of BFS Island Problem Asked in : Google Amazon Microsoft

[Lecture] Assignment Discussion

Asked in : GoogleApple

Assignment Based on similar concept of ype head suggestion problem Asked in : Flipkart Intuit

[Lecture] Assignment Discussion

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)

Asked in : GoogleWalmartLabsAdobe

Practice Session

Assignment Based on similar concept of Topological Sort Asked in : Microsoft Facebook

[Lecture] Assignment Discussion

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)

Asked in : AdobeWalmartLabsGoogle

Practice Session

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))

Asked in : GoogleUberFacebook

Practice Session

- -MORE- -

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)

Asked in : LinkedinPayPal

Practice Session

Assignment Based on similar concept of LCS Asked in : Uber Akamai Flipkart

[Lecture] Assignment Discussion

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

Asked in : AmazonMicrosoftMyntraCisco

Practice Session

Assignment Based on similar concept of Edit Distance Algorithm Asked in : WalmartLabs verizon Citrix

[Lecture] Assignment Discussion

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)

Asked in : Morgan StanleyMicrosoftPayTm

Practice Session

Assignment Based on similar concept of Coin Change Asked in : Google Facebook

[Lecture] Assignment Discussion

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)

Asked in : LinkedinUberPaypal

Practice Session

Assignment Based on similar concept of Palindrome Subsequence Asked in : Flipkart Amazon

[Lecture] Assignment Discussion

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)

Asked in : YahooYatra

Practice Session

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)

Asked in : AmazonGoogle

Practice Session

Assignment Based on similar concept of Knapsack Problem Asked in : Microsoft Aricent

[Lecture] Assignment Discussion

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

Asked in : IntuitAmazon

Practice Session

Assignment Based on similar concept of Increasing Subsequence Asked in : Flipkart Amazon

[Lecture] Assignment Discussion

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)

Asked in : GoogleWalmartLabsIBM

Practice Session

Assignment Based on similar concept of Work Break Techniques Asked in : Yatra Yahoo Amazon

[Lecture] Assignment Discussion

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.

Asked in : InMobiOLACisco

Practice Session

Assignment Based on similar concept of Wild Card Techniques Asked in : Flipkart Apple Uber

[Lecture] Assignment Discussion

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)

Asked in : AmazonMicrosoft

Practice Session

Assignment Based on similar concept of subset partition problem Asked in : Intuit Novel

[Lecture] Assignment Discussion

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

Asked in : GoogleAdobeNetApp

Practice Session

Assignment Based on similar concept of Memorization Techniques Asked in : LinkedIn Samsung

[Lecture] Assignment Discussion

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)

Asked in : Morgan StanleyAccoliteSamsung

Practice Session

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

- -MORE- -

Asked in : MakeMyTripUber

Practice Session

Asked in : AmazonMicrosoftIntuitoracleCitrix ]

Practice Session

Asked in : OLAJuniper Networks

Practice Session

Practice Session

Asked in : FlipkartFacebookGoldman Sach

Practice Session

Practice Session

Practice Session

Asked in : CiscoFlipkartOracle

Practice Session

Design Food Ordering System Architecture with object oriented Design

Asked in : AmazonMicrosoftUber

Practice Session

Design custom implementation hashmap, how hashmap works internally

Practice Session

Practice Session

Asked in : MakemytripBooking.comExpedia

Practice Session

Asked in : OracleQualcomm

Practice Session

Asked in : WalmartLabsIntuit]

Practice Session

- -MORE- -

Practice Session

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

Practice Session

Practice Session

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

Practice Session

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

Practice Session

FCFS Algorithms with examples, Non Preemptive SJF Algorithms with examples

Practice Session

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

Practice Session

Practice Session

Practice Session

Practice Session

Various page replacement algorithms with example like FIFO & LRU

Practice Session

Practice Session

- -MORE- -

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

- -MORE- -

Practice Session

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

Practice Session

Practice Session

Practice Session

Practice Session

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

Practice Session

Practice Session

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

Practice Session

Practice Session

Practice Session

- -MORE- -

Practice Session

Practice Session

Asked in : IBM-ISLFlipkartApple

Practice Session

Asked in : CitrixPaypalFacebook

Practice Session

Asked in : Google. Amazon

Asked in : LinkedinUberGoogle

Practice Session

- -MORE- -

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

Practice Session

- -MORE- -

- 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

In the ** Home** page, we explain in detail about course features

Yes!!

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

2 Months

If you just spend 2 hours every day in this course then in 2 months of time frame your preparation of coding and system design interview will be done.

You dont even need to refer to any other resources just finish this course and you are good to go for Top Tech Interviews

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

**5 month period**

**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