Given an array X[] of length N, Where X[i] for (1 ≤ i ≤ N) denotes the number of rupees we need to give to… Read More
Category Archives: Competitive Programming
Given a binary array X[] of size N. Two players A and B are playing games having the following rules, then the task is to… Read More
IntelliJ IDEA is a popular Integrated Development Environment (IDE) used by many developers for Java programming. In this article, we’ll walk through the steps to… Read More
The reliability design problem is the designing of a system composed of several devices connected in series or parallel. Reliability means the probability to get… Read More
Given an integer N which corresponds to a N x N grid. The score you can get from a cell at the ith row and… Read More
Given two integers N and L, Find out a string of length L which consists of bitwise operators &(AND), |(OR), and ^(XOR), and if these… Read More
Dynamic Segment Trees with Poly Hash Tables is a data structure that combines the benefits of both dynamic segment trees and hash tables to efficiently… Read More
Given a Binary Search Tree with unique node values and a target value. Find the node whose data is equal to the target and return… Read More
Given an integer array A[] of size N and integer k. For a fixed value p, choose an index i (1 ≤ i ≤ n)… Read More
Given a matrix M[][] having R rows and C columns, the task is to return a matrix X[][] in which X[i][j] represents the number of… Read More
Given two matrices M1[][] and M2[][] of size R * C along with an integer X. In one operation select any cell of M1 let’s… Read More
Given counts of x, y, and z, the task is to find the maximum number of triplets that can be made from the count of… Read More
Given an array X[] of length N along with an integer K. Then the task is to choose a sub-sequence to maximize the sum by… Read More
Given three points X, Y, and Z of a 2D plane, the task is to check if it is possible to move from X to… Read More
Courses
