Lecture 39: Advantage of Circular Queue | Introduction to Doubly Ended Queue and Priority Queue

Hello folks, In this video, you would got about the advantage of circular queue over linear queue along with the introduction of doubly ended queue and priority queue. If you have any query, then you can post it to the telegram group where i will resolve your queries individually. Telegram Group Link: https://t.me/joinchat/RMgGjRz0eZaMZbg2Fmn18A You can also mail us at [email protected] Please Like, Share the Video with your friends and Subscribe the Channel.

Lecture 38: Implementation of Queue using Array and Linked List

Hello folks, In this video, you would got about the implementation of queue using array and linked list both. If you have any query, then you can post it to the telegram group where i will resolve your queries individually. Telegram Group Link: https://t.me/joinchat/RMgGjRz0eZaMZbg2Fmn18A You can also mail us at [email protected] Please Like, Share the Video with your friends and Subscribe the Channel.

Lecture 37: Introduction to Queue | Types, Operations and Applications of Queue

Hello folks, In this video, you would got about the introduction to queue along with its types, operations and applications of queue. If you have any query, then you can post it to the telegram group where i will resolve your queries individually. Telegram Group Link: https://t.me/joinchat/RMgGjRz0eZaMZbg2Fmn18A You can also mail us at [email protected] Please Like, Share the Video with your friends and Subscribe the Channel.

Lecture 36: GATE PYQ's of Stack

Hello folks, In this video, you will understand about the GATE previous year questions of Stack data structure. Last Question: Let S be a stack of size n ≥1. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform n pop operations. Assume that Push and Pop operations take X seconds each, and Y seconds elapse between the end of one such stack operation and the start of the next operation. For m ≥1, define the stack-life of m as the time elapsed from the end of Push(m) to the start of the pop operation that removes m from S.

Lecture 35: The Celebrity Problem | Interview Problem | Puzzle | Google, Amazon, Microsoft, Flipkart

Hello folks, In this video, you would got about the celebrity problem which is a popular puzzle as well as common interview problem for various product based companies like Google, Amazon, Microsoft, Flipkart, Fab.com, etc. In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he doesn’t know anyone in the party. We can only ask questions like “does A know B? “. Find the stranger (celebrity) in the minimum number of questions.

Lecture 34: Maximum Rectangular Area under Histogram | Common Interview Problem

Hello folks, In this video, you would got about the maximum rectangular area under the histogram which is common interview problem for various product based companies like Samsung, Paytm, Amazon, etc. Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. For simplicity, assume that all bars have same width and the width is 1 unit. For example, consider the following histogram with 7 bars of heights {6, 2, 5, 4, 5, 1, 6}.

Lecture 33: Stock Span Problem | Famous Interview Problem | Product Based Companies

Hello folks, In this video, you would got about the stock span problem which is one of the famous interview problem specifically for product based companies. The Stock Span Problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate span of stock’s price for all n days. The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day.

Lecture 32: Design a Stack that supports getMin( ) in O(1) time | Interview Question

Hello folks, In this video, you would know how to design a stack that supports getMin( ) in O(1) time with O(n) space and O(1) space. It is one of the famous interview question of stack. If you have any query, then you can post it to the telegram group where i will resolve your queries individually.

Lecture 31: How to Reverse a Stack | String of a's and b's Palindrome or Not | Interview Problem

Hello folks, In this video, you would got about how to reverse a stack along with how to check given string of a's and b's is palindrome or not. These both are the major interview questions. If you have any query, then you can post it to the telegram group where i will resolve your queries individually.

Lecture 30: Balance Parenthesis Problem | Reverse a String using Stack | Interview Problem

Hello folks, In this video, you would got about the balance parenthesis problem along with how to reverse a given string using stack. These are one of the frequently asked interview questions of stack. If you have any query, then you can post it to the telegram group where i will resolve your queries individually.