Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

Misc7.7K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Strings2.1K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Dynamic Programming1.1K+ articles

Searching1.0K+ articles

Tree910+ articles

DSA

20.2K+ posts

Most Commonly Asked Data Structure Interview Questions on Deque

Last Updated: 05 September 2025

A deque (double-ended queue) is a powerful linear data structure that allows insertion and deletion from both ends. It is widely used in real-world applications like slidi...read more

Last Updated: 05 September 2025

Given two strings pat and tar consisting of lowercase English characters. You can construct a new string s by performing any one of the following operation for each charac...read more

Commonly Asked Interview Questions on Sliding Window Technique

Last Updated: 04 September 2025

The Sliding Window Technique is a highly efficient method used for solving problems involving subarrays, substrings, or sequences. Instead of recalculating results for ove...read more

Interview-Questions

Commonly Asked Interview Questions on Two Pointer Technique

Last Updated: 04 September 2025

The Two Pointer Technique is a powerful method often used in solving array and string problems efficiently. Instead of relying on brute force approaches that may take O(n²...read more

Interview-Questions

Short Notes on Linked List

Last Updated: 01 September 2025

A linked list is a linear data structure in which elements, called nodes, are stored at non-contiguous memory locations, each node having data and a pointer (next or prev ...read more

article_image

Create Circular Linked List with given array

Last Updated: 30 August 2025

Given an array arr[]. Create a circular linkedlist from the given array.Examples:Input: arr[] = [10, 20, 30, 40, 50]Output: 10 - 20 - 30 - 40 - 50 - (back of head)Explanat...read more

article_image

Create a Doubly Linked List (DLL) from a Given Array

Last Updated: 30 August 2025

Given an array arr[] of integers, the goal is to create a Doubly Linked List (DLL) where each element of the array is represented as a node. The nodes must be linked in th...read more

article_image

Minimum Window Subsequence

Last Updated: 14 August 2025

Given two strings s1 and s2, find the smallest contiguous substring of s1 in which s2 appears as a subsequence.The characters of s2 must appear in the same order within th...read more

Mode in Every k-Sized Window

Last Updated: 08 August 2025

Given an array arr[] of positive integers and an integer k. Find the sum of the modes of all subarrays of size k.Note: The mode of a subarray is the element that occurs wi...read more

Maximum Sum Subarray 2

Last Updated: 14 August 2025

Given an integer array arr[] of size n, along with two integers a and b, determine the maximum possible sum of a contiguous subarray whose length is at least a and at most...read more

Search in fully rotated sorted 2D matrix

Last Updated: 12 August 2025

Given a sorted 2D matrixmat[][]of size n x m that was initially filled such that:The elements increase left to right across rows.The first element of each row is greater t...read more

Understanding Prefix Sums

Last Updated: 28 July 2025

In programming, prefix sum arrays are a simple and powerful technique. They make it easier to solve problems that involve finding the sum of numbers between two points in ...read more

article_image

Count Target in Sorted Matrix

Last Updated: 06 August 2025

Given a 2D matrix mat[][] and an integer x, count the number of times x appears in the matrix.The matrix follows these sorting rules:Each row is sorted in increasing order...read more

Row with Max 1s in Binary Matrix

Last Updated: 08 August 2025

Given a 2D binary matrix mat[][], where each row contains only 0s and 1s, and each row is sorted in non-decreasing order (all the 0s come before any 1s). Find the index of...read more

Range-Based Count of X in Sorted Array

Last Updated: 01 August 2025

Given a sorted array arr[] and a list of queries represented as a 2D array queries[][]. Each query is a triplet of the form [l, r, x], where l and r are indices in the arr...read more

...