Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

## Merge k Sorted Arrays

This article will delve into a renowned challenge known as Merge K Sorted Arrays. This particular problem holds significant prominence and is a common query posed during numerous technical interview...

## Merge Sort Explanation with Example

In this article, we are going to discuss merge sort and how to merge k sorted lists. Merge Sort Merge sort is a divide-and-conquer algorithm. It is a recursive algorithm....

## Finding SubArray with Given Sum

The task of finding all subarrays with a given sum is a common problem in computer science and data analysis. Subarrays are contiguous segments of an array, and the challenge...

## Spanning Tree in Data Structure

In this article, we are going to discuss the Spanning tree. This is one of the most important topics of data structure. First, we will study what is an undirected...

## JDBC Program in Java

What is JDBC in Java? JDBC in Java stands for Java Database Connectivity, representing a progression from ODBC (Open Database Connectivity). JDBC serves as a standardized API specification designed to...

## What is Graph in Data Structure?

A Graph is a non-linear data structure. It consists of vertices and edges. The vertices are sometimes also referred to as nodes, the edges are lines connecting any two nodes...

## Identify and mark unmatched parenthesis in an expression

Given an expression, find and mark matched and unmatched parenthesis in it. We need to replace all balanced opening parenthesis with 0, balanced closing parenthesis with 1, and all unbalanced...

## Expression contains redundant bracket or not

Note: Expression may contain any of these ‘+‘, ‘*‘, ‘–‘, and ‘/‘ operators. Given expression is valid and there are no white spaces present. Examples: Input: “((a+b+c))” Output: YES Explanation:...

## How to Sort a Stack using Recursion

First we’ll discuss what is Stack: Stack follows the principle of LIFO (Last in First out) i.e. element which is inserted at last will be removed first. The operation for...

## How to create a mergeable stack?

Let’s assume there are 2 stacks. Stack A and Stack B. Now we are going to push elements in both the stacks. After Merge Operation we will push all elements...

## How to efficiently implement K Stacks in a single Array?

Our task is to Implement K stacks that should use only one array. The K stacks must support these functions push(int x, int sn): pushes element x to stack number...

## Design a Stack with operations on Middle element

Brief about Stack Data structure: A stack is a linear data structure that follows the principle of Last In First Out (LIFO). This means the last element inserted inside the...

## Time complexity of building a heap

Heapify is a common operation performed on binary heaps, which are data structures that are used to implement priority queues. It involves rearranging the elements in a heap to maintain...

## Heap overflow and Stack overflow

The computer’s RAM has a few sections in it. Two of them are heap and stack. Both heap and stack store variables. Let's see about Heap and Stack briefly:- Both...