Graph Traversal Problems
Tree Queries You are given a tree of n vertices. Each vertex contains an integer. Vertex 1 is the root of the tre... |
Unfair Robot Race Two teams of robots, Team A and Team B, are racing in a 2D grid. There will be a total of 6 rounds. ... |
Village Fair 2 There are N houses in a village far away from here. They are numbered from 1 to N. For this problem ... |
War in the Wizarding World There is a deadly war going on between two countries (Bitland and Byteland) in the wizarding world. ... |
Wizard Duel Wizard Duel is approaching soon in Hogwarts and the students of the Dueling Club are absolutely thri... |
XOR Tree You are given a tree with N vertices. A tree is a connected undirected graph without cycles. The tre... |
Yet Another XOR Problem Given a rooted tree with N nodes where each node has a value, find a pair of nodes (u, v) so that u ... |
Zoba the Misleader Zoba has 3 strings, named S1, S2 and S3. He wanted to make a tough problem for Mihaf with these s... |
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
