Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results1,020 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| ResistanceGiven three color names, map each to its digit or multiplier using a fixed table and print the resulting resistance value. | Easy1 | Hash mapImplementation | No attempts yet | 2s | 128 MB | Judgeable |
| Grade Point CalculationRead a letter grade string and print its corresponding fixed grade point value from a lookup table. | Easy1 | ImplementationHash map | No attempts yet | 1s | 128 MB | Judgeable |
| RemaindersRead ten nonnegative integers, compute each mod 42, and print how many distinct remainder values occur. | Easy1 | Hash mapImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Sum of Missing CharactersFor each string, sum the ASCII values of uppercase letters that never appear in it. | Easy1 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| BillingRead item names until EOI and print the total cost of all listed supplies with a dollar sign and two decimals. | Easy1 | Hash mapImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| TulipsRead n beds, collect the distinct catalogue numbers present, and print 15000 minus that count. | Easy1 | ArrayHash map | No attempts yet | 1s | 128 MB | Judgeable |
| Letter BankDecide whether the second word uses exactly the letters of the first word, each at least once. | Easy1 | Hash mapString | No attempts yet | 1s | 128 MB | Judgeable |
| Golden Khon KaenCount how many times the word GOLDEN can be formed from each given string of capital letters. | Easy1 | Hash map | No attempts yet | 10s | 64 MB | Judgeable |
| KBO Korean Series Champion NumberGiven the Korean name of a KBO team that won the Korean Series, print the number assigned to that team. | Easy1 | ImplementationString+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Final ScoreGiven the rosters of two teams and the names of the goal scorers, count each team's goals and decide which team scored more. | Easy1 | Hash mapImplementation+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Most Frequent LetterCount letter frequencies in a string, case-insensitively, and print the most common letter in uppercase or a question mark on ties. | Easy2 | Hash mapString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Basketball GameGiven N surnames, count first letters and print all letters (in order) that start at least five surnames, or PREDAJA if none does. | Easy2 | Hash mapImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Most Frequent LettersCount lowercase letter frequencies across up to 50 lines of text and print all letters tied for the highest frequency in alphabetical order. | Easy2 | Hash mapString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| EarringsGiven girl names and 2n-1 confiscation/return records tagged with a number and a letter, find the girl whose number appears only once and thus never got her earring back. | Easy2 | Hash mapArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Making AnagramsGiven two lowercase words, compute how many letters must be deleted in total so their remaining letters match as multisets (anagrams). | Easy2 | Hash mapString | No attempts yet | 2s | 128 MB | Judgeable |
| Anagram DistanceGiven many word pairs, count letters to delete from both so their letter frequency histograms match, using character counts. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Prerequisites?Given Freddie's chosen courses and category minimums, check whether each category has at least the required number of his courses. | Easy2 | ImplementationHash map+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Time ZonesGiven a time and two time zone abbreviations, compute the equivalent wall-clock time in the second zone. | Easy2 | ImplementationMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Hay PointsSum dictionary values of words appearing in each job description line block until a single period terminates it. | Easy2 | Hash mapString | No attempts yet | 1s | 128 MB | Judgeable |
| BabelfishBuild a foreign-to-English word dictionary from the input, then translate each foreign word in the message, printing eh for unknown words. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Keyboard Shifted One Key RightReplace every character of each input line with the key immediately to its left on a QWERTY keyboard, leaving spaces unchanged. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Refrigerator MagnetsRead lines until END and print each line that contains no repeated letter, ignoring spaces. | Easy2 | ImplementationString+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Mirror ImageFor each word until the terminator '#', print the string reversed with each letter replaced by its mirror image, or INVALID if any letter lacks a mirror. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| DoublesFor each list of 2 to 15 natural numbers ending in 0, count how many values x have 2x also in the same list. | Easy2 | ArrayHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Travelling SalesmanCount the distinct town names in each week's list and report the total for that week. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| NoMoPhobiaFor each week, sum de-merit points for each student from misdemeanor codes and list those reaching 100, in first-appearance order. | Easy2 | Hash mapImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Bailout BonusGiven a list of bailed-out companies, a tax rate, and executives with company and bonus, sum the floor of the taxed fraction for executives at bailed companies. | Easy2 | ImplementationHash map+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Contest SeatsCount how many participants fail to get their chosen seat, since only the first arrival for a seat can sit there. | Easy2 | ImplementationHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Chess PuzzleFor each board, read the rook coordinates and report SAFE if no two rooks share a row or column, otherwise NOT SAFE. | Easy2 | ImplementationHash map+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Checkerboard RowsFor each of B boards, read n pieces given as column-row pairs and print the largest number of pieces sharing the same row. | Easy2 | ArrayHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Total CountRead fighter names until a line with 0, print each name with its kill count in first-appearance order, then the grand total. | Easy2 | Hash mapImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| PangramRead sentences until a line holding a single asterisk, and print Y if a sentence contains all 26 lowercase letters, otherwise N. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Breed ProximityGiven a line of N cows with breed ids, find the largest breed id whose two occurrences lie within K positions of each other, or -1 if none exist. | Easy2 | ArrayHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Getting ChordedGiven three note names, decide whether their semitone spacing forms a major or minor chord, then print the echo with the root-named chord or "unrecognized". | Easy2 | ImplementationMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Ballot EvaluationSum the given parties' vote percentages and check the sum against an integer n using the guess's comparison operator. | Easy2 | Hash mapImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Deli DeliFor each of N words, apply the first matching pluralization rule from a list of irregular forms and four suffix rules, then print the result. | Easy2 | StringHash map+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Rotating LettersGiven a single uppercase word, decide whether every letter belongs to the set of seven letters that look the same after a 180-degree rotation. | Easy2 | StringImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| I Speak TXTMSGRead lines until TTYL, map each known short form through a fixed table, and echo other lines unchanged. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Anagram CheckerDecide whether two phrases are anagrams, ignoring spaces and letters only. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Snow CallsConvert each alphanumeric phone number to digits, keep the first 10 digits, and print them in xxx-xxx-xxxx form. | Easy2 | StringImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| AnagramsGiven two lowercase words, decide whether one can be rearranged into the other, and print the result with the words. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| CardsA 52-card deck is missing exactly one card; given the other 51 cards as suit and value pairs, output the missing suit and value. | Easy2 | ArrayHash map+2 | No attempts yet | 1s | 1024 MB | Judgeable |
| EntropyRead one line of text, count how often each character appears, and print the Shannon entropy rounded to three decimals. | Easy2 | Hash mapMath+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Untied AirlinesRead each flight's complaint codes, sum the points per passenger, and count how many passengers reach 200 points. | Easy2 | ImplementationHash map | No attempts yet | 1s | 128 MB | Judgeable |
| How Many Distinct LettersFor each line until the terminator '#', count how many distinct alphabet letters appear, ignoring case and non-letters. | Easy2 | StringImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Ant NamesGiven up to 100 lowercase names, print the maximum number of distinct letters found in any single name. | Easy2 | StringImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Guess the SongGiven the title words and the lyrics in order, find the earliest lyric position where at least half of the distinct title words have appeared. | Easy2 | SimulationHash map | No attempts yet | 1s | 128 MB | Judgeable |
| Morse CodeDecode each test case of five space-separated Morse codes into five uppercase letters or digits. | Easy2 | Hash mapString | No attempts yet | 1s | 128 MB | Judgeable |
| Ironclad Security AlgorithmYou invert the word permutation defined by the two public keys and apply it to the ciphertext to recover the plaintext. | Easy2 | Hash mapArray | No attempts yet | 1s | 256 MB | Judgeable |
| MarathonerCount the listed students who finished within 6 hours and report the fastest one, breaking ties by race result order. | Easy2 | ImplementationHash map | No attempts yet | 2s | 64 MB | Judgeable |
| Length and Frequency of SentencesCount the words in each of N sentences and report how often each length occurs in ascending order. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Cuckoo for HashingSimulate cuckoo hashing insertions into two mod-indexed tables with displacement and print the final table contents. | Easy2 | SimulationHash map+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Maximum FrequencyGiven N integers, count how many times each value appears and print the largest count. | Easy2 | Hash mapArray | No attempts yet | 2s | 1024 MB | Judgeable |
| Word PuzzleDecide for each pair of strings whether the gathered letters can be rearranged to form the original word. | Easy2 | Hash mapString | No attempts yet | 3s | 256 MB | Judgeable |
| Assigning PartnersYou check that every positional pairing is mutual and no student is paired with themselves. | Easy2 | Hash mapImplementation | No attempts yet | 1s | 256 MB | Judgeable |
| Pangram CheckerCount how many times each English letter appears in every sentence and print its pangram grade. | Easy2 | StringHash map | No attempts yet | 3s | 256 MB | Judgeable |
| Wait TimeReconstruct message timestamps from the log and sum each friend reply wait time, reporting -1 for a friend with an unanswered message. | Easy2 | SimulationHash map | No attempts yet | 1s | 256 MB | Judgeable |
| Kkung's Girlfriend PlanEach test case gives named condition times and AND-OR combos, and the answer is the smallest combo time where one combo takes its slowest condition. | Easy2 | ImplementationHash map+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Letter CookiesGiven the letters in a box, decide for each query word whether its letters can all be taken from the box. | Easy2 | Hash mapString | No attempts yet | 1s | 256 MB | Judgeable |
| Marko's T9 inputCount how many dictionary words map letter by letter to the given T9 digit string. | Easy2 | StringHash map | No attempts yet | 2s | 64 MB | Judgeable |
| Cities Alice has visitedCount how many different city names appear in each trip log. | Easy2 | Hash map | No attempts yet | 1s | 256 MB | Judgeable |
| Odd Man OutGiven an odd-length list of invitation codes where every value appears twice except one, find the value that appears once. | Easy2 | Bit manipulationArray+1 | No attempts yet | 5s | 512 MB | Judgeable |
| T9 Spelling (Small)Map each letter of a short message to its keypad digit and repeat count, inserting a space between consecutive letters that share the same key. | Easy2 | StringImplementation+2 | No attempts yet | 5s | 512 MB | Judgeable |
| A New AlphabetReplace each English letter with its fixed symbol string from a 26-entry table, leaving all other characters unchanged. | Easy2 | StringHash map+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Dangerous DiveGiven N volunteers and the R identifiers that returned, list the missing identifiers in ascending order, or print * if all returned. | Easy2 | ArrayHash map | No attempts yet | 2s | 512 MB | Judgeable |
| Lost BootsCount how many left-right pairs of boots share the same size, reading several test cases until EOF. | Easy2 | Hash mapImplementation | No attempts yet | 2s | 512 MB | Judgeable |
| HolesCount the holes in each of N lines of uppercase text, where B counts as two, A D O P Q R count as one, and the rest count as zero. | Easy2 | StringImplementation+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Country LeaderFor each test case, pick the name with the most distinct letters, breaking ties by lexicographic order where a space sorts before any letter. | Easy2 | StringSorting+2 | No attempts yet | 5s | 512 MB | Judgeable |
| String SetCount how many of M query strings appear in a given set S of N strings. | Easy2 | Hash map | No attempts yet | 2s | 1536 MB | Judgeable |
| Bovine Genomics (Bronze)Count genome positions where the set of characters in spotty cows and the set in plain cows do not overlap. | Easy2 | ImplementationBrute force+1 | No attempts yet | 2s | 512 MB | Judgeable |
| No DuplicatesRead a line of space-separated uppercase words and print yes if no word repeats, or no if any word appears more than once. | Easy2 | StringHash map+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Latin SquaresRead an n by n grid of base-n digit characters and report whether it is a Latin square, and if so whether it is in reduced form. | Easy2 | ImplementationArray+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Atomic MassParse a short chemical formula, look up each element's atomic mass, multiply by any following count, and print the total with two decimals. | Easy2 | StringHash map+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Kiwis vs KangaroosGiven a phrase, score each side by how often its letters appear in KANGAROO or KIWIBIRD, then report the higher score or a tie. | Easy2 | ImplementationString+2 | No attempts yet | 2s | 512 MB | Judgeable |
| PiratesGiven a lowercase word, find the letter with the highest frequency and print that letter with its count. | Easy2 | StringHash map+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Hash collision stringsPrint two length-N strings that differ but have equal Java String hashCode values, using the classic Aa/BB collision with a shared prefix. | Easy2 | StringHash map+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Poker HandGiven five distinct cards, report the largest number of cards sharing one rank. | Easy2 | Hash mapImplementation | No attempts yet | 2s | 512 MB | Judgeable |
| ElderTrack which wizard owns the Elder Wand after each duel and count how many distinct wizards ever held it. | Easy2 | SimulationImplementation+1 | No attempts yet | 1s | 512 MB | Judgeable |
| BagsGiven n waste pieces with identifiers, find the minimum number of bags so that each bag holds pieces of only one identifier. | Easy2 | Hash mapImplementation+2 | No attempts yet | 1s | 512 MB | Judgeable |
| CommandFor each of T strings, decide whether it has length 7 and its characters follow the exact pattern AABBABB with exactly two distinct letters. | Easy2 | StringImplementation+1 | No attempts yet | 0.5s | 256 MB | Judgeable |
| Pea Soup and PancakesRead each restaurant's name and menu, then print the first one serving both pea soup and pancakes, or a fixed fallback line if none does. | Easy2 | ImplementationString+2 | No attempts yet | 1s | 512 MB | Judgeable |
| BananaRead a dictionary mapping English words to Minionese words, then translate each of T sentences word by word. | Easy2 | Hash mapString+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Divisionals SpellingGiven n words and a contest with m questions labeled A onward, count how many words use only distinct letters from the first m letters. | Easy2 | ImplementationString+1 | No attempts yet | 1s | 512 MB | Judgeable |
| Student NumbersGiven N equal-length numeric strings, find the smallest suffix length k so that all suffixes of length k remain distinct. | Easy3 | StringBrute force+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Symmetric DifferenceGiven two sets of natural numbers, compute the size of their symmetric difference. | Easy3 | Hash mapArray+1 | No attempts yet | 2s | 256 MB | Judgeable |
| War - Land GrabFor each region's list of soldier army IDs, find the majority element that appears more than half the time, or print SYJKGW if none exists. | Easy3 | ArrayHash map | No attempts yet | 10s | 512 MB | Judgeable |
| BestsellerGiven N book titles sold in a day, find the most frequent title, breaking ties by lexicographically smallest. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Knight TourCheck whether a given sequence of 36 squares on a 6x6 board forms a valid closed knight's tour with legal moves between consecutive squares and back to the start. | Easy3 | SimulationArray+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Cyclic WordsCount how many words are distinct once each is allowed to be read starting from any position around a circle. | Easy3 | StringBrute force+1 | No attempts yet | 2s | 128 MB | Judgeable |
| I Am Pokemon Master DasomBuild a bidirectional mapping between Pokemon numbers and names, then answer up to 100,000 lookup queries either way. | Easy3 | Hash mapImplementation+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Common PermutationFor each pair of input strings, count letter frequencies and output the multiset intersection sorted alphabetically as the longest common rearranged subsequence. | Easy3 | Hash mapString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Common NamesGiven two lists of unique lowercase names, find and print the count and sorted list of names common to both. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Set DifferenceGiven two sets of up to 500,000 natural numbers each, output the count and sorted list of elements present in A but not in B. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Finding NumbersGiven N integers and M queries, output for each query whether it exists in the array, requiring an efficient lookup method. | Easy3 | Binary searchSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| AuctionGiven a sequence of bids, find the least-frequent price (lowest if tied) and output the name of the first bidder who offered that price. | Easy3 | Hash mapImplementation+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Repeated SequenceSimulate a digit-power sequence until it cycles, then output how many distinct values appear before the repetition starts. | Easy3 | SimulationHash map+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Axis-Parallel LinesGiven n points, count how many horizontal or vertical lines pass through at least two of them. | Easy3 | Hash mapArray | No attempts yet | 2s | 128 MB | Judgeable |
| Four DiceGiven N sets of four dice rolls, compute each participant's prize by rules based on matching-face patterns and output the maximum prize. | Easy3 | ImplementationHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Remainder Sequence CycleGiven N and P, simulate the sequence a_{i+1} = a_i*N mod P and output the length of the eventual repeating cycle. | Easy3 | SimulationHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Similar WordsCount how many words differ from the first word's letter multiset by at most one insertion, deletion, or substitution. | Easy3 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |