Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Python21.3K+ articles

Experiences16.6K+ articles

Interview Experiences14.1K+ articles

JavaScript12.2K+ articles

School Learning11.5K+ articles

Java10.8K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

DSA / Algorithms

Algorithms

14.7K+ posts

Steady-state probabilities in Markov Chains

Last Updated: 29 April 2025

A Markov chain is a statistical model that explains how a system transitions from one state to another, with the next state depending only on the present state and not on ...read more

Maximum XOR Queries With an Element From Array

Last Updated: 18 April 2025

Given an array arr[] of size n containing non-negative integers and also given a list of q queries in a 2D array queries[][], where each query is of the form [xi, mi]. For...read more

Top Logic Building Problems for Interviews

Last Updated: 13 April 2025

Logic building problems are fundamental to developing strong problem-solving skills and mastering algorithms. These problems often require a deep understanding of patterns...read more

Total Hamming Distance

Last Updated: 22 April 2025

Given an integer arrayarr[], return the sum ofHamming distancesbetween all the pairs of the integers inarr.The Hamming distance between two integers is the number of bit p...read more

Product of Two Numbers

Last Updated: 17 March 2025

Given two numbers, a and b. Return the product of both the numbers.Examples:Input: a = 4, b = 5Output: 20Input: a = 3, b = 5Output: 15Table of Content[Expected Approach] U...read more

Nth term of AP from First Two Terms

Last Updated: 03 April 2025

Given two integers a1 and a2, the first and second terms of an Arithmetic Series respectively, the problem is to find the nthterm of the series.Examples :Input : a1 = 2, ...read more

arithmetic progression

Arithmetic Progressions

Commonly Asked Data Structure Interview Questions on Bit Manipulation

Last Updated: 04 March 2025

Bit manipulation is a powerful technique often used in technical interviews to optimize space and time complexities by directly working with the binary representations of ...read more

Data Structures

Data Structures

Commonly Asked Data Structure Interview Questions on Dynamic Programming

Last Updated: 03 March 2025

Dynamic Programming (DP) is a method used to solve optimization problems by breaking them down into simpler subproblems and solving each subproblem just once, storing the ...read more

Dynamic Programming

Top Problems on Bit Manipulation for Interviews

Last Updated: 03 March 2025

This topic focuses on operations involving binary numbers and bitwise operators, which can lead to highly efficient solutions for complex problems. Bit manipulation often ...read more

Commonly Asked Data Structure Interview Questions on Sorting

Last Updated: 21 May 2025

Sorting is a fundamental concept in computer science and data structures, often tested in technical interviews. Sorting algorithms are essential for organizing data in a s...read more

article_image

Commonly Asked Data Structure Interview Questions on Searching

Last Updated: 19 May 2025

Searching is a fundamental concept in computer science, involving the process of finding a specific element in a collection of data. Efficient searching techniques are cru...read more

Commonly Asked Data Structure Interview Questions on Recursion

Last Updated: 24 May 2025

Recursion is a fundamental concept in computer science, where a function calls itself to solve smaller instances of a problem. Recursion is commonly applied in problems in...read more

article_image

Dynamic Programming in Python

Last Updated: 14 February 2025

Dynamic Programming is a commonly used algorithmic technique used to optimize recursive solutions when same subproblems are called again.The core idea behind DP is to stor...read more

article_image

Dynamic Programming

Sorted Array to Wave Form

Last Updated: 11 February 2025

Given a sorted array of integers, the task is to sort the array into a wave array. An array arr[0..n-1] is sorted in wave form if:arr[0] = arr[1] = arr[2] = arr[3] = arr[4...read more

Meeting rooms - Find minimum meeting rooms

Last Updated: 26 March 2025

Given two arrays start[] and end[] such that start[i] is the starting time of ith meeting and end[i] is the ending time of ith meeting. Task is to find minimum number of r...read more

...