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

Short Notes on Two Pointer and Sliding Window

Last Updated: 09 September 2025

Basics of Two PointerThe two-pointer technique uses two indices that move towards each other or in the same direction to process data efficiently.It is commonly used when:...read more

article_image

Short Notes on Searching

Last Updated: 09 September 2025

Basics of Searching Searching locates a specific element in a data structure. Choice of method depends on whether the data is sorted and the required performance.Linear Se...read more

article_image

Short Notes Sorting

Last Updated: 09 September 2025

Sorting is a core concept in algorithms, frequently used in both basic and advanced problems. These short notes primarily cover different sorting algorithms along with the...read more

article_image

Short Notes on Strings

Last Updated: 09 September 2025

String BasicsA string is a sequence of characters. It can represent words, sentences, identifiers, or even binary data.String Declaration Initialization: Common Operation...read more

article_image

Short Notes: Hashing and Prefix Sums

Last Updated: 09 September 2025

Basics of HashingHashingis a technique used tomap data to a fixed-size value(called ahash) for efficient lookup, insertion, and deletion. It's widely used in data structur...read more

article_image

Short Notes Arrays 1-D & 2-D

Last Updated: 09 September 2025

Basics of Static and Dynamic Arrays(1D 2D)Static arrays have a fixed size defined at compile time and are stored in contiguous memory, making them fast but inflexible. In...read more

article_image

Short Notes: Maths & Combinatronics

Last Updated: 09 September 2025

Mathematical FoundationsThese are the most basic but essential mathematical tools in programming. They help in performing quick checks, optimizing loops, and building logi...read more

Reverse an Array using Recursion

Last Updated: 06 September 2025

Given an array arr , You need to reverse the array using recursionExamples:Input: arr = [1, 2, 3, 4, 5]Output: [5, 4, 3, 2, 1]Explanation: After reversing the array recurs...read more

Most Commonly Asked Data Structure Interview Questions on Deque

Last Updated: 07 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

article_image

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

Last Updated: 08 September 2025

The greedy algorithm is a problem-solving strategy where we build the solution step by step. At each step, we choose the best possible option available at that moment (loc...read more

article_image

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

...