Data Structure Problems
Explosion There is a house named Larcana. It is a very weird house. There are exactly N rooms in total and bet... |
Device ID A device ID is a distinct number associated with a smartphone or similar handheld device. Every smar... |
Laser Light A 2D grid consists of a lot of special lights bulbs, which turns on upon the incidence of a laser li... |
Color The Graph You are given an acyclic, bidirectional graph with N nodes and M edges. The nodes are numbered from ... |
Mario and Princess Peach The world of Mario can be imagined as 2D grid of $N$ rows and $M$ columns--containing a total of $N ... |
Straightforward No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen... |
Final Days of Goldfinger We see agent Bond once again being called in time of a great need. The vile criminal Auric Goldfinge... |
Naughty Subsequence - V2.0 Mahib loves ‘Naughty Subsequence’-s. He will give you an array of characters ara[0,1,...,n-1] that c... |
City of Atlantis Have you ever heard of The Atlantis City? It’s a Greek mythological city. Its existence doesn’t matt... |
Memes vs. Social Media In this era of modern technology social media is the most powerful weapon and the viral issue is the... |
Another Update-Query Problem You will be given an array A of length N and you will have to perform Q operations on that array. Th... |
Poltu and Graph Poltu has got a graph with N nodes and M edges. Every edge has a weight. There can be multiple edges... |
Rio and Inversion One day Rio was returning home from his university and unfortunately lost his phone on the way. He a... |
StackLang StackLang is a stack-based programming language. Here, each program contains a series of commands th... |
Hamming Distance Hamming distance between two binary strings of equal length is the number of mismatches between ever... |
GCD and Sum Congratulations! You’ve been hired in “Buggy Software Ltd.” And you’ve been already given your first... |
Phi Numbers in Range! In number theory, Euler’s phi function, denoted as ϕ(n), is an arithmetic function which counts the ... |
Yet Another Xinversion The problem statement is simple. You are given a rooted tree (1 is the root) and every node has a co... |
Making Football Teams There are N football teams and each team has a positive number of players. You are given Q queries. ... |
A Super Easy Problem - "Array Query" Let's get into the problem directly without much description this time :D . You are given an array A... |
Maintain the Queue “Ajob Desh” is a strange country. Anyone who wants to buy train tickets need to go to the railway st... |
Dengue Affected Areas Dengue, the talk of the town of Dhaka this year. So many people suffered from dengue fever and a num... |
Crayons Five friends A, B, C, D and E has come to a shop to buy crayons for their art project. They need cra... |
Distinctness A substring of string S is another string S' which occurs in string S. For example: S = aaba and one... |
Smart Query Handler Bit operators perform bit-wise operations between two binary numbers. Wikipedia says, binary operati... |
Other Categories
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
