Neat Brackets Given a sequence of opening and closing parentheses ("(" and ")") you will have to determine if it i... |

Tree Queries You are given a tree of n vertices. Each vertex contains an integer. Vertex 1 is the root of the tre... |

Do You Know Tree ? "Stay at least one metre distance from others.” Corona has affected the World as well as Bangladesh.... |

City of Burgerland Have you ever heard of The Burgerland City? The city is full of burger shops. You will surely find s... |

Not As Hard As It Seems Sakib and Shamim are good friends. As Sakib is a little naughty, every night before exam he disturbs... |

Matching Brackets You will be given a sequence of opening and closing brackets of different types ((, ), [, ], {, and ... |

Rio and Inversion One day Rio was returning home from his university and unfortunately lost his phone on the way. He a... |

Find the Good Sequence Let's say two numbers are called "good" if their difference is at least 2. Similarly, a sequence is ... |

Dengue Affected Areas Dengue, the talk of the town of Dhaka this year. So many people suffered from dengue fever and a num... |

Counting Friends Johnny uses a social network called Supernova. Unlike the other social networks, Supernova does not ... |

Taju Kage Bunshin No Jutsu Naruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses... |

Set Union Given two sets of integers, print the set containing the union of the two input sets. For example, g... |

Data Structure The operations that are performed in a data structure can be categorized into two types: query and u... |

Easy Prime! There are N numbers in an array. You will have Q queries. In each query, you can make 2 operations. ... |

United State of Koanhali Koanhali is a strange country. The govt. of Koanhali maintain the marriages of this country. If you ... |

Mr Max Count Sum Mr Max , Mr Sum and Mr Count are three neighbours. They have a common enemy, an old man living in th... |

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 ... |

Distinctness A substring of string S is another string S' which occurs in string S. For example: S = aaba and one... |

Final Days of Goldfinger We see agent Bond once again being called in time of a great need. The vile criminal Auric Goldfinge... |

Smart Query Handler Bit operators perform bit-wise operations between two binary numbers. Wikipedia says, binary operati... |

Distinct Dishting You are given an array of $N$ integers. Then there will be $Q$ commands of the following type: Cha... |

Primary Key "Clarity-Lon" is the new awesome e-commerce based startup that went to the top of the chart within f... |

Earthquake! Most houses are not as safe as they could be. Earthquake engineering is an interdisciplinary branch ... |

Expandable ListView Minas is working on his new language. He want to add a feature call expandable listview. Here he exp... |

New Year Couple The new year 2017 is here. To celebrate the 31st night, Mr Rio has thrown a big party at his house. ... |

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

Toph uses cookies. By continuing you agree to our Cookie Policy.