The deadline was in November 2021, so the shelter had to move out. Some of the most recommended topics of Data Structures and Algorithms for Google Kick Start are listed below: Furthermore, try to solve Easy-Medium problems on the above topics in a short amount of time. You may use any editor or development environment, including those made available online, as long as your code is not accessible to others. Anyway if you would be able to do that fast (so it would easily fit into codeforces contest) the rating might possibly probabli be somewhere between purpble to red (the range you told). Zone 1 (Central London) --- 19. In this HackerRank Forming a Magic Square. Sort + Fenwick, http://www.spoj.com/problems/DCEPC206/ (3) //NICE & EASY, http://www.spoj.com/problems/KOPC12G/ (4) //N Fenwick trees, http://www.spoj.com/problems/TRIPINV/ (4) //2xFenwick (triples counting), http://codeforces.com/contest/597/problem/C (4) //[VERY NICE] 11*Fenwick, http://codeforces.com/contest/12/problem/D (4) //NICE [triplet-comparing][sort], https://www.spoj.com/problems/NARHIL/ // Sugested by ak07_, https://toph.co/p/play-the-lottery (7) //[VERY NICE][D&C][MODULAR], Gym 100960C [2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest], https://www.codechef.com/problems/POLYEVAL, http://codeforces.com/contest/827/problem/E (8) //MAGIC, http://www.spoj.com/problems/MAXMATCH/ 5 //abc hamming, https://www.spoj.com/problems/DISGRAPH/ (5) //Stoer-Wagner [global], https://codeforces.com/gym/101981 I //[NICE], http://codeforces.com/gym/101982 E //[VERY NICE][GRID], http://codeforces.com/gym/101845/problem/F (4) //Basic, http://codeforces.com/gym/101908/problem/G (4) //[NICE][MATCHING][BS], http://www.spoj.com/problems/FASTFLOW/en/ //Raw (no sauce), http://codeforces.com/contest/78/problem/E (5) //NICE [Matching-like][+BFS], 4322 Destroying the bus stations (Live Archive), 11380 Down Went The Titanic (UVA) //Interesting grid problem, 6395 Surely You Congest (LA) //VERY NICE [slightly advanced], http://codeforces.com/gym/100963 (Flame of Nucleus F), 11167 Monkeys in the Emei Mountain //Also harder (imho), http://codeforces.com/problemset/problem/653/D (+BS), https://www.deadline24.pl/assets/problemsets/dl24.elim.2017.B.en.pdf (DEADLINE 24 problem not sure if it can be submited :O), http://codeforces.com/problemset/problem/727/D, http://codeforces.com/problemset/problem/704/D [Also advanced], 4957 Fake scoreboard (LA) //If I remember well, other solutions was also possible, 1155 Power Transmission (LOJ) //(classical), https://www.codechef.com/problems/ROBOTDAG //Ford-Fukherson, 11506 Angry Programmer (UVA) //Nodes division, 10092 The Problem with the Problem Setter, Problem B. Roller Coaster Scheduling (GCJ 2017), 5905 Pool construction (LA) //Imho harder, http://codeforces.com/contest/808/problem/F 6 //NICE nontrivial (max matching with bigger flows), http://codeforces.com/contest/847/problem/J 6 //Probably not flows matching-like, http://www.spoj.com/problems/ADAHOSE/ [DUAL-GRAPH], http://codeforces.com/contest/903/problem/G (6) //[VERY NICE][SEG-TREE][CUT], http://www.spoj.com/problems/ADABLOOM/ //Maximum matching in general graph, 11439 Maximizing the ICPC //Maximum matching in general graph, 1376 Animal Run //Max flow on planar graph (Dual == shortest path over edges), 10989 Bomb, Divide and Conquer //Stoer-Wagner global cut, https://codeforces.com/contest/1202/problem/B (3) //[VERY NICE], http://codeforces.com/gym/101845/problem/C, https://www.urionlinejudge.com.br/judge/en/problems/view/2676 (3) //simple FW, http://codeforces.com/problemset/problem/21/D, http://www.spoj.com/problems/INGRED/ //+DP, Gym 101223C [2017 Facebook Hacker Cup, Round 1] //+DP, http://www.spoj.com/problems/ARBITRAG/ //Other algos shall work too, http://www.spoj.com/problems/ROHAAN/ (3) //Classical, http://codeforces.com/contest/25/problem/C (4) //Adding new edges .. need FW principal, http://codeforces.com/contest/33/problem/B (3) //NICE [dijkstra could work too], http://www.spoj.com/problems/ADAGAME/ [DP], https://codeforces.com/contest/1194/problem/D (4) //[OBSERVATIO][PATTERN], https://codeforces.com/contest/1191/problem/E (4) //[NICE][IF][OBSERVATION], https://www.spoj.com/problems/HUSGAME/ (4) //[VERY NICE][OBSERVATION][RECURSION], https://www.spoj.com/problems/IBIGAME/ (5) //[VERY NICE][OBSERVATION][DP], https://codeforces.com/gym/102058/problem/F (4) //[NICE], http://codeforces.com/gym/101801 F //[EASY][OBSERVATION][NIM], http://codeforces.com/gym/101908/problem/B (5) //[NICE][NIMBERS][OBSERVATION], http://codeforces.com/gym/101873 H //[VERY NICE][OBSERVATION][TREE] //LUP LUP, http://codeforces.com/gym/101808/problem/I (5) //[DP][OBSERVATION], http://codeforces.com/contest/919/problem/F (6) //[NICE][HARD][IMPLE][BFS][TOPO][GRAF], http://codeforces.com/contest/918/problem/D (4) //[NICE][DAG][DP][TREE], http://codeforces.com/contest/914/problem/B (3) //[NICE][EASY][OBSERVATION][PARITY], http://codeforces.com/contest/148/problem/D (4) //[EASY][DP][PROBABILITY], http://codeforces.com/contest/138/problem/D (7) //[VERY NICE][DP][OBSERVATION], https://arc087.contest.atcoder.jp/tasks/arc087_c (5) //[VERY NICE][TRIE][SEQUENCE], http://codeforces.com/contest/120/problem/E (3) //[NICE][SYMETRY][PARITY], http://codeforces.com/contest/88/problem/E (5) //[VERY NICE][PREFIX-XOR][NIMBERS][SQRT][MATH], http://codeforces.com/contest/69/problem/D (4) //[NICE][DP] Reflection can be ignored, http://codeforces.com/contest/55/problem/C (4) //[NICE] Size of piece from border, http://codeforces.com/problemset/problem/255/E --MEX, https://devskill.com/CodingProblems/ViewProblem/91, https://devskill.com/CodingProblems/ViewProblem/364, http://www.spoj.com/problems/VECTAR11/ 4 //Nsqrt(N) passes [with break], http://codeforces.com/contest/768/problem/E (4) //NICE Grundy, http://www.spoj.com/problems/SYNC13C/ (4) //2*DP {maybe not seeing sth}, http://codeforces.com/contest/787/problem/C (4), http://codeforces.com/contest/794/problem/C (3) //Find optimal strategy: choose back/front, http://codeforces.com/contest/794/problem/E (5) //NICE Find stategy: Even/Odd, http://codeforces.com/contest/812/problem/E (7) //Advanced NIM strategy, http://www.spoj.com/problems/GAMEMVS/ (4) //Nimbers (Ai^X)<=Ai, http://www.spoj.com/problems/PLAYGAME/ (3) //Check pattern, http://www.spoj.com/problems/CHAOS_CC/ (4) //VERY NICE [nimbers], http://codeforces.com/contest/851/problem/E (5) //Very nice [nimbers] [bitset], http://www.spoj.com/problems/CHGROOM/ (4) //+Factorisation [NICE & Easy]: Win unless 2 prime factors, http://www.spoj.com/problems/EALP1/ (4) //NICE ~ Possible Moves of NIM, http://www.spoj.com/problems/GAME3/ (4) //VERY NICE pattern watching [A145812], http://www.spoj.com/problems/GAME2/ (5) //VERY NICE https://community.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm338 (CAKE), http://www.spoj.com/problems/CF36D/ (5) //Pattern watching (care for 1), http://codeforces.com/contest/15/problem/C (4) //VERY NICE [XOR: A,1,A+1,0..repeat], http://codeforces.com/contest/39/problem/E (4) //Slightly [DP][MATH][ROUNDING], http://codeforces.com/contest/63/problem/E (5) //[NICE][BITMASK-DP], http://codeforces.com/gym/100923/problem/C, Gym 100962A [2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest][NICE], https://codeforces.com/contest/1199/problem/B (2) //[NICE][SIMPLE], https://codeforces.com/gym/101991/problem/J (5), https://codeforces.com/gym/101991/problem/B (4), https://codeforces.com/gym/102006/problem/I (4) //[VERY NICE][ITERATIVE], https://codeforces.com/gym/102021 G //[3D], https://codeforces.com/gym/102021 B //Path on circle, https://codeforces.com/gym/102058/problem/K (3) //[BRUTE-FORCE][FAIL], https://codeforces.com/gym/101972/problem/C (4) //[EASY][POINTS DISTANCE][IMAGE], http://codeforces.com/gym/101628/problem/C (4) //Circles intersection. Let's look at two adjacent suffixes in the sorted order (order of the suffix array). http://codeforces.com/contest/37/problem/C (4) //NICE Prefix dictionary [or math], http://codeforces.com/gym/101628/problem/K (5) //[NICE][IMPLEMENTATION], 8015 Alice and Bob play Contact (5) //[VERY NICE] 1stBob, http://www.spoj.com/problems/TRYCOMP/ (4), 10860 UVA (4) //DP + Trie [nice slightly generic], http://www.spoj.com/problems/DICT/ (4) //Sample trie but slightly weak/wrong data-set, https://www.urionlinejudge.com.br/judge/en/problems/view/2810 (5) //[NICE][DOUBLE], Gym 100818E [2015-2016 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2015)]. If nothing happens, download GitHub Desktop and try again. All suffixes are as follows. (N*log(N)*100 ), http://codeforces.com/contest/811/problem/E (6) //VERY NICE DSU (easier Timofey + animals), http://codeforces.com/contest/817/problem/F (7) //10^18 + MEX ~~ NICE yet problematic, http://codeforces.com/contest/816/problem/B (3) //Or offline trick makes it easier, http://codeforces.com/contest/834/problem/D (5) //+Dynamic Programming | NICE, http://www.spoj.com/problems/SBO/ (5) //preLast last (-1), last now (+1) VERY NICE, http://www.spoj.com/problems/GOODE/ (5) //NICE: Inversion + L-Mex, http://www.spoj.com/problems/CNTPRIME/ (3) //ST+Sieve (short range), http://www.spoj.com/problems/SEGSQRSS/ (4) //NICE {weak data} ~~ SQRT works too, http://www.spoj.com/problems/MON2012/ (5) //NICE [Online][10^9 Range], http://www.spoj.com/problems/PARSUMS/ (4) //But other approaches work too, http://www.spoj.com/problems/THRBL/ (4) //Simple SA maximum on range <= A[a], http://www.spoj.com/problems/HORRIBLE/ (3) //Totally classical, http://www.spoj.com/problems/MULTQ3/ (4) //NICE (interesting operation), http://www.spoj.com/problems/PERMPATT/ (4) //NICE [minimum][+IDEA], http://codeforces.com/contest/869/problem/E (5) //NICE 2D [random][XOR], http://codeforces.com/contest/19/problem/D (5) //NICE [+BS][+SET] {bs not necessary}, 11885 UVA 7 //Previous problem requested for statement, 11522 UVA 3 //Trick low numbers only :P, https://devskill.com/CodingProblems/ViewProblem/577 (4) //[NICE][TWO POINTERS], https://www.spoj.com/problems/EVENSEMIP/ (5) //[VERY NICE][SEGMENTED], http://codeforces.com/gym/101982 H //[GOLDBACH], http://codeforces.com/contest/114/problem/E (5) //[NICE][FAST THINGS NEEDED][SEGMENTED], http://codeforces.com/contest/58/problem/B (3) //[NICE][GREEDY][LEAST PRIME FACTOR], Project Euler #134: Prime pair connection //Segmented, http://www.spoj.com/problems/TDPRIMES/ (4), http://www.spoj.com/problems/VECTAR8/ (3), http://www.spoj.com/problems/NFACTOR/ (4), http://www.spoj.com/problems/HS08PAUL/ (4) //simply generate, http://codeforces.com/contest/776/problem/B (3) //Easy trict: PM-1/ELSE-2, http://www.spoj.com/problems/GGD/ (4) // N/lowestDiv*(lowestDiv-1), http://codeforces.com/contest/822/problem/D (4) //DP + Lowest factor, http://www.spoj.com/problems/NGIRL/ (4) //Squares Primes + BS == Easiest, http://www.spoj.com/problems/PTRI/ (5) //Very fast sieve necessary:/, http://www.spoj.com/problems/AFS/ (3) //Sum of divisort + DP, http://www.spoj.com/problems/BSPRIME/ (4) //Very fast sieve needed, http://www.spoj.com/problems/DCEPC505/ (4) //NICE at most 10527450, http://www.spoj.com/problems/CUBEFR/ (3) //NICE Sieve out k^3 numbers, http://www.spoj.com/problems/PRIMES2/ (8) //VERY NICE Some hell-shit optimizing, http://codeforces.com/contest/26/problem/A (2) //Easy many ways to solve it, https://codeforces.com/contest/1180/problem/C (4) //[MODULO][QUEUE], https://codeforces.com/gym/102001/problem/F (4) //[NICE][GREEDY], https://codeforces.com/gym/101991/problem/D (4) //[NICE][NORMALIZE][PREFIX], https://codeforces.com/gym/102021 L //[NICE][JUST DO IT], https://codeforces.com/gym/102021 D //Try one and see, https://codeforces.com/gym/101972/problem/K (3) //[EASY][STRINGS], http://codeforces.com/gym/101962/problem/K (3) //[NICE] //Complexity, http://codeforces.com/gym/101650 A //[VERY NICE][TREAP][PROBABILITY], http://codeforces.com/gym/101650 K //[NICE] //Perhaps weak TC, https://abc084.contest.atcoder.jp/tasks/abc084_c (3) //Brute-Force, http://codeforces.com/contest/908/problem/B (2) //[EASY][NICE], http://codeforces.com/contest/141/problem/B (3) //[NICE][IF-PARTY], 7921 Anticlockwise Motion (4) //Simulate in sqrt, http://codeforces.com/contest/129/problem/B (2) //Graph, http://codeforces.com/contest/903/problem/B (2) //[NICE], http://codeforces.com/contest/120/problem/C (1), http://codeforces.com/contest/118/problem/A (1), http://codeforces.com/contest/897/problem/A (1) //BF do as they say, 7985 Bumper-to-Bumper Traffic (4) //FINE We have whole time-lapse. By using our site, you (BIG%9), 10844 UVA 4 //Bell numbers + big (might be slightly slow! Because the suffixes are sorted, it is clear that the current suffix $p[i]$ will give new substrings for all its prefixes, except for the prefixes that coincide with the suffix $p[i-1]$. 13172 UVA (5) //6*DJ per query + permutations, 10816 UVA (4) //Easy Linear-Search by answer + DJ with path, http://codeforces.com/contest/827/problem/F 7 //Very nice Even&Odd, http://www.spoj.com/problems/DELIVER/ (5) //Normalize coordinates + Optimalize, http://www.spoj.com/problems/CCHESS/ (4) //Dijkstra as knight, https://codeforces.com/contest/1175/problem/F (7) //[VERY NICE][HASH][RANDOMISATION], https://codeforces.com/contest/1181/problem/E2 (7) //[VERY NICE][SORTING][ST], https://codeforces.com/contest/1181/problem/E1 (5) //[VERY NICE][OBSERVATION][SORTING], https://codeforces.com/gym/102058/problem/G (7) //[VERY NICE][BS][PRIORITY_Q], http://codeforces.com/gym/101845/problem/L (6) //[VERY NICE][INDUCTION], http://codeforces.com/gym/101801 J //[NICE][TRIE][RMQ], 8257 Factor-Free Tree LA //[VERY VERY NICE][PRIMES][FACTOR], https://www.urionlinejudge.com.br/judge/en/problems/view/1683 (4) //RAW histogram, http://codeforces.com/contest/817/problem/D (5) //Very nice NlogN, http://www.spoj.com/problems/DYNACON2/ (8) //Lesser hell offline Nlog(N) /or/ NlogN^2, http://codeforces.com/contest/876/problem/F (5) //VERY NICE Find greatest + next/back functions, https://codeforces.com/contest/1176/problem/D (4) //[NICE][GREEDY][SORTING], https://atcoder.jp/contests/abc136/tasks/abc136_e (5) //[NICE][GREEDY][DIVISORS], https://codeforces.com/contest/1183/problem/F (5) //[VERY NICE][SORTING][OBSERVATION][BF], https://www.spoj.com/problems/KPOWERSUM/ (4) //[FACTORISATION], http://codeforces.com/gym/101992/problem/D (5) //[VERY NICE][IE][NUMBER THEORY], http://codeforces.com/gym/101982 B //[FACTORISATION][GCD][SIEVE], http://codeforces.com/gym/101864 G //[VERY NICE][FACTORISATION][GCD], http://codeforces.com/gym/101840 D //[EVENTS][NICE], http://codeforces.com/gym/101741/problem/F (6) //[NICE][PROBABILITY][GCD], http://www.spoj.com/problems/FRNDAM/ (3) //Simply find sum of all divisors (low constraints), http://codeforces.com/contest/920/problem/F (5) //[NICE][FAST FALL][SET][DIVISORS], 7726 A Simple Math Problem (4) //TLE if naive (consider only divisors), http://codeforces.com/contest/112/problem/D (4) //[NICE] Last-position [FACTOR], http://codeforces.com/contest/75/problem/C (3) //[NICE][BS], https://www.hackerrank.com/contests/101hack38/challenges/easy-gcd-1/problem, https://www.codechef.com/problems/CHEFKEY, http://codeforces.com/problemset/problem/671/C, Gym 101411G [2009-2010 ACM-ICPC, NEERC, Western Subregional Contest], http://codeforces.com/problemset/problem/831/F, http://codeforces.com/problemset/problem/839/D, http://codeforces.com/problemset/problem/27/E, https://www.urionlinejudge.com.br/judge/en/problems/view/1164, http://codeforces.com/problemset/problem/803/F, http://www.spoj.com/problems/IITKWPCF/ //ll, http://codeforces.com/problemset/problem/703/E, https://www.hackerearth.com/problem/algorithm/harry-gets-into-infy/, http://www.spoj.com/problems/DIVSUM/en/ //SUM, https://codeforces.com/contest/1203/problem/F2 (6) //[VERY NICE][GREEDY][SORTING][CASES], https://codeforces.com/contest/1176/problem/F (5) //[NICE][IMPLE][SORTING], https://codeforces.com/contest/1200/problem/F (6) //[NICE][DFS][GRAPH][LCM][MATH], https://codeforces.com/contest/1201/problem/D (5) //[NICE][DP][IMPLE][CASES], https://www.spoj.com/problems/THECODE/ (4) //[BITMASK], https://codeforces.com/contest/1199/problem/F (5) //[NICE][DIMENSIONS], https://codeforces.com/contest/1183/problem/H (4) //[NICE][SUBSEQUENCE][NEXT], https://codeforces.com/contest/1183/problem/E (4) //[NICE][SUBSEQUENCE][NEXT], https://codeforces.com/contest/1178/problem/F2 (7) //[VERY NICE][OBSERVATION], https://codeforces.com/contest/1178/problem/F1 (5) //[NICE][MATH][REDUCTION], https://codeforces.com/contest/1178/problem/B (3) //[EASY]Not even real DP, https://codeforces.com/contest/1195/problem/C (3) //[EASY], https://codeforces.com/contest/1189/problem/F (6) //[VERY NICE][OBSERVATION], https://atcoder.jp/contests/agc035/tasks/agc035_d (5) //[VERY NICE][BIT][IDEA], https://www.spoj.com/problems/PLOVER/ (4) //[NICE][DIGITS], https://www.spoj.com/problems/NICESEQ/ (4) //[DIGITS][POSSIBLY FASTER], https://codeforces.com/gym/101981 L //[NICE], https://www.spoj.com/problems/RANDMOD/ (4) //[OBSERVATION][SEQUENCE], https://www.urionlinejudge.com.br/judge/en/problems/view/1592 (4) //[GRAPH], https://www.urionlinejudge.com.br/judge/en/problems/view/2824 (4) //Classical, https://codeforces.com/gym/102006/problem/D (4) //[NICE][OBSERVATION], https://codeforces.com/gym/102058/problem/D (5) //[NICE][DOMINATION], http://codeforces.com/gym/101992/problem/A (6) //[BITS][OBSERVATION], http://codeforces.com/gym/101628/problem/H (3) //[NICE][CLASSICAL][DAG], http://codeforces.com/gym/101628/problem/A (3), http://codeforces.com/gym/100112 J //[NICE][TREE], http://codeforces.com/gym/101982 D //[VERY NICE][BITS] //Window, http://codeforces.com/gym/101982 C //Classical combinatorics, http://codeforces.com/gym/101845/problem/E (5), https://www.codechef.com/problems/SPECTAC (5) //[NICE], http://codeforces.com/gym/101801 D //[VERY NICE][SEGMENT TREE][SORTING][NORMALIZE], http://codeforces.com/gym/101873 J //[NICE][IMPLEMENTATION][STRING][SUBSUBSET], http://codeforces.com/gym/101808/problem/D (7) //[NICE][OPTIMISATION][EFFICIENCY], http://codeforces.com/gym/101840 A //Doubles, DevSkills 475: Bunty's Xor Game (4) //[BITS][GAME THEORY], https://www.devskill.com/CodingProblems/ViewProblem/489 (5) //[NICE][FACTORISATION], DevSkills 534 (4) //[BITSET][COMBINATIONS], http://codeforces.com/gym/101650 D //Not hard more coding + printing, 13286 Ingredients (4) //[NICE][DAG] Classical, 8299 Bricks (5) //[NICE][COMBINATORICS][SORTING], http://codeforces.com/contest/934/my (4) //Subsequence, http://codeforces.com/contest/922/problem/E (5) //find max mana, http://codeforces.com/contest/920/problem/D (4) //[NICE][KNAPSACK-MODULO][GREEDY], http://codeforces.com/contest/919/problem/D (4) //[NICE][DFS][CYCLE][DAG], http://codeforces.com/contest/914/problem/C (3) //[DIGITS][BINARY], http://codeforces.com/contest/913/problem/E (5) //[NICE][EXPRESSION], http://codeforces.com/contest/148/problem/E (5) //[DP][PREFIX SUM][GREED], http://www.spoj.com/problems/PALMKR/ (4) //Classical palindrome + print + lexicography, http://codeforces.com/contest/146/problem/E (5) //[NICE][COMBINATORICS][OBSERVATION], http://codeforces.com/contest/909/problem/C (4) //[NICE][CLASSICAL][EASY], 7785 m-ary Partitions (4) //Combinatorics, http://codeforces.com/contest/133/problem/E (4) //[IMPLEMENTATION], http://codeforces.com/contest/126/problem/D (5) //[NICE]//Decomposet DP//Own hash-map, http://codeforces.com/contest/910/problem/B (3) //Or many other ways, 6154 RNA Secondary Structure (5) //[NICE] Unoptimal might work too, https://arc087.contest.atcoder.jp/tasks/arc087_b (4) //[VERY NICE][OBSERVATION], http://codeforces.com/contest/903/problem/F (5) //[VERY NICE][BITMASK][BRUTE], http://codeforces.com/contest/903/problem/A (2) //Easy knapsack-like // Low constraints, http://codeforces.com/contest/900/problem/E (4) //[NICE]//Patter-match: FFT or KMP or Brute-Force, http://codeforces.com/contest/118/problem/D (3) //[COMBINATORICS][LOW-CONSTRAINTS], http://codeforces.com/contest/115/problem/E (5) //[VERY NICE][SEGMENT TREE], http://codeforces.com/contest/116/problem/D (3) //CLASSICAL[LOW-CONSTRAINTS], 10128 Queue (uva) (4) //One possibility is bitmask second combinatorics, http://codeforces.com/contest/110/problem/C (3) //[EASY]// Greedy/math works too, 8078 Bracket Sequence (4) //[VERY NICE][DP-LINKS], http://codeforces.com/contest/106/problem/C (3) //[NICE][EASY], http://codeforces.com/contest/895/problem/C (4) //[NICE], 8024 Stack Construction (4) //[NICE] Palindromic style but not exactly, http://codeforces.com/contest/888/problem/F (6) //[NICE][FLAG], http://www.spoj.com/problems/ACQUIRE/ (5) //[NICE][CH-OPT], http://codeforces.com/contest/319/problem/C (6) //[NICE][CH-OPT], http://www.spoj.com/problems/NKLEAVES/ (5) //[NICE][DC], http://codeforces.com/contest/76/problem/D (4) //[BITS][OVERFLOW], http://codeforces.com/contest/73/problem/C (4) //[NICE][EASY][TRY-ALL-LETTERS], http://codeforces.com/contest/67/problem/C (4) //[NICE][LEAVENSTEIN], http://codeforces.com/contest/67/problem/A (3) //[EASY][PRINTING][OTHER POSSIBLE WAYS], http://codeforces.com/contest/55/problem/D (5) //[NICE][DIGITS][EFFICIENT], http://codeforces.com/contest/56/problem/D (4) //String modification + printing [NICE], http://codeforces.com/contest/58/problem/E (6) //[NICE][IMPLEMENTATION], https://devskill.com/CodingProblems/ViewProblem/21, https://devskill.com/CodingProblems/ViewProblem/37, https://devskill.com/CodingProblems/ViewProblem/71, https://devskill.com/CodingProblems/ViewProblem/103, https://devskill.com/CodingProblems/ViewProblem/107, https://devskill.com/CodingProblems/ViewProblem/115, https://devskill.com/CodingProblems/ViewProblem/126, https://devskill.com/CodingProblems/ViewProblem/131, https://devskill.com/CodingProblems/ViewProblem/134, https://devskill.com/CodingProblems/ViewProblem/174, https://devskill.com/CodingProblems/ViewProblem/186, https://devskill.com/CodingProblems/ViewProblem/201, https://devskill.com/CodingProblems/ViewProblem/338, https://devskill.com/CodingProblems/ViewProblem/368, https://devskill.com/CodingProblems/ViewProblem/392, https://devskill.com/CodingProblems/ViewProblem/399, https://www.hackerrank.com/contests/world-codesprint-5/challenges/mining //Opti, http://codeforces.com/problemset/problem/631/E //CH, https://devskill.com/CodingProblems/ViewProblem/6, https://devskill.com/CodingProblems/ViewProblem/11, http://codeforces.com/contest/729/problem/F 6, http://codeforces.com/contest/735/problem/E 9, http://codeforces.com/contest/731/problem/E 5, http://codeforces.com/contest/721/problem/E 7, http://codeforces.com/contest/742/problem/D 4, http://codeforces.com/contest/712/problem/D 5, http://codeforces.com/contest/743/problem/E 6, http://codeforces.com/contest/745/problem/E (7), http://codeforces.com/contest/747/problem/F (5), http://codeforces.com/contest/752/problem/E (5), http://codeforces.com/contest/703/problem/E (7), http://codeforces.com/contest/722/problem/E (9), http://codeforces.com/contest/760/problem/F (8), 11451 UVA (4) //C==20 mistake in statement, http://codeforces.com/contest/762/problem/D 5, 11081 UVA (4) //3 string subsequences (beware of fail), http://codeforces.com/contest/678/problem/E (5) //bitset dp + probability, http://codeforces.com/contest/766/problem/C (4), http://codeforces.com/contest/667/problem/C (3), http://www.spoj.com/problems/MOVIFAN/ (3), http://www.spoj.com/problems/ORDSUM23/ (3), http://www.spoj.com/problems/DIVSEQ/ (4) //N^3 (but better) works fine, http://codeforces.com/contest/633/problem/F (7) //Tree dp, http://www.spoj.com/problems/ADJDUCKS/ (4) sort + pick 2-3 continous O(N), http://www.spoj.com/problems/JLNT/ (4) //pick 0 or 2 | 1e3*5e3, http://www.spoj.com/problems/TPCPALIN/ (5) //500^3 works (3rd countable), http://www.spoj.com/problems/COLORSEG/ (4) //50^4==OK 50^4log(N)=TLE NICE, http://www.spoj.com/problems/POWERCAR/ (3) //1e3*1e3*2 follow rules, http://www.spoj.com/problems/INGRED/ (5) //TSP-like [reduce + go], http://www.spoj.com/problems/BADXOR/ (4) //classical subsets, http://www.spoj.com/problems/SPCO/ (5) //64*64*2 DP {OPT: prime O(1) + clear only half}, http://www.spoj.com/problems/WAYHOME/ (5) //NICE: 1) 1*1 b)12,1,**,2, http://www.spoj.com/problems/NFURY/ (2) //Minimal sum of squares, http://www.spoj.com/problems/GDIL/ (3) //combinatorics, http://codeforces.com/contest/791/problem/D (5) //Tree, http://codeforces.com/contest/791/problem/E (6) //V,K,X pick any, http://codeforces.com/contest/789/problem/C (3), http://codeforces.com/contest/796/problem/E (6) //NICE: N*P*K*K (WC can't happen!
Daniel Mancini Sunday Sauce,
Plastic Texture Pack Minecraft Bedrock,
Production Director Resume,
Google Is An Example Of Which Type Of Website?,
Does Bukkit Work With Bedrock,
Atlanta Dekalb Carnival 2022 Cancelled,