## HappinessIf you have a Tk 100 in your wallet, what would you do? You might have couple of ways to spend that ... |

## LIDSWe all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ... |

## Alice in CandylandAlice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D g... |

## Counting MurgisEver since that wicked thief took away some of her murgis (hens, that is), Meena was ever anxious th... |

## Third DimensionMr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across... |

## Messy TableAkib is a very good student but his reading table is very messy. One Friday afternoon, Akib is sitti... |

## Easy Sequence 1Let’s define an easy sequence F. Where F(1)=1 F(1) = 1 F(1)=1 F(2X)=F(X)2+1 F(2X) = F(X)^2 + 1 F(2X)... |

## Help ChokroPias and Chokro are good friends. Pias's birthday is coming soon. So, Chokro wants to gift Pias an a... |

## Subset ANDYou are given an array A of n integers and an integer k. You need to find if there is any non-empty ... |

## Happy Sub-SequenceRecently Alex has participated in a programming contest. He became 1st runner up. He couldn't solve ... |

## T5 RacingIt is high time for the annual T5 racing and your team is planning to win the race. In T5 racing the... |

## Gaaner KoliThe protagonists of this problem are two great programmers of a certain institution Omanush and Ordi... |

## Harry Potter and the Vault of Gringotts"There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Seco... |

## OCD Returns!This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o... |

## The Perfect CollectionGiven an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR... |

## Subarray SumYou are given an array having N integers. You have to select at most K positions in the array and re... |

## Maximum SumLittle Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,... |

## Sticking PinsYou are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ... |

## Very Dirty StringStrings are difficult, most of the contest programmers say this and try to avoid string algorithms. ... |

## Smart Feature Phone 2Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA. ... |

## Orchid DivisionQuido has a square orchard full of various fruit and nut trees. The trees are planted in regular row... |

## Paying BillsMued is finally home for summer vacation after surviving yet another semester of the mighty CS Under... |

## Easy Sequence 2Let’s define a easy sequence F. Where F(1)=1 F(1) = 1 F(1)=1 F(2X)=F(X)2+1 F(2X) = F(X)^2 + 1 F(2X)=... |

## Dominoes ForeverOnce when I was little, my father took me to a tobacco shop! It is surprising, but true. He asked th... |

## Pathetic Interview IIYou all know about the story of Pathetic Interview-I. Today, I am sharing a story of my close friend... |

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.