Ad-hoc Problems
Neat Brackets Given a sequence of opening and closing parentheses ("(" and ")") you will have to determine if it i... |
Delete the Array There is an array of size n. You will be given an integer x. In each move you have to subtract x or ... |
ASCII Progress Bar In this problem, you need to write a code that prints an ASCII progress bar. In each test case, you ... |
Little Subarray Sum Given an array of N numbers and two indices, determine the sum of the numbers in the array between (... |
Caesar Cipher Byang wants to write a secret message to his friend. He has recently discovered Caesar Cipher. Caesa... |
Tidy Bits Read an integer variable, and determine the smallest positive integer that has the same number of 1s... |
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
