question_id
int64
39
56.8k
question_title
stringlengths
3
54
question_content
stringlengths
88
4.02k
dataset
stringclasses
1 value
difficulty
stringclasses
3 values
java
dict
java15
dict
java8
dict
python
dict
test_cases
stringlengths
28
4.02M
max_retries
float64
1
3
⌀
47,135
Strong Password
Louise joined a social networking site to stay in touch with her friends. The signup page required her to input a *name* and a *password*. However, the password must be *strong*. The website considers a password to be *strong* if it satisfies the following criteria: - Its length is at least $6$. - It contains at lea...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int minimumNumber(int n, String password)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.u...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'minimumNumber' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER n\n * 2. STRING password\n */\n\n public static int minimu...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int minimumNumber(int n, String password) {\n // Return the minimum number of characters to make the password strong\n String numbers = \"0123...
{ "class_name": null, "func_sign": [ "minimumNumber(n, password)" ], "solution": "#!/bin/python3\n\nimport sys\n\nnumbers = \"0123456789\"\nlower_case = \"abcdefghijklmnopqrstuvwxyz\"\nupper_case = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nspecial_characters = \"!@#$%^&*()-+\"\n\ndef minimumNumber(n, password):\n ...
eJy9VMuSmkAUzSKV7xgfWKJjikYRyErwgQM+cPBJCCkaRGGkkZeoqVTlI5L/DZXKIjUZU8wmd9WLc/qce/r2/fb2B3j35leta9nh45eig45JXPxwV6RaGlI2607FTcOSK4mWovSUoWlTKjoDXk6IiSkcxvTUCvEH3ScZTplP3FRnG56Givd3xe35uDXjrfXZT+LfVxLFr/d3f0iQGoK7m+jWMzRNaOgYEa00WlvEzOYZCXBLvNIPJgzkMN82YVs2xmW1VnDnrfnFqlihZQkbDOcTZjSXhHlvL7D8stxa5jbY1lDQFSQqvMkAzxgs0JD0...
null
21,405
Two Characters
Given a string, remove characters until the string is made up of any two alternating characters. When you choose a character to remove, all instances of that character must be removed. Determine the longest string possible that contains just two alternating letters. **Example** $s = \text{'abaacdabd'}$ Dele...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int alternate(String s)" ], "script_name": "Solution", "solution": "\n import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\nimport java.lang.*;\npublic class Main{\n\tstatic long mod=1000000007;...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "alternate(s)" ], "solution": "def char_range(c1, c2):\n for c in range(ord(c1), ord(c2)+1):\n yield chr(c)\n \ndef is_alternating(s):\n for i in range(len(s) - 1):\n if s[i] == s[i+1]:\n return False\n return True\n \nlen_...
eJztmEmu5UdaxRmwCkYlj0uoyuUyNitBwghFfNH3fYeQWAQsjxkL4VyLASKdgxwX+aTMfM2NG/+vOed33r/99X/819/81a9//uE/8Z9//JfvbCpzfPf3v/vuhx//8EtK5Perl5iZd3a2/WKNNatirvpQY8PWJR1b4mbqbVSrRNy6BpJz62YH87dnGoLrm3TjbasnSvSSvdK2YVlZpbrnPHNn0mRe9y3sxZG+dScX04slzjJf2j6ufKzS99Ly9V3eaaVTKtWRlWO36jtMJ4/3WsWbIbYNb6Sph86m61V7tjw9fxYLNBkFYzVFfuzU3N8t...
null
8,640
Caesar Cipher
Julius Caesar protected his confidential information by encrypting it using a cipher. [Caesar's cipher](https://en.wikipedia.org/wiki/Caesar_cipher) shifts each letter by a number of letters. If the shift takes you past the end of the alphabet, just rotate back to the front of the alphabet. In the case of a rotation ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String caesarCipher(String s, int k)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Str...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.util.Scanner;\n\nclass Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String s = sc.next();\n int K = sc.nextInt();\n StringBuilder sb = new StringBuilder(s);\n for (int ...
{ "class_name": null, "func_sign": [ "caesarCipher(s, k)" ], "solution": "cnt = int(input())\nstring = input()\nshift = int(input())\n\nres = \"\"\n\nwhile shift > 26:\n shift -= 26\n\nfor char in string:\n if char.isalpha():\n is_upper = False;\n is_lower = False;\n if ord(char) ...
eJy9Vdtu2koU7UNf+hcJSaqGhMa38SVFVYxvgA22MeBL3TqAgUDSgYANhIioH9H+b4fqHKnCTKRezvF+seay9pq196z58vLb4NWLH58XoZ8Pj7kRnKZJ7vIgRzIh1I3Hw0rxnVn1ROWsEcLtWO78INdfTfu9pB9HkzT5Z7kfPB66xXeSZ5jOmYqWbc4PfkJjiBBqUdMIfLWpF2TTCmwxKIiWUpMqrajZkEylXYlcqeUFfggZCpvHjaoly2xXxUJTUS3Ntgq22pIcX4+qZUdpGX5Uc/S6ZWYY8CEsuk+XC0XphxCQ2ATF9tNlKstxBoCi...
null
16,032
Mars Exploration
A space explorer's ship crashed on Mars! They send a series of `SOS` messages to Earth for help. <img src="https://s3.amazonaws.com/hr-challenge-images/16032/1453204202-9e3fd295bb-NASA_Mars_Rover.jpg" title="NASA_Mars_Rover.jpg" /> Letters in some of the `SOS` messages are altered by cosmic radiation during transmis...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int marsExploration(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] a...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "marsExploration(s)" ], "solution": "s = input()\nn = \"SOS\"*(len(s)//3)\ncnt = 0\nfor i in range(len(s)):\n if s[i] != n[i]:\n cnt += 1\nprint(cnt)\n", "template": "#\n# Complete the 'marsExploration' function below.\n#\n# The function is expected to return...
eJy1Vc1OwzAM5oDEa0w9TwiGQIJbmqzpT5osdf8BcYAduIwdNgkJIfEQ8L44oYexbtVaQRRFjhP7c+zP7cfxV3RyZEfJULh9c54Xy/XKuRk5oOCf5t3CGY+c+ety/riaPz28rFcN5BmevI9HG0HoOEaDSpe48tDIpDQyo9zohVm5Z/Qhs3rfxzXVogvmoo1T04CLhJKwR7TXLS/WIG0so0EpmOx2ujHjfU693q45AaYqE2kAJRrnM0hI0ABkRV7INOPSbP0AvBAFYl8W7cfYk5TDZvoXJDrfFUHVsi+3NPXvrfgRtF3VkDiudsRR5zKT...
null
345
Running Time of Algorithms
In a previous challenge you implemented the _Insertion Sort_ algorithm. It is a simple sorting algorithm that works well with small or mostly sorted data. However, it takes a long time to sort large unsorted data. To see why, we will analyze its running time. **Running Time of Algorithms** The running time of an alg...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int runningTime(List<Integer> arr)" ], "script_name": "Solution", "solution": "\n\n/* Head ends here */\nimport java.util.*;\npublic class Solution {\n \nstatic void insertionSort(int[] ar) {\n int count =0; \n ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n\n public static int insertionSort(int n,int array[]) {\n int i, j, newValue,shift=0;\n for (i = 1; i < n; i++) {\n newValue = array[i];\n ...
{ "class_name": null, "func_sign": [ "runningTime(arr)" ], "solution": "size = int(input())\narray = input().split(\" \")\narr = ['None'] * size\nfor i in range(size):\n arr[i] = int(array[i])\ni = 1 \ncount = 0\nwhile i < size:\n tmp = arr[i]\n j = i - 1\n while arr[j] > tmp and j > -1:\n ...
eJztnUuubdlyUCnQkKVX9kFr/mfQEiQeogAuUElcsCUkhEQjoEP0gRqNIcaInQlKnAYjJGRp++ot33PzrP1ZM2bMiBG///iP//N/+y//yP/7Z/81//LP//2f/s0vf/U3f/2nf/r86fz5l5/Y+zw/va2nv6c/P2Ov9fy0Ntdz19zP7DH//Muf/uL501/+u7/6y3/113/5r//lv/2bv/68wPrTf/iL5396wfHnX3rv8/lZ0eOZ7e4/vLX97tb1519u3vD8zH7vc1vPTzXuiaftHn/4Kvt3r7LzDc982zPWO59o5332avm15pp5XS2/0c/o...
null
3,418
Pangrams
A *pangram* is a string that contains every letter of the alphabet. Given a sentence determine whether it is a pangram in the English alphabet. Ignore case. Return either `pangram` or `not pangram` as appropriate. **Example** $s = \text{'The quick brown fox jumps over the lazy dog'}$ The string contains all le...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String pangrams(String s)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatc...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class Solution {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n\tpublic void solve() throws IOException...
{ "class_name": null, "func_sign": [ "pangrams(s)" ], "solution": "alphabet = 'abcdefghijklmnopqrstuvwxyz'\ndef pg(x):\n for letter in alphabet:\n if letter not in x:\n return False\n \n return True\nsentence = input()\nsentence = sentence.lower()\nif pg(sentence):\n print(...
eJztV7mu9lQSnGDCiZgXKN0Y8QCTed93+/MCCHnf9+3Yo5F4CHhfLERA8iPuFZoA3Y4slc5xn+5WddWP//z531/949cI/vV8fPvft3qY9u3tP3i7Qakclrev8ZaTKU+3PPth3Lff0GHcMMVDucT9d8Pb/77G704mSJGhQIkKDVp06DFgwowFKzYcOEFw4f7A3QGNoYg4y3mtWEmxoZKRYDqKk04z305sHWZQdkhdFHt0pusY2qgD4LIyj4DW8gVVB9POcCPfFbEerFzEVLaUvKqEXSdsqsr7EBpZnV4DKYI9psAZ9heS/VKiyM9CbZ/X...
null
433
Counting Sort 1
**Comparison Sorting** Quicksort usually has a running time of $n \times log(n)$, but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are _comparison sorts_, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cann...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> countingSort(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Scanner;\npublic class Solution{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int len = sc.nextInt();\n int[] arr = new int[len];\n for(int i = 0; i < len; i++)\n arr[i] = sc.nextInt();\n displayCoun...
{ "class_name": null, "func_sign": [ "countingSort(arr)" ], "solution": "N = int(input())\n\narr = list(map(int, input().split()))\n\nfreq = [0]*100\n\nfor i in arr:\n freq[i] = freq[i]+1\n\n\nprint (' '.join(map(str, freq)))", "template": "#\n# Complete the 'countingSort' function below.\n#\n# The fun...
eJzsvT2PdUuSnSdDlkyZsgrXHmPndyZ/iQA1QINsg05zjB6AAEFAP10Zz1pZd6DBSAJEYAQhJs/crrfqnH32XpkZnysi//f/8X/9X/7n/+l/+N/+6x//6W//+E9//+Pf/fwxvu/7y9/O+clXvvKVr3zlK1/5yle+8pWvfOUrX/nKV77yla985Stf+cpXvvKVr3zlK1/5yle+8pWvfOUrX/nKV77yla985Stf+cpXvvKVr3zlK1/5yle+/u9ef/zDzx9//S//+Nf/8Pe//sd//5//6e+uWf1+/v8wVHn7x3/7h59/Vo5bPn77b31vOXLk...
null
2,223
Gemstones
There is a collection of rocks where each rock has various minerals embeded in it. Each type of mineral is designated by a lowercase letter in the range $ascii[a-z]$. There may be multiple occurrences of a mineral in a rock. A mineral is called a _gemstone_ if it occurs at least once in each of the rocks in the collec...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int gemstones(List<String> arr)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputM...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n\n int count = in.nextInt(); in.nextLine();\n\n Set<Character> gems = new HashSet<>();\n ...
{ "class_name": null, "func_sign": [ "gemstones(arr)" ], "solution": "import string\n\nn = int(input())\n\nans = set(string.ascii_lowercase)\nfor i in range(n):\n\ts = set(input())\n\tans &= s\n\nprint(len(ans))\n", "template": "#\n# Complete the 'gemstones' function below.\n#\n# The function is expected ...
eJzsvVmOdD2SJaYHrUMoFKC3fqihB7VWIkA/IHCeL+dREKBNaL86Fl+mUGN3/tlZemoPj3D363cgjWbHzuElGf/3//j//M/rf/h5/G//E9787//nX7uvzPHX/+tf/fXf/c1vH/s3efB/9PiXr/Jf3+PPv+I/e/wbVfT/n6v8kwv+eVf5rxjo36r8f/Gr/Cn1+JOv8qee7E887e847Pdf+XeW6b/5BH9hw/1pV/mX9/q3udKfsOefU80/szz/7Vf+R1f5i5byzzjZrxP+9b/7q79WpygxlPw/8hx/TDz45v/6d3/1D1LR3/6n375ww1lX...
null
20,389
Beautiful Binary String
Alice has a [binary string](https://www.ics.uci.edu/~alspaugh/cls/shr/binaryString.html). She thinks a binary string is beautiful if and only if it doesn't contain the [substring](https://en.wikipedia.org/wiki/Substring) $\texttt{"010"}$. In one step, Alice can change a $0$ to a $1$ or vice versa. Count and print the...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int beautifulBinaryString(String b)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Stri...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n\tvoid run() {\n\t\tint n = in.nextInt();\n\t\tString s = in.next();\n\t\tString bad = \"010\";\n\t\tint ans = 0;\n\t\twhile (s.contains(bad)) {\n\t\t\tans++;\n\t\t\tint i = s.indexOf(bad) + 2;\n\t\t\ts = s.substring(0, i) + \"1\" + s.substrin...
{ "class_name": null, "func_sign": [ "beautifulBinaryString(b)" ], "solution": "#!/bin/python3\nimport re\n\nimport sys\n\n\nn = int(input().strip())\nB = input().strip()\nprint(len(re.findall(\"010\", B)))\n", "template": "#\n# Complete the 'beautifulBinaryString' function below.\n#\n# The function is ex...
eJy9VUsKwjAQdSGeo2RdZKZpafEkghUX2oWb2kULgggeQnHnWU2TSQ0pKc0iDk1IwvTNm3n5PJavz2ohbfsWg92Nneuma9kmYrwoa0AAQNX1vTSUNqwDlDWLI1Zdm+rYVqfDpWsJAtk9jgzItKxRQM72T7iiQIEGCjiBkVgYKCCczmA5F5lgKCOpaD1bGhszyYfWQBcCdJHQ+AX1zMkgt+kKVx0AcHaWOWnlIQZXuRJPnQiNfkI78dKxuOCzGdCIT9UKI6pwdiOPnEEKEN78GOEfzLNG6hwE/ZyMOHdQolMarnNvUUeV6H4I2Dx007JN...
null
2,343
The Love-Letter Mystery
James found a love letter that his friend Harry has written to his girlfriend. James is a prankster, so he decides to meddle with the letter. He changes all the words in the letter into [palindromes](https://en.wikipedia.org/wiki/Palindrome). To do this, he follows two rules: 1. He can only reduce the value of a...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int theLoveLetterMystery(String s)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\n\npublic class Solution {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner scan = new Scanner(Sy...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\npublic class Solution\n{\n\tprivate static BufferedReader in;\n\tprivate static PrintStream out;\n\tpublic static void main(String args[]) throws IOException\n\t{\n\t\tin=new BufferedReader(new InputStreamReader(System.in));\n\t\tout=new Pr...
{ "class_name": null, "func_sign": [ "theLoveLetterMystery(s)" ], "solution": "for t in range(int(input())):\n s = input()\n count = 0;\n for i in range(len(s)//2):\n count += abs(ord(s[i])-ord(s[len(s)-i-1]))\n print(count)", "template": "#\n# Complete the 'theLoveLetterMystery' functi...
eJztfemuJEd2ng34QYT5LRjsJrub1JMY8DWM2Pd9D0OAH8IP7BNZt0mOhz225JE4I8WX3VVZGZkRJ85+6lZG/s//9F/+If/H//Bf/8cflI+t/uEf/u4Pn988Q4UZJPB0oYe2PacLG1KT1CPV1OubX0lKKZDrrHhbtPZLxSF3Lry66iNSzvU0uEUq4RiLV61zLLZFVAeTdBlG52mmevNEvnmVpx9URqxbUlq15GyJyM65mppuhFpKVWyt2k3rOLc2RkxM5mEHTy7HlWjPCqFQVVnSVKd6wDtHV1Q0qlSENWp8Yu+c9WnuybiXJbrWgKaa...
null
49
Insertion Sort Advanced Analysis
Insertion Sort is a simple sorting technique which was covered in previous challenges. Sometimes, arrays may be too large for us to wait around for insertion sort to finish. Is there some other way we can calculate the number of shifts an insertion sort performs when sorting an array? If $k[i]$ is the number of elemen...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int insertionSort(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n\n Scanner in = new Scanner(System.in);\n int t = in.nextInt();\n\n for (int i = 0; i < t; i++) {\...
{ "solution": "\n \n\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.util.Scanner;\n\npublic class Solution {\n\n private int[] originalArray;\n\n public static void main(String[] args) {\n\n Scanner sc;\n try {\n sc = new Scann...
{ "class_name": null, "func_sign": [ "insertionSort(arr)" ], "solution": "def mergeSort(m):\n if len(m) <= 1:\n return [0, m]\n mid = len(m)//2\n l = []\n r = []\n for i in range(mid):\n l.append(m[i])\n for i in range(mid, len(m)):\n r.append(m[i])\n left = mergeSo...
eJzsvcuutFl2lU2DJhcRqrYb63zgSpBIiQa4QSehYSQkhMS1cJm0GM+zdhmwXQIbl9MF8fOnozK/+PaOeOda8zDmmGP+l3/6L/7bf/1n/+Rf/qff/dtf//1/+Ivf/fPP7+ovv/az7i+/nnHGuPfzx35d9bY9xh/993xfv6/f1z/8uttqe63f/HN8X7+v39fv69/19fZRyjq/+ef4h3qd+b9nz9/8c3xff6PzPvo++7f/HN/X7+v/T6+j5X+db936ff2+fl+/r9/Xv/m1rjH33/5vlVnbb/7Zv69/v6+7r9r3167f1+/r9/X/4rXXXdvf...
null
708
Anagram
Two words are [*anagrams*](https://en.wikipedia.org/wiki/Anagram) of one another if their letters can be rearranged to form the other word. Given a string, split it into two contiguous substrings of equal length. Determine the minimum number of characters to change to make the two substrings into anagrams of one an...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int anagram(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tstatic void solve() throws IOException {\n\t\tint tests = nextInt();\n\t\twhile (tests-- > 0) {\n\t\t\tString s =...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n//import java.util.Arrays;\n\npublic class Solution {\n\t\n\tpublic static void main(String[] args) throws Exception {\n\t\t\n\t\ttry(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))){\n\n\t\t\tint T = Intege...
{ "class_name": null, "func_sign": [ "anagram(s)" ], "solution": "T = int(input())\nfor i in range(0,T):\n\tal= (input())\n\tl = len(al)\n\tif (l%2==0):\n\t\thalf = int(l/2)\n\t\ta = al[:half]\n\t\tb = al[half:]\n\t\tcount = 0\n\t\tfor c in a:\n\t\t\tif c in b:\n\t\t\t\tpos = b.find(c)\n\t\t\t\tb=b[:pos]+b[...
eJzknNmuJslVhUHiLbix+tpIdrkZDC+CxJFQzPM8B0Li0Vnxt8sDHq64Auh2nzr1DxkRe6/1rczI/K+/+dd/+du//qt/+48fTMyj//DPP/vhH759xXzH5NqxlWc6negmNSuGTJ9ryGzM24I2kw11BLmteFri7Sk3corK1zDlUne30nwV7ZGa7NZJKQmVbNfpHhOUrWX2tk2tN5hw5panBi2Jy4KIqZfPx5ik9ih2c+67Nak4T9tt9dp7B45s5sTY6UPJumxlTQ19Q2IpzaPIJcmkuWQZSfRaubVdSpE0r3mI5rOqqicVpNi0Se9Ntscf...
null
745
Game of Thrones - I
Dothraki are planning an attack to usurp King Robert's throne. King Robert learns of this conspiracy from Raven and plans to lock the single door through which the enemy can enter his kingdom. ![door](https://s3.amazonaws.com/hr-assets/0/1526565753-0c557c119f-game-of-thrones.png "block") But, to lock the door he need...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String gameOfThrones(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\n\npublic class Solution {\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n String s = in.next();\n int[] coun...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\n\nclass Solution\n{\n\tprivate static BufferedReader in;\n\tprivate static PrintStream out;\n\tpublic static void main(String args[]) throws IOException\n\t{\n\t\tin=new BufferedReader(new InputStreamReader(System.in));\n\t\tout=new PrintStream(new BufferedOutputStream(System.out));\...
{ "class_name": null, "func_sign": [ "gameOfThrones(s)" ], "solution": "string = input()\ncharacter_count = {}\nfor i in string:\n if i not in character_count:\n character_count[i] = string.count(i)\nodd_counts = 0\nfor i in character_count:\n if character_count[i] % 2 == 1:\n odd_counts...
eJwknFmuNTkRhJHgjU2gXgZS7wOJJ89jep55YelEHUB0N3/fe47Lzoz4wuWq//7tX3//869/+fd//nCpzPHHP//xh6VSgzo856oG1efifCFp10x3LBQxrOvvqsP2ybqI/ky9jNmc3HnZytDSNMfFuPvSwbhhzGmPpErsHD4GW4t8EltSopZC5a9ZcQpZeU0Kgk5k3bZ38TXyvOh3kuJZvlmdjOXlhajBBJl7uSmFfivzhpKsb653LJ9K9/l0fmSNUNTq9CF0vYwU0l07OXXHp77D7zD56k1GxarTWoe8araz1s0C4Su4nXLdycSYHIPv...
null
5,187
Two Strings
Given two strings, determine if they share a common substring. A substring may be as small as one character. **Example** $s1 = \text{'and'}$ $s2 = \text{'art'}$ These share the common substring $a$. $s1 = \text{'be'}$ $s2 = \text{'cat'}$ These do not share a substring. **Function Description** C...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String twoStrings(String s1, String s2)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.uti...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class TwoStrings {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid solve() throws IOException {\n\t\tint t = nextInt();\n\t\touter: while (t-- > 0) {\n\t\t\tchar[] a = nextToken().toCharArray();\n\t\t\tchar[] ...
{ "class_name": null, "func_sign": [ "twoStrings(s1, s2)" ], "solution": "a = int(input())\nfor i in range(a):\n i = (input())\n j = (input())\n setx = set([a for a in i])\n sety = set([y for y in j])\n if setx.intersection(sety) == set():\n print(\"NO\")\n else:\n print(\"YE...
eJw0nUmyLTtyXdWQqaNJ0HIG6nIkMhM7p64RESgCAbCjnqattfx+JjM/37/v3DgIwH379hL/97//7//5//7Hf/s///mvV1pb/de//9u//td/pMv19Xh/n6fv4/79np6X2/v+un7ur9vz8T7d35fX7/Q5XS6vy/v3fp+f18/zdDq9Xpfr/fZ5/b6f2+V8et359ef1cjpdrpcnf3W6XR/n6/POZ7+f7+l0u7/vv8fv9/483vfHk7++vE6f1+PFN36e19Obr33+To/r9/E7nc+/J8/noa/H7XN53Pje6+n7+74efNXjzJKu7/vt8f1+Hqf3...
null
21,584
String Construction
Amanda has a string of lowercase letters that she wants to copy to a new string. She can perform the following operations with the given costs. She can perform them any number of times to construct a new string $p$: * Append a character to the end of string $p$ at a cost of $1$ dollar. * Choose any [substring](https...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int stringConstruction(String s)" ], "script_name": "Solution", "solution": "import java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\n\npublic class CS1 {\n\tpublic static void main(String[] args){\n\t\tFast...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "stringConstruction(s)" ], "solution": "t = int(input())\n\nfor i in range(t):\n s = input()\n print(len(set(s)))", "template": "#\n# Complete the 'stringConstruction' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts ST...
eJzsvcmuLMmanaeBJhrpFS7uuCZVhCiRTyJACRDWm0XjEZHdLYogoEfX+pa5e/jOUg0408DSMk/usz3C3Zq/WX/r/8///H/W//V/+Z/+r//297G9//j97//5b3//51+2EFMutfVxuz+e2+v9+fW33//48x//+l//73VlXVlX1pV1ZV1ZV9aVdWVdWVfWlXVlXVlX1pV1ZV1ZV9aVdWVdWVfWlXVlXVlX1pV1ZV1ZV9aVdWVdWVfWlXVlXVlX1pV1ZV1ZV9aVdWVdWVfWlXVlXVlX1pV1ZV1ZV9aVdWVdWVfWlXVlXVlX1pV1ZV1ZV9aV...
null
8,816
Sherlock and the Valid String
Sherlock considers a string to be *valid* if all characters of the string appear the same number of times. It is also *valid* if he can remove just $1$ character at $1$ index in the string, and the remaining characters will occur the same number of times. Given a string $s$, determine if it is *valid*. If so, return...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String isValid(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class _101HackJuneqA {\n\n\tpublic static void main(String args[]) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWri...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "isValid(s)" ], "solution": "s = input()\ndistinctList = []\ncountList = []\nfor c in s:\n if c not in distinctList:\n distinctList.append(c)\nfor d in distinctList:\n count = s.count(d)\n countList.append(count)\n#print(countList)\nkey = countList[0]\nfl...
eJyMnLmuJkkVhDHmQUZtzxNgY4OLBBLKfd/z5IaQeGtconocTMSImb793/qzMs+J+KIqq/79y1//9J9f/vC3f/5wudL88cdffxxaNod04o72bT1mtoHL8pzdLtoUWKqhJG3DVFJ5G1Po5UTBhlZ3mqLuZtOY40IqnfJ95/QnlSxrtqTajHbttZmM1Q2XbOuPDknrFsnMRsc363i0ffh1HVUVTssjzha8c6PG3UlkIqM2KbNkXGf5aFraNWEAbzBdawjcd2vWS+w92ZN1Icwi29n8LblEuoYROTNYHdSaH+m0K4tgLtvafW++dBdm7uSZ...
null
5,393
Sherlock and Anagrams
Two strings are [*anagrams*][123] of each other if the letters of one string can be rearranged to form the other string. Given a string, find the number of pairs of substrings of the string that are anagrams of each other. **Example** $s = mom$ The list of all anagrammatic pairs is $[m, m], [mo, om]$ at positio...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int sherlockAndAnagrams(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n \n private static int count[]...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Map;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.util.HashMap;\nimport java.util.Set;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Random;\nimport java.i...
{ "class_name": null, "func_sign": [ "sherlockAndAnagrams(s)" ], "solution": "for _ in range(int(input())):\n was = dict()\n s = input()\n\n n = len(s)\n for i in range(n):\n for j in range(i, n):\n cur = s[i:j + 1]\n cur = ''.join(sorted(cur))\n was[cur] ...
eJy9GFuO47gxHzlCDjDo70Vgt9vu7pwkQLxYUCIpvt+URAUBcojkvqmipmdn1vYgCGZTFutNtsQii8X+5x//rf/0hw5/pcD87e9P0oVanv7y6el4uLoSSygxBMAdIjwhgiJE0AUUY+dK5wraQEaKzl0FGIdBFPc+gMNnBXBXNwuhtRCzFjOgGSk00AEGA4jI7oYuCrF77N4z9ELog3RL74TK7iHQ4epySinnxHlKvJOd4xxZNGTggaBX7g15UIEhozfSzuWd7UPw3Qf9QXl1QkYJAAg5mIAIVIAghegG8cGgB7T4qxq9JWLRRcAoIocD...
null
660
Common Child
A string is said to be a child of a another string if it can be formed by deleting 0 or more characters from the other string. Letters cannot be rearranged. Given two strings of equal length, what's the longest string that can be constructed such that it is a child of both? **Example** $s1 =\text{ 'ABCD'}$ ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int commonChild(String s1, String s2)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(St...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Scanner;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String a = sc.next();\n String b = sc.next();\n \n System.out.println(lcs(a,b).length());\n }\n public static String lcs...
{ "class_name": null, "func_sign": [ "commonChild(s1, s2)" ], "solution": "import sys\n\ndef main():\n a = [l for l in sys.stdin.readline().strip()]\n b = [l for l in sys.stdin.readline().strip()]\n\n a = [l for l in a if l in b]\n b = [l for l in b if l in a]\n\n print(len(lcs(a, b)))\n\ndef lcs(a, b)...
eJzsnbuOLV2WlTF4kFbZbTQN3Vy8ue73+51fwoA2cH7aaCQkhMRL8HQ8BR4mI44wkIoSFmohclWp6pyTmXtHrDXnGN/YGSviP//D//Lf/+s/+DXOf8Mf/uV//MO//f1v//3f/eFf/Nkf9gxbxeiuWtVybp1g8Vqljsjt2VdfWeJEUzVjojY3bAw3q95fiWY/zf1bzOtme0jZC7XFoCKq8msuCnxvWeLRxt60uKqpzN6WxAt7Edziu5rybpW6aTanw1dPSLcXdXzrc7QYpwinD6WV9V3bnqMgP1WTPRCfws6ZpzReljZjaNkkekxs5Ya6...
null
2,335
Morgan and a String
Jack and Daniel are friends. Both of them like letters, especially uppercase ones. They are cutting uppercase letters from newspapers, and each one of them has his collection of letters stored in a stack. One beautiful day, Morgan visited Jack and Daniel. He saw their collections. He wondered what is the lexicograp...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static String morganAndString(String a, String b)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java....
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\npublic class Solution {\n BufferedReader reader;\n\n int nextInt() throws IOException {\n tokenizer.nextToken();\n return (int) tokenizer.nval;\n }\n\n String next() throws IOException {\n tokenizer.nextToken();\n ...
{ "class_name": null, "func_sign": [ "morganAndString(a, b)" ], "solution": "import io\ndef pick_smaller_char(s1, s2, idx1, idx2, len1, len2, i1, i2):\n if(len1 <= idx1[0]):\n idx2[0] += 1\n return s2[idx2[0]-1]\n if(len2 <= idx2[0]):\n idx1[0] += 1\n return s1[idx1[0]-1]\n...
eJzs3cmuJct1Juga1Kxe4iLGnCgrc8KZ9a1b37hZBaCBdIHS5IiDS0CAIKDeoF651iapFCklkVKCJVLU/wHq4o/Y27e72bK1zj4C/5///f2//9//43/7v/7+2998/eKXP337+Q/f/uL7Vxs9+Z0N3/1+/+rfv7797IdvP/7dL378q59+/Ou//Ntf/vSbv9r67/zFb//wsx9+94UYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwB8KF1LhPzYVAAAAAAAAAAAAAAAAAAAAAAAA...
null
20,191
Build a Palindrome
You have two strings, $a$ and $b$. Find a string, $s$, such that: * $s$ can be expressed as $s =s_a + s_b$ where $s_a$ is a non-empty [substring](https://en.wikipedia.org/wiki/Substring) of $a$ and $s_b$ is a non-empty substring of $b$. * $s$ is a [palindromic](https://en.wikipedia.org/wiki/Palindrome) string. * The l...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static String buildPalindrome(String a, String b)" ], "script_name": "Solution", "solution": "import java.util.*;\n\npublic class PalindromeBuilder {\n public static class State {\n int length;\n int link;\n int[] next = new int[128]...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.InputMismatchException;\n\npublic class F3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\...
{ "class_name": null, "func_sign": [ "buildPalindrome(a, b)" ], "solution": "from os.path import basename,exists,expanduser,splitext,isfile\nfrom os import getcwd\nfrom sys import stdin,modules,path\nimport sys\nfrom array import array as ar\nfrom collections import Counter,defaultdict as ddict\nfrom functo...
eJzt10mOZUlWAFAGjBiygpCPoxAJCFCuBImPUq/v7fVtKSUWwXpYG/aThCplpNcIKQGdI1co/P3/rLl27Zr5v/75P/3lv//Fn/3z7z+aMO3bx/dfPv7hFZ62r5o1lH0emmUvt6Xsryubr7DOZVFdWdV1ydgl83mFJDnKV7hfoc33kB9reQ31vJ3dk9b5VF3PvRxlbGou0rJNivoV+qUrhy5J03PMYk/JffbVMd/5tKXJPnX3Fpaqv49XOPOlyKayq6sy9rBk85kUyTGV25M38z1kT+x2DGVdJn0Xv1Cux1yH+Qxdnu3jVe3bWl3FXHdr...
null
48,866
Cards Permutation
Alice was given the $n$ integers from $1$ to $n$. She wrote all possible permutations in increasing lexicographical order, and wrote each permutation in a new line. For example, for $n = 3$, there are $6$ possible permutations: 1. $[1, 2, 3]$ 2. $[1, 3, 2]$ 3. $[2, 1, 3]$ 4. $[2, 3, 1]$ 5. $[3, 1, 2]$ 6. $[3, 2, 1]$ ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static long solve(List<Integer> x)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic cla...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class CardsPermutationFinal {\n private final static long MOD = 1000000007;\n private final static long INV_TWO = inverseElmnt(2);\n private static final long Y_DISP = ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n private static final int modulus = 1000000007;\n private static int[] knowns; // known n...
{ "class_name": null, "func_sign": [ "solve(x)" ], "solution": "from bisect import bisect_right, bisect_left\n\nMOD = 10 ** 9 + 7\nN = 3 * 10 ** 5\n\n\nclass SegmentTree:\n def __init__(self, arr):\n self.size = len(arr)\n self.tree = [0] * (2 * self.size)\n self.build(arr)\n ...
eJzs3dGqZMuWmGdj/CDJuRY4Y4wxY4zUkxjcoAupL3TT1kU3CITAj+74otxgcfrIAoOQYSqa1FZrRu1d81+1Vs4vI6L+z//lf/tf/+l//p/+9//0l3//D//hn/7xL//685f1/bt/WJ/45Kc+z2d/+jOf32d9//KvPn/5+//4H/7+3/7j3/+7f/N//NM//vPlf/cPf/nP/+rzX/wC37/xS3zW+qz4rPys+qzns/Zn9WfNZ/0+8f3EmROfyE/UJ55P7E/0J+YTv09+P7k+eX7J/GR98vnk/mR/cj75+9T3U+tT8anzb6xPPZ/an+pPzad+...
null
63
String Similarity
For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3. Calculate the sum of similarities of a string S with each of it's suffixes....
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int stringSimilarity(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tprivate void solution() throws IOException {\n\t\tint ts = in.nextInt();\n\t\twhile (ts-- > 0) {\n\t\t\t...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Solution {\n\n static class SuffixArray {\n private char str[];\n private int MAX_LOG = 30;\n private int n, nr0[], nr1[], rank[][], index[], step, cnt;\n\n private int M;\n private int minusOneHea...
{ "class_name": null, "func_sign": [ "stringSimilarity(s)" ], "solution": "# Z Algorithm\n# Followed demo from:\n# http://www.utdallas.edu/~besp/demo/John2010/z-algorithm.htm\n# to implement\n\nif __name__ == '__main__':\n N = int(input())\n \n for line in range(N):\n string = input()\n ...
eJzsfMmuJMt1pBba6Cv6odZckCJakPglAroAwed5np0Q0J/eFhfaNbTXwg3EIVlVNzPS/RwbIjzv//3Hf/f/65/+4f/8/ZeJefRff/vj119+xxBTLq+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sorr7zyyiuvvPLKK6+88sor...
null
1,031
Pseudo-Isomorphic Substrings
Two strings A and B, consisting of small English alphabet letters are called pseudo-isomorphic if - Their lengths are equal - For every pair (i,j), where 1 <= i < j <= |A|, B[i] = B[j], iff A[i] = A[j] - For every pair (i,j), where 1 <= i < j <= |A|, B[i] != B[j] iff A[i] != A[j] Naturally, we use 1-indexation in ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> pseudoIsomorphicSubstrings(String s)" ], "script_name": "Solution", "solution": "/* HackerRank Template v0.21 by Sergey Esipenko\n * \n * v0.21\n * - fixed RuntimeError\n * */\n\nimport java.io.*;\nimport java.math.*;\nimport java.ut...
{ "solution": "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n \npublic class PseudoIsomorphicSubstrings {\n \n public static class ST {\n \n public static class Node {\n private final int valuesFromRootCount;\n private final Map<Integer, Edge> edges;\n ...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Locale;\nimport ja...
{ "class_name": null, "func_sign": [ "pseudoIsomorphicSubstrings(s)" ], "solution": "s = input()\n\nprevs = dict()\na = []\nfor i in range(len(s)):\n if s[i] in prevs:\n a.append(i - prevs[s[i]])\n else:\n a.append(i + 1)\n prevs[s[i]] = i\n\nclass Node:\n def __init__(self, **d):\...
eJy8fcnOw0rTFgtugt2vb83Cc3dzJUgcCcWZ7MSJEyex4yAk7oZr4O54Br+IJSvO0Tmp127bPVTXXNX/49//5//1P//Dv/sv/+1f/f3xef/rP/3bv3bt/4d///Uf/+1fx+/juH8fD/91/Ly3b+f/3It/7uU/9+qfe/3PvfnnHv65x3/u6Z97nuE/3M/RIEeLHE1ytMnRKEerHM1ytCvQruB70K5AuwLtCrQr0K5AuwLtCrQr0a5Eu5IfRLsS7Uq0K9GuRLsS7Uq0q9CuQrsK7Sr2DO0qtKvQrkK7Cu0qtKvRrka7Gu1qtKs5BLSr0a5G...
null
33,387
KnightL on a Chessboard
$KnightL$ is a chess piece that moves in an `L` shape. We define the possible moves of $KnightL(a, b)$ as any movement from some position $(x_1, y_1)$ to some $(x_2, y_2)$ satisfying either of the following: - $x_2 = x_1 \pm a$ and $y_2 = y_1 \pm b$, or - $x_2 = x_1 \pm b$ and $y_2 = y_1 \pm a$ Note that $(a, b)$...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<List<Integer>> knightlOnAChessboard(int n)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static vo...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'knightlOnAChessboard' function below.\n *\n * The function is expected to return a 2D_INTEGER_ARRAY.\n * The function accepts INTEGER n as parameter.\n */\n\n public static List<List<Integer>> knightlOnAChessboard(in...
{ "solution": "\nimport java.io.PrintStream;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Solution {\n\n private final Scanner in;\n private final PrintStream out = System.out;\n\n public static void main(String[] args) throws Exception {\n Solution solution = null;\n tr...
{ "class_name": null, "func_sign": [ "knightlOnAChessboard(n)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nn = int(input().strip())\n# your code goes here\nA=[]\nfor a in range(1,n):\n B=[]\n for b in range(1,n):\n P={(0,0)}\n c=0\n f=True\n V=set()\n while f:\...
eJztWs2O5DQQ5sCDtOa8QXHZcdI8CRIDHGAOXIY97EpICImHgPfFVV+V4yR2fmaEEKi3s5m04ypXlevX1X98+dcLfSH/vvk+PXz729PPrx8/f3r6+vZEw/Pr04fb08uvH19+/PTy0w+/fP5kr8LNxZsjvqb0ifK1T08hfSZ5E2/U31y40cRvfEyTQvp2C9Pt+XUFzfc0lF4T3xgFL0F8j3xLqPgut8DwBXDE8kFpCLyo00FdRx7sb7oEgRJOuMlyCTw/6gr5kebHdD2/ZvDOCd+yZHoGgp75Tt+oBy8yrbwYAWifRGTT4hkfKp5ZatGW...
null
14,104
Short Palindrome
Consider a string, $s$, of $n$ lowercase English letters where each character, $s_i$ ($0 \le i \lt n)$, denotes the letter at index $i$ in $s$. We define an $(a, b, c, d)$ palindromic tuple of $s$ to be a sequence of indices in $s$ satisfying the following criteria: * $s_a = s_d$, meaning the characters located at ind...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int shortPalindrome(String s)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Solution {\n\n\tpublic static final int MOD = 1000000000 + 7;\n\n public static void main(S...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "shortPalindrome(s)" ], "solution": "mod = 10**9 + 7\n\ndef sum_multi(A,B):\n return A[0]*B[0] + A[1]*B[1] + A[2]*B[2] + A[3]*B[3] + A[4]*B[4] + A[5]*B[5] + A[6]*B[6] + A[7]*B[7] + A[8]*B[8] + A[9]*B[9] + A[10]*B[10] + A[11]*B[11] + A[12]*B[12] + A[13]*B[13] + A[14]*B...
eJwcnEmy5FoRRBkwZBFYLYOVYMYobt/3PRM2xEZYFa40mvq/Xr5M6UaE+3HpKv/z13/+779/+8u//v3HpjLHn3/8/Q8rZoRsbr5lZ3F4TEpek8SYfV+r5duqXiqHuRH2znwur00ON3nFn9PMlOq0457Mpc5kkC28V7xcVdXeYg06eC1nLcPawLOTJj9mqMj4wlrbNh4vF80OE1a/SdqX19E6tb7lsjF713O5ZqkWQrnzqclT8ZW3O4zaW4Y1WgzihRvbbaF2nWRvlcs6SAmauyzN6E0z16lnTJFmKZ7HWqbF24ceZjWjcudI6FnfNnHr...
null
13,331
Beautiful Quadruples
We call an quadruple of positive integers, $(W, X, Y, Z)$, *beautiful* if the following condition is true: $$W \oplus X \oplus Y \oplus Z \neq 0$$ **Note:** $\oplus$ is the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operator. Given $A$, $B$, $C$, and $D$, count the number of *beautiful* quadr...
hackerrank
Medium
{ "class_name": null, "func_sign": [ "static int beautifulQuadruples(int a, int b, int c, int d)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main...
null
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "beautifulQuadruples(a, b, c, d)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nA,B,C,D = input().strip().split(' ')\ntemp = [int(A),int(B),int(C),int(D)]\ntemp.sort()\nA,B,C,D=temp\n\ntot=[0]*4100\n\ntree=[([0]*3100).copy() for i in range(4100)]\ncnt=[([0]*3100).cop...
eJydlE1q3EAQhbNITuFNobUx9f/jkxgck0Uyi2wmXowhEAw+hH1fl5yBcXqiJkQtNb3Q+/p1vZKePr4snz68XTcXvbj9tXzf3z8clmtYKDBAGYhZgYzw8365hGX383739bD79uXHw+H4plBqlDmGL4+X8I4R1VJqDgsVUGRsQtxNJdIrTAaKu7QBLjBcIaGbEEpJQ9X2wgOkXWDbQAG2XgXZJqXQlDHVi2ygsKEDsztEP6Q28YLVDI3eTXHASCgwRRM8q13VpC7KicxV5eORGN3AU6ArD6mybUUwUsi0mEZGqcEaTkTXVnGScoQkqplp...
null
3,470
Absolute Element Sums
Given an array of integers, you must answer a number of queries. Each query consists of a single integer, $x$, and is performed as follows: 1. Add $x$ to each element of the array, permanently modifying it for any future queries. 2. Find the absolute value of each element in the array and print the sum of the absolute...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> playingWithNumbers(List<Integer> arr, List<Integer> queries)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n...
{ "solution": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by witalia on 12.12.14.\n */\npublic class Solution {\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\...
{ "class_name": null, "func_sign": [ "playingWithNumbers(arr, queries)" ], "solution": "from collections import Counter\n\ndef q(arr, queries):\n positive_n = [el for el in arr if el >= 0]\n negative_n = [el for el in arr if el < 0]\n pos_size = len(positive_n)\n neg_size = len(negative_n)\n ...
eJzsvcuubDuynueG3sHdiWqfBAbvpJ7DDQMqQA2pGuqUTqMOIEAwYL+54/9+5m3OXHvtOjbsDneh1owcOQYHGQzG5Y8g8//8D//7//W//a//y3/6n3/5b3//13/7x1/+49df8hX//fXvN/394p9DHvKQhzzkIQ95yEMe8pCHPOQhD3nIQx7ykIc85CEPechDHvKQhzzkIQ95yEMe8pCHPOQhD3nIQx7ykIc85CEPechDHvKQhzzkIQ95yEMe8pCHPOQhD3nIQx7ykIc85CEPechDHvKQhzzkIQ95yEMe8pCHPOQhD3nIQx7ykIc85CEP...
null
774
Subset Component
You are given an array with $n$ $64$-bit integers: $d[0], d[1], ..., d[n - 1]$. BIT(x, i) = (x >> i) & 1, where $B(x, i)$ is the $i^{th}$ lower bit of $x$ in binary form. If we regard every bit as a vertex of a graph G, there is an undirected edge between vertices $i$ and $j$ if there is a value $k$ such that BIT(d[k...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int findConnectedComponents(List<Long> d)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.math.BigInteger;\n\npublic class Solution {\n\n static int col = 0;\n static long[] a;\n\n public static void solve(Input in...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n private static int findConnectedComponents(long[] nums) {\n Result result = new Result();\n ...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class Solution{\n\tstatic InputStream is;\n\tsta...
{ "class_name": null, "func_sign": [ "findConnectedComponents(d)" ], "solution": "from functools import reduce\nfrom operator import or_\n\ndef get_integers():\n from sys import stdin\n return int(stdin.readline().strip()), sorted(map(int, stdin.readline().strip().split()))\n\ndef dec(s):\n return ...
eJyVls1uHUUQhVmw5CFaXkeo/rs7T4JEEAvIgo1hkUhICImHgPflq7GdXDMeK/hK1r0z1d1Vp8451X99/c/bb746/r5zvnz/x90v9799/HD3dtxpvLvPuSXWthi23SXnnEMlUnm4bXiKxdbpQ1WlZHqtYTJlL5XcQ5PXe2rKMJaJz+Bh8T/Cdr9fhKWpsquY+iJ4qM1gz60+dk5xTrKhM+eaZanv7u/ejLv3v//2/qcP73/+8dePHx4TzloRk9d/vhk3deS7e022JznhcDbJCM5LKeqSIZcb6jY5bedsN/hcp6F2WqSbVR6mewIbaZAN...
null
5,595
Dijkstra: Shortest Reach 2
Given an undirected graph and a starting node, determine the lengths of the shortest paths from the starting node to all other nodes in the graph. If a node is unreachable, its distance is -1. Nodes will be numbered consecutively from $1$ to $n$, and edges will have varying distances or lengths. For example, consid...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> shortestReach(int n, List<List<Integer>> edges, int s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\nclass Node implements Comp...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.ArrayList;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\npublic class Solution {\n\tstatic class Pair {\n\t\tint vertex = 0;\n\t\tint dist = Integer.MAX_VALUE;\n\n\t\n\t}\n\n\tpublic static void main(String[] ar...
{ "class_name": null, "func_sign": [ "shortestReach(n, edges, s)" ], "solution": "import heapq\n\ndef find(V,N,S):\n dist=[-1 for x in range(N)]\n visited=[False for x in range(N)]\n Q=[(0,S)] #use a priority queue\n dist[S]=0\n while Q:\n mindist,minv=heapq.heappop(Q)\n if not ...
eJy0vcuqbVuXrWXi+B6DSJ+A3nq7+ySCP5jQg5gJTZwDggg+uvX7Sp9/CGJOg4jYe+015xi9t0u9lFpqqf/nf/hv/+v/6T/8V//d//4v//O//a//5T//y3/z+5fxj3/r/df/8W/v/L3n18fb2z/+bf1a+913jfuPf2u/89vrGbt+pn56999860fa/o3xG3us5S/Xf7/9nPqbsX7r+Y331r+fXxu/O9f1t3+jPvX0e+rX72/t39xz1He386tfas9u9X3vb9UHjOd969EOP7X789Rf7F/fv3bPnvUdv/m7qz/1QKv9dj3jrP+pX6iPbfX1...
null
28,277
Real Estate Broker
You are a real estate broker in ancient Knossos. You have $m$ unsold houses, and each house $j$ has an area, $x_j$, and a minimum price, $y_j$. You also have $n$ clients, and each client $i$ wants a house with an area greater than $a_i$ and a price less than or equal to $p_i$. Each client can buy *at most* one house, ...
hackerrank
Hard
{ "class_name": null, "func_sign": [ "static int realEstateBroker(int[][] clients, int[][] houses)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\npublic class e {\npublic static void main(String[] args) throws IOException {\n\tinput.init(System.in);\n\tPrintWriter out ...
null
{ "solution": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\n\n/*\nbr = new BufferedReader(new FileReader(\"input.txt\"));\npw = new PrintWriter(new BufferedWriter(new FileWriter(\"output.txt\")));\nbr = new Buf...
{ "class_name": null, "func_sign": [ "realEstateBroker(clients, houses)" ], "solution": "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport sys\n\ndef kuhn(v):\n global house, used, buyers\n if used[v]: \n return False\n used[v] = True\n for buyer in buyers[v]:\...
eJzsvcuqLUuapacCPYgT7WrY/aInEShAjapEqBOqRhYUCIGeSs+n8X02dyIyiCIL1FBDGeTZ56w9l093c7P/Osb4/8///n/8X/6vf/ff/U//+1/+17/9p//8z3/5H76/tG/+9W93t9PaLeerfZV1bs0PZ+u1lL2/1XefZY7117+N0tu69+xvtLturev89W911dvXXPVb+4y+271//dtqu87Zyv72ab31kQ+Oecus8+SD8/bRZs0Hey65W1/fWeuU1Wo++Jd///3ln/7Lf/qn//DP//Qf/+f/7T//8+9ea/7m//j33//j7mvh9uuXG/3r...
null
22,036
Demanding Money
Killgrave wants to use his mind control powers to get money from the Justice League superheroes living in $N$ houses in Happy Harbor that are numbered sequentially from $1$ to $N$. There are $M$ roads, and each road $j$ connects two different houses, $A_j$ and $B_j$. Each superhero house $i$ (where $1 \le i \le N$) has...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> demandingMoney(List<Integer> money, List<List<Integer>> roads)" ], "script_name": "Solution", "solution": "import java.io.BufferedInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.HashMap;\nimport ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n /*\n * Complete the demandingMoney function below.\n */\n private static long maxMoney = Integer.MIN_VALUE;\n private static Map<Long, Long> soluti...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\...
{ "class_name": null, "func_sign": [ "demandingMoney(money, roads)" ], "solution": "\ndef solve(C,G) :\n minLost = {}\n def getMinLost(housesToVisit) :\n# print(\"getMinLost %s :\" % str(housesToVisit))\n if not housesToVisit :\n return 0,1\n \n key = frozenset(h...
eJyNW0uObEkNZcBCQm/cQjccf1aCRCEG0AMmjx50S0ioJRYBK2LGqgj7HPvem596j5dkZmVVxsdhHx8fR//rt//53/qN/e8P/91v/vjPL3/7+tMvP3/5ffoiI7WPr2WmOpLUVGoaklpLcugnuen7UtLIaR5JJI2Zxn5TUm1p1bRKyjn1oe/b/m1NvSbJH19XymuPm6R/fK0pi77Px8fXnGTP9+WH9OXHf/z0419+/vGvf/77Lz9zMVnmTPnLrz+kywqnfa/k1Hra62y2wr0w2UMNHXbqU9Whpz7td5LKx9eehv7Y9cem7/ZnQ//k3eT9...
null
14,770
Find the Path
You are given a table, $a$, with $n$ rows and $m$ columns. The top-left corner of the table has coordinates $(0,0)$, and the bottom-right corner has coordinates $(n-1, m-1)$. The $i^{th}$ cell contains integer $a_{i,j}$. A path in the table is a sequence of cells $(r_1,c_1), (r_2,c_2), \ldots, (r_k,c_k)$ such that for...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> shortestPath(List<List<Integer>> a, List<List<Integer>> queries)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nim...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solve(...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "shortestPath(a, queries)" ], "solution": "import sys\nfrom heapq import *\n\nnum_rows = 0\nnum_cols = 0\nnum_queries = 0\ntable = []\nquery_dict = {}\nquery_results = []\nshortest_paths = []\nvisited = []\n\n\ndef read_input():\n global num_rows, num_cols, num_querie...
eJx8ncuuNEuSlRkw4S1CNe6B3y88CRJHYgA1YFL0oFtCQi3xvrwEtr5lkZlVRaEj/WfvnZERHu7mdnNby/73v/9P//Z//sO/+8//60///S///K//8qf/+PypPvWPv9S92x9/6X/8pTz89//64U//9Pzpz//zn//8X//lz//tv/yPf/2X9/t89fvvn/7tn56f249n/vGXtu962hrnaa23p+05nlpGPK+OGp+c0p969oxP2o1/ajyuldbj8hGXn7ufNu5T14yxtrr1wdKFtz3ncIMV94pv1Wc8TW9U4n/9iSfEneOHoY9qvEh/Pxr6gQ/1...
null
32,559
Marc's Cakewalk
Marc loves cupcakes, but he also likes to stay fit. Each cupcake has a calorie count, and Marc can walk a distance to expend those calories. If Marc has eaten $j$ cupcakes so far, after eating a cupcake with $c$ calories he must walk *at least* $2^j \times c$ miles to maintain his weight. **Example** $calorie = ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long marcsCakewalk(List<Integer> calorie)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void mai...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'marcsCakewalk' function below.\n *\n * The function is expected to return a LONG_INTEGER.\n * The function accepts INTEGER_ARRAY calorie as parameter.\n */\n\n public static long marcsCakewalk(List<Integer> calorie) ...
{ "solution": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.ObjectInputStream.GetField;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.Ha...
{ "class_name": null, "func_sign": [ "marcsCakewalk(calorie)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nn = int(input().strip())\ncalories = list(map(int, input().strip().split(' ')))\ncalories.sort(reverse=True)\nprint(sum([2**j * calories[j] for j in range(n)]))\n", "template": "#\n# Complete th...
eJy1VstuHEcMzCGX/AWxZyNoks2Xv8RAFORg65CL4oMMBAgM+COcb8vN35JiTyQIOzsTH2wNene009NdJKuK/enHv7/89MP6e/MPbn756/L7w/sPj5fXdNG6e2BJ8goKpphGpfg2oSmTbBSVG7FOEg6yKBL8L5ibQ/Ea7kXJsgfNHpqk6pSMMZyMJ+HtMCYxozTMXCsoBR4nNolJHonbgZlKE7+l8t3D5RVd7v98f//28f7db398eHzCPCZH4VM8PDDt4yt6EZKMu4eJXbgmsTtJFvlM7OqkPihFgGIukFpJ3HGMjr0hAGkANJ77RA6Q...
null
898
Sherlock and The Beast
Sherlock Holmes suspects his archenemy Professor Moriarty is once again plotting something diabolical. Sherlock's companion, Dr. Watson, suggests Moriarty may be responsible for MI6's recent issues with their supercomputer, *The Beast*. Shortly after resolving to investigate, Sherlock receives a note from Moriarty bo...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static void decentNumber(int n)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\npublic class Solution {\n\tstatic BufferedReader in = new BufferedReader(new InputStr...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Solution {\n\tpublic static int intValueOf( String str )\n\t{\n\t int ival = 0;\n\t \n\t for(int i = 0; i < str.length(); ++i) {\n\t \tival *= 10;\n\t \tival += str.charAt(i) - '0';\n\t }\n\t return i...
{ "class_name": null, "func_sign": [ "decentNumber(n)" ], "solution": "T = int(input())\nfor i in range(T):\n k = int(input())\n n5 = k\n n3 = 0\n done = False\n while n5 >= 0:\n if n5%3 == 0 and n3%5 == 0:\n for j in range(n5):\n print('5',end='')\n ...
eJzs3c1O7DgaBuBZzIVEXtciifPLfu5hpLHEArJgY2qRkpAQrbm7ua1JjlBG3Wqd7jnNwQU8z4JPTmzX60JUqYA4//77P3/5zz/+9q/n8JDPlzXcVKHpUp6HOvYpNzHGlOPcdNuxbmqnOeW2j9PWin3XtimPXTNNKfdjM26lbZo57j2neevZDO23c8PYDduArf8+IA7j1iWcqrA8nZe7dbm/fbysr4/dAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
null
4,879
Chief Hopper
Chief's bot is playing an old DOS based game. There is a row of buildings of different heights arranged at each index along a number line. The bot starts at building $0$ and at a height of $0$. You must determine the minimum energy his bot needs at the start so that he can jump to the top of each building without hi...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int chiefHopper(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\npublic class Solution {\n\n public static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.lang.Math;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner input = new Scanner(System....
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n\n\tprivate static class InputArray {\n\t\tfinal StringTokenizer strt;\n\t\tpublic final int length;\n\t\t\n\t\tInputArray(String str, int N){\n\...
{ "class_name": null, "func_sign": [ "chiefHopper(arr)" ], "solution": "N = int(input())\nheights = [int(n) for n in input().split()]\n\nmax_h = max(heights)\n\ninterval = [1, max_h]\n\ndef get_final_energy(e, heights):\n\tfor h in heights:\n\t\te = 2 * e - h\n\treturn e\n\nwhile interval[0] < interval[1] -...
eJzk3U2uJE2WFmAGiDFLCNUYJHe38xesBImWGEAPmDQMuiUkhMTS8fNEllSo1StgULfyy7wW4W72mtmxxyPz/p9//R//7b//N//qP/2vv/y3f/gf//SPf/kPn7881/13/3B/ns/5xCc/9enPfL6f+/rc9+d+Pvf53PG583PX5+7PPZ/7+3muz/O2eT7P+TzxefLz1OfpzzOf5/s51+fcn/O+5Pmc+Jz8nPqc/pz5nO8nrk/cn3g+8b5jfCI/UZ/oT8wnvp+8Pnl/8vnk+eR7QfnJ+mR/cj75/dT1qftTz6fOp+JT7/XWp/pT86nvp69P...
null
1,905
Sam and substrings
Samantha and Sam are playing a numbers game. Given a number as a string, no leading zeros, determine the sum of all integer values of substrings of the string. Given an integer as a string, sum all of its substrings cast as integers. As the number may become large, return the value modulo $10^9+7$. **Example**...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int substrings(String n)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatch...
{ "solution": "/*\n JAI MATA DI\n */\n\nimport java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.sql.Array;\npublic class CP {\n static class FR{\n BufferedReader br;\n StringTokenizer st;\n public FR() {\n br = new BufferedReader(new In...
{ "solution": "import java.util.Scanner;\n\npublic class SamAndSubstring {\n\t\n\tprivate static final int MOD = (int) Math.pow(10, 9) + 7;\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner in = new Scanner(System.in);\n\t\tString input = in.next();\n\t\tin.close();\n\t\t\n\t\tlong cumSum = 0;\n\t\tlon...
{ "class_name": null, "func_sign": [ "substrings(n)" ], "solution": "import operator\n\nMOD = 1000000007\n\ns = input()\nn = len(s)\na = []\np10 = 0\nfor i in range(n, 0, -1):\n\tp10 = (p10 * 10 + 1) % MOD\n\ta.append(p10 * i % MOD)\n\nb = [ord(c) - ord('0') for c in s]\nprint(sum(map(operator.mul, reversed...
eJzs3cuqbluy1XERH+SQZQvjfvFJBAULegpW1MIRBBF8dOP3H3OLsHM/gDpTOTlzrbm+b1x6jx7RorUW//Nf/Ov3H/75P/s3//1v//E//Zf/+k9/+1f/8Lf32a7jed/lOK71vpf12p7tPrZnWbftepft+tu//Ie//eN/+y//+O//6R//w7/7z//1n37+4bMt+7u/x/Vv/9Pf/se//If/4yPXbT/O637e5f/un/7ixs972+YZnc+fbny7t2M5luU+r/U9lvt91+d851m+z3s+13Fs63pf5/U8y/ley7Zc57tt+7tuyzG/9xzbfm7zp8v8...
null
21,650
Decibinary Numbers
Let's talk about *binary numbers*. We have an $n$-digit binary number, $b$, and we denote the digit at index $i$ (zero-indexed from right to left) to be $b_i$. We can find the *decimal* value of $b$ using the following formula: $$(b)_2 \Rightarrow b_{n-1} \cdot 2^{n-1} + \ldots + b_2 \cdot 2^2 + b_1 \cdot 2^1 + b_0 \c...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static long decibinaryNumbers(long x)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int max = 600000;\n int size = 20;\n \n int[...
{ "solution": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.Writer;\nimp...
{ "class_name": null, "func_sign": [ "decibinaryNumbers(x)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\nimport bisect\nimport array\nimport timeit\nfrom itertools import repeat\n\ndef decbinValue(x):\n ans = 0\n p2 = 1\n while x > 0:\n ans ...
eJx0vbuudduSpYWByUOU0i6j3/voGDwHElvCgDJwkjKqJCSExHvxcrTvi7kSVFKdk9q5z/+vNecY/RKXFi1a/N//7f/4//wP/91/8z/9n//yv/3rf/zP/+lf/vt/9y/f2P/8656tfae3e7959vjnX2dfZ47v3XVPf/P7519X67edOdfc495//rXP77737pzt+/rr+Ylv3vGttfYZJz/6z7+O9s799run7fyXT+lj3z2/b51vvZ4/+e7X9ty9tdbXd/InM9+wz1trzLvWzHflHyMfm9+db8z3z7+e++5tvY/7jb5Hvvycs/a67a7e1njt...
null
658
Mr K marsh
Mr K has a rectangular plot of land which may have marshes where fenceposts cannot be set. He wants you to find the perimeter of the largest rectangular fence that can be built on this land. For example, in the following $m \times n = 4 \times 4$ grid, $x$ marks a marsh and $.$ marks good land. .... ..x. ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static void kMarsh(List<String> grid)" ], "script_name": "Solution", "solution": "\nimport java.awt.Point;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable {\...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int m, n;\n static String[] land;\n\n static int[][] row;\n static int[][] col;\n\n public static void main(String[] args) {\n S...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\tprivate static StringTokenizer tokens = new StringTokenizer(\"\");\n\tprivate static BufferedReader in;\n\tprivate static BufferedWriter out;\n\t\n\tpublic static void main(String[] args...
{ "class_name": null, "func_sign": [ "kMarsh(grid)" ], "solution": "import sys\nm, n = map(int, sys.stdin.readline().split(' '))\nland = []\nfor _ in range(m):\n l = sys.stdin.readline()\n land.append([0 if c=='.' else 1 for c in l])\n\nnext_free_below = [[-1]*n for _ in range(m)]\nfor i in range(n):\...
eJztfe2uZbeN5QAzmOco1G9DKLsdJ86TDDAZBOikfhjotg3EBgQEAeYh5jXnHcb3nC2S4pconX0r3UMuu+49Z2+JpLhISvvz/u//9j/+6//97//lf/794w8//vzrLx//+OHj1998+PrT93/6sUXRnz8633D9/G1Pb7i3i75v/4Q62Ux2sluIjdDluYmokx37ZGvXG9mqFcv56ExxqLmzzbo/ep++XgB13bXbMYl5WBcztpqh0uewkNLk3jEebjkZsKdu+qhr7qIxNYO54bc9v6nDLnOo6zHX571gOaFDV/6wTo5OsY1sImk2deljAMae...
null
530
Alien Languages
Sophia has discovered several alien languages. Suprisingly, all of these languages have an [alphabet](http://en.wikipedia.org/wiki/Alphabet), and each of them may contain thousands of characters! Also, all the words in a language have the same number of characters in it. However, the aliens like their words to be aest...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int alienLanguages(int n, int m)" ], "script_name": "Solution", "solution": "\nimport java.awt.Point;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static final long MOD = 100_000_007;\n\n static int alienLanguages(int n, int m) {\n int[][] t = new int[n + 1][20];\n int nb = n / 2;\n\n for ...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class Solution {\n\t\n\tprivate static final long MOD_VALUE = 100000007;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner in = new Scanner(new...
{ "class_name": null, "func_sign": [ "alienLanguages(n, m)" ], "solution": "# Enter your code here. Read input from STDIN. Print output to STDOUT\nmod = 10**8 + 7\n\nfor cas in range(int(input())):\n n, m = map(int, input().strip().split())\n v = [2*i > n for i in range(n+1)]\n for i in range(n-1,-...
eJx9VruuVEcQJHDAZ4w2Rla/H/4SJK/lwL4ByZrgXgkJIRGROYP/pfpcBJbPDpvsnjMz3dXVVT378Zcv/758cXxef8KP399f3tzePj1eflsXu96YltN8rjehxdeb0lI8GL76eru8WpeHd28f/np8+PvPf54evx1s7ejOnvPXW5J0Oun1VinUGghz+fBq/SeTIzxOyFIPk0kmgif2aovrrRuvV4q5YKk1fWWUFFakiFfSc9D7aCqZsQ+73cjVGhElTbQFFbZ5dwxWCcTiPoFDZF778OdqbGJx1cruSqTwymWoi4YRlfKlmoaiuwTwZ8X3...
1
776
Red John is Back
Red John has committed another murder. This time, he doesn't leave a red smiley behind. Instead he leaves a puzzle for Patrick Jane to solve. He also texts Teresa Lisbon that if Patrick is successful, he will turn himself in. The puzzle begins as follows. There is a wall of size *4xn* in the victim's house. The vict...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int redJohn(int n)" ], "script_name": "Solution", "solution": "/* HackerRank Template */\n\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.fill;\nimport static java.util.Arrays.binarySearch;\...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\tstatic final int N = 220000;\n\t\n\tstatic void solve() throws Exception {\n\t\tboolean[] used = new boolean[N];\n\t\tfo...
{ "class_name": null, "func_sign": [ "redJohn(n)" ], "solution": "# return the number of combinaison for a wall of length N. Use memoization.\nnbCombMem = ([],[])\ndef nbComb(N) :\n if N in nbCombMem[0] :\n return nbCombMem[1][nbCombMem[0].index(N)]\n if N < 0 : return 0\n c = 1\n for i in rang...
eJzNVsuO1EAM5MCNnxhy4rBC/U6aL0FiEAeYA5ewh1lpJYTER8D/4nK5M6NMOkIsSKwSJelxt8vlsr3fn/989eKZ/r19KS/vvg6f5/uH8/DmMPh0nP1xDk5uvEa5p+McR/mWp/dcn+xTlmORZzjOw91hOD3enz6eT58+fHk424FyUIG1S9ydxHRyoywVn3kQfkr2HeXn4pIs1+Hb3eEKGSA1X0FgyWuUXQEQgDDyfC9mCCITfIA1QIuFs08ad/Cac9mds9lO8pJKwNljhcucoiIHGhqpZy+7qrw4tRxtxXHDKhrj2XMrAkBcsB8Z00jS...
null
32,644
Organizing Containers of Balls
David has several containers, each with a number of balls in it. He has just enough containers to sort each type of ball he has into its own container. David wants to sort the balls using his sort method. David wants to perform some number of swap operations such that: * Each container contains only balls of the sa...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String organizingContainers(List<List<Integer>> container)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n publi...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "organizingContainers(container)" ], "solution": "#!/bin/python3\n\nimport sys\nfrom collections import Counter\n\n\nq = int(input().strip())\nfor a0 in range(q):\n n = int(input().strip())\n M = []\n for M_i in range(n):\n M_t = [int(M_temp) for M_temp in...
eJztnNuOG0UQhrngQVq+jlAf58Ab5I5LJBaBgBWKlGxWSiIhISQeAt6Ch+T/u8f2jE87tudQveqtrHdm3Kev66+qdi7899f//v7fV/Hn+59x8cOfm3dPz18+b75VG//wZB6e7MMTLrxyyihca1xYhScB954XeKyCCrGlqytlDXu1rbKhwRN2gbGd6f3ZvFGbxz+eH3/9/PjbTx+/fO7m/O7jp0/vfnn/+PD09sPzyetti81fb9TRYjl+nENzlu7VpPn3j9JfXHVr6x6ZYcv9ALuWZtdyx7S76U/U65jap5bDyfRwzEF3c9i95ZY6FYJy...
null
1,331
Service Lane
A driver is driving on the freeway. The check engine light of his vehicle is on, and the driver wants to get service immediately. Luckily, a service lane runs parallel to the highway. It varies in width along its length. ![Paradise Highway](https://hr-testcases.s3.amazonaws.com/1331) You will be given an array of wid...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> serviceLane(int n, List<List<Integer>> cases)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n publ...
{ "solution": "import java.util.*;\n\npublic class ServiceLane {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int t = sc.nextInt();\n int[] arr = new int[n];\n for(int i = 0; i < n; i++) {\n arr[i] = sc.nex...
{ "solution": "import java.util.Scanner;\nimport java.util.ArrayList;\n\npublic class Solution {\n public static void main (String[] args) {\n Scanner stdin = new Scanner(System.in);\n int freewayLength = stdin.nextInt();\n int numTestCases = stdin.nextInt();\n ArrayList<Integer> freewa...
{ "class_name": null, "func_sign": [ "serviceLane(n, cases)" ], "solution": "import sys\n\nN, T = [int( item ) for item in next( sys.stdin ).split()]\nW = [int( item ) for item in next( sys.stdin ).split()]\nfor line in sys.stdin:\n i, j = [int( item ) for item in line.split()]\n print( min( W[i:j+1] ...
eJzsu8tuJVu6neeG4ecI7PZpcM651iKprl/CgAtQQ6qGOlunUQcQIAjQC/qdHMEscnzfmJF1BLthwz5g7UwyYl7+y7j8ZCX/+//8v/2v/8f/8j/97//1j//05z//y9/++HfHH58fH8fH51/+HMc65jHO/9b5Mb4+Gz9fr6+36+9P18+qX5/Nn53fu8bXu+/V6+9/53meLN05/n7S+LnVe7/Xf0cx//7V/Nm7dML3HevnxPFz2vrZ3VkmltzxnVn2rrp7anfOzd6hPbk/kX6vT01Si4ksGBlP6c+ZYyrAr7/7k6i+s134ej9n/OxZWMtq...
null
4,432
The Grid Search
Given an array of strings of digits, try to find the occurrence of a given pattern of digits. In the grid and pattern arrays, each string represents a row in the grid. For example, consider the following grid: <pre> 1234567890 09<strong>876543</strong>21 11<strong>111111</strong>11 11<strong>111111</strong>11...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String gridSearch(List<String> G, List<String> P)" ], "script_name": "Solution", "solution": "import java.util.*;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner cin = new Scanner(System.in);\n \n int T = cin...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Solution {\n\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int cases = Integer.parseInt(br.readLine());\n MAIN:...
{ "class_name": null, "func_sign": [ "gridSearch(G, P)" ], "solution": "def pattern_here(G, row_i, g):\n i = G[row_i].find(g[0])\n while i != -1:\n found = True\n for j in range(1, len(g)):\n if G[row_i + j][i:i+len(g[j])] != g[j]:\n found = False\n if fo...
eJyV3b+uLkuSFXAMHuSo7RGqzKrKykJ4CBcMHBAXYUAbOJcxeiQkhMRDgHhd1m/VvtJI/BENMz19ztn7+6oyIyNWrFgR+d/+4f/4p//zH/T//at/kv/yb/7Ln/7j73/7d3/50z/+9afzt9/n82vev/1+3tc51vOOMc/5Pus9nms9z/Pmn9Zc53WtN3+z7+d699zXvq/nt9/XOY/3Otc7xzj3+c5n5c/jPn3g+V77utca73Udx/3c485v5rvysfOa9zPGNeZaz7mf+175r7/9/uZTrvzGu9d9Huc459zPe1/Xb7/n89481Twfn7WPMZ/8...
null
13,512
Ema's Supercomputer
Ema built a quantum computer! Help her test its capabilities by solving the problem below. ------ Given a grid of size $n \times m$, each cell in the grid is either $good$ or $bad$. A *valid* plus is defined here as the crossing of two segments (horizontal and vertical) of equal lengths. These lengths must be odd, a...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int twoPluses(List<String> grid)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\n\npublic class Solution {\n private BufferedReader in;\n private StringTokenizer line;\n private PrintWriter out;\n\n p...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Solution {\n static int twoPluses(String[] grid) {\n int n = grid.length;\n int m = grid[0].length();\n ...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\npublic class ProblemC {\n BufferedReader rd;\n\n ProblemC() throws IOException {\n rd = new BufferedReader(new InputStreamReader(System.in));\n compute();\n ...
{ "class_name": null, "func_sign": [ "twoPluses(grid)" ], "solution": "\ndef solve(y, x, y1, x1, l):\n i = 0\n s = True\n t = True\n ans = []\n while True:\n if s:\n a = l[y + i][x] if y + i < len(l) else \"B\"\n b = l[y - i][x] if 0 <= y - i else \"B\"\n ...
eJzlVr1OwzAQZmDhLazMFWrSpAHGW+4VkAAxQAeW0iGVkBASDwEvwsbbEd+f7aRuk5lEdS7n+/N3n51+nn//XpzRdfvTC3fvxct2t++KG1eUlVvdbwHAD9gP6CXEROclpIFmIRmKhSs2b7vNU7d5fnzddxq4+Fi4OFHjWorsLx/OPzkDsNBnoMReT2WwjRjLlDfhMkErkjjsJgFB45AAkQ1NZWqumkHRjSuXFIjToMhocliPiIBmD0cy1cNMfR98KoJAkEGU5aLhBqrndMMSMKyUEQPxTWwUQ1sJg88zASXSZ8q/OtDdmiNyt0wejdY/...
null
16,411
Larry's Array
Larry has been given a permutation of a sequence of natural numbers incrementing from $1$ as an array. He must determine whether the array can be sorted using the following operation any number of times: - Choose any $3$ consecutive indices and rotate their elements in such a way that $A B C\ \rightarrow B C A\ \ri...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String larrysArray(List<Integer> A)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n static int[] aux;\n \n ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "larrysArray(A)" ], "solution": "import copy\n\nt = int(input())\n\nfor z in range(t):\n input()\n realList = [int(n) for n in input().split()]\n sortedList = copy.copy(realList)\n sortedList.sort()\n listLen = len(sortedList)\n for i in range(listLen -...
eJztnLvOZklyXWXoQQ7aHggn75n06ZIGHQpqSYY0Bp0WjSFAgCDAh5Deix5fR7FW5Fdd3dNVwzHkaTDVdfm/S57MyIgdO3bEv/zH//Nv/+0/+L+//df4w3/5px/+7qe//4c//PAXzw/lx59a/P8pT/3xpx9+9/zw+3/8+9//jz/8/n/+9//1D3+4r/nPf/k38bN//t3zy/eV943/PPVpT3/GM5/17Oc85X1KeUp9Snxqf8p4ynzKesp+ynnq+9R4T31qe2p/6njqfOp66n7qedr7tPK0+Mj2tP608bT5tPW0/bTz9Pfp5en16fGN/enj...
null
33,299
HackerRank in a String!
We say that a string contains the word `hackerrank` if a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of its characters spell the word `hackerrank`. Remeber that a subsequence maintains the order of characters selected from a sequence. More formally, let $p[0], p[1], \cdots, p[9]$ be the respective ind...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String hackerrankInString(String s)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\npublic class LCS {\n\n\tpublic static void main(String[] args) throws Exception {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tint q ...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'hackerrankInString' function below.\n *\n * The function is expected to return a STRING.\n * The function accepts STRING s as parameter.\n */\n\n public static String hackerrankInString(String s) {\n // Write your...
{ "solution": "import java.util.*;\nimport java.io.*;\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int q = Integer.parseInt(br.readLine());\n for (int test = 1; test <= q; test++) ...
{ "class_name": null, "func_sign": [ "hackerrankInString(s)" ], "solution": "#!/bin/python3\n\nimport sys\nimport re\n\nq = int(input().strip())\nfor a0 in range(q):\n s = input().strip()\n \n pattern = \".*h.*a.*c.*k.*e.*r.*r.*a.*n.*k.*\"\n m = re.search(pattern, s)\n if m is not None:\n ...
eJyMvMuu7Li2pncM+EEOdrsaokjq4n51yw13bHgCBsWreL9IoijDgF/Cz2c/h1secVAFuKrOMZzYSGSuvdaMCGqM//++CEX+7//t//Hf/F//9C9//Y//9//5T//0P/+v/zhjvq9//Hf//A9E/6Ln93Esx3rSO79jHm+9+EXGIPq+rDFuLy9ejGjh/p6UlnO/c/gqO4UfbEtJzqc9wkdxKqnyc+euye84qvIOawl/kMXzkk/qvGMarev32hU/1hSOTbka/dvDPBcx1R2taHqvnoQ+mMTbodrd8js7ktybgg2Ob9HGx/LNvzZx8bznIal8...
null
360
Quicksort 1 - Partition
The previous challenges covered [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort), which is a simple and intuitive sorting algorithm with a running time of $O(n^2)$. In these next few challenges, we're covering a *divide-and-conquer* algorithm called [Quicksort](https://en.wikipedia.org/wiki/Quicksort) (al...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> quickSort(List<Integer> arr)" ], "script_name": "Solution", "solution": "\n\n/* Head ends here */\nimport java.util.*;\npublic class Solution {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.ArrayList;\n\nclass Solution\n{\n\tprivate static BufferedReader in;\n\tprivate static PrintStream out;\n\tpublic static void main(String args[]) throws IOException\n\t{\n\t\tin=new BufferedReader(new InputStreamReader(System.in));\n\t\tout= new PrintStream(new Buffe...
{ "class_name": null, "func_sign": [ "quickSort(arr)" ], "solution": "size = int(input())\narray = input().split(\" \")\narr = ['None'] * size\nfor i in range(size):\n arr[i] = int(array[i])\np = arr[0]\nless = [ ]\nmore = [ ]\nfor i in range(size):\n if arr[i] < p:\n less.append(arr[i])\n e...
eJztnUuOJFmSXTngQgw5biNM/0+5EgJMgoNmDchBsgfVAAGiAS6CXBu3QznnPrWfm3t4fKoyspmNrkiPcPuoPn1P5MqVKyL/69/+n//2f/+N//cf/rF++I//85f/+ts//fNff/n3p1+Wbfz1t3ObhtM0jqdtWE7n+u8+7afzOq+nNp3Ow+VyqX+d+aNeN6zr6byM9cLGT+Ow1Uta/bLxsn0YT+dt2U7LNtTL1u207/XDtvOqpdUL6lXjMtcP83Qapvk0z3zSfFr25dT4y3qZ6t310esw8bL1NC/1yUu9dr3sp72+er3U9V4aX1zX2Lig...
null
33,549
Separate the Numbers
A numeric string, $s$, is *beautiful* if it can be split into a sequence of two or more positive integers, $a[1],a[2], \ldots ,a[n]$, satisfying the following conditions: 1. $a[i]-a[i-1]=1$ for any $1 < i \le n$ (i.e., each element in the sequence is $1$ more than the previous element). 2. *No $a[i]$ contains a leadin...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static void separateNumbers(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.StringTokenizer;\n\n/**\n * @author Aydar Gizatullin a.k.a. lightning95, aydar.gizatullin@gmail.com\n * Created on 17.02.17.\n */\n...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.util.*;\nimport java.io.*;\n\npublic class University_Codesprint_2_B {\n\n\tstatic BufferedReader br;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer st;\n\t\n\tpublic static void main (String[] args) throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in))...
{ "class_name": null, "func_sign": [ "separateNumbers(s)" ], "solution": "for _ in range(int(input())):\n s = input().strip()\n n = len(s)\n x = ''\n for i in s[:-1]:\n x += i\n y = int(x)\n z = ''\n while len(z) < n:\n z += str(y)\n y += 1\n ...
eJytlr1unFUQhilouAtr6wjN35mZQ08LBRSgLKIAF2mWFImEhCJxEXC/PPMZJQivnRhi2f6Od8+cM+/PvOvfP/3z+WefHF/ffcvi+W+nF5eXr1+dvrg51fkiLktky7ZekckrGUtWZ7auZWo7sttk+aoM3+dL72oR7dKp1PPFIndQLO6amxO0RNi3kgKR4oDc4rpCyruVV3T1+eIuWy3cM72KN8+X07Ob0+2vL29/enX784+/vH71d59ffX2+XP85vXl28w9AnLprV+XKEJ0utwCD5srPlzAaMm7lVxqP5A9JlkphxQasLRDRsUtJ+k7Z...
null
6,568
Funny String
In this challenge, you will determine whether a string is *funny* or not. To determine whether a string is funny, create a copy of the string in reverse e.g. $abc \rightarrow cba$. Iterating through each string, compare the absolute difference in the [ascii](https://en.wikipedia.org/wiki/ASCII) values of the characte...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String funnyString(String s)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMism...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int lines = sc.nextInt();\n sc.nextLine();\n outer:\n for(int i = 0; i < lines; i++) {\n String s = sc...
{ "class_name": null, "func_sign": [ "funnyString(s)" ], "solution": "def isFunny(s):\n for i in range(1, len(s)):\n if abs(s[i] - s[i-1]) != abs(s[-i-1] - s[-i]): return False\n return True\n \n\nif __name__ == \"__main__\":\n num_cases = int(input());\n for case in range(num_cases):\...
eJztvNeOxNyaHeYLP8jg3PhGEJiD75hzznQbBnPOmYYAP4R1rVc1f2NsCEfWaPIZ+fS30OhifdVVmzusb63qTf4f/+N//Pf/6X/4vyP8n74H/8v//qdmnI/9T//z3/wJ/BmPuzjrObuHIuvqcm2q9E7yYty7657b4V3OLi/7ZV2Xqt7TcmjaedzXujreuezrcxvSLW+v/tib65rbrZ+ucbymfmvn62r2o7/afEuH7az7cn6Pql73cW6boUz3uvrjXfsy787lHdr5vrp9LPLkTqtmLesuK4Y7m+uzuI+f8U//7m/+VNxzke1F/r9Nx/63...
null
4,099
Alternating Characters
You are given a string containing characters $A$ and $B$ only. Your task is to change it into a string such that there are no matching adjacent characters. To do this, you are allowed to delete zero or more characters in the string. Your task is to find the minimum number of required deletions. **Example** $s = ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int alternatingCharacters(String s)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\npublic class Solution {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint t = nextInt();\n\t\tfor (int tt = 0; tt < t; ++tt) {\n\t\t\tString s...
{ "class_name": null, "func_sign": [ "alternatingCharacters(s)" ], "solution": "def f(s):\n return sum(1 for c1, c2 in zip(s, s[1:]) if c1 == c2)\n\nt = int(input())\nfor _ in range(t):\n print(f(input()))", "template": "#\n# Complete the 'alternatingCharacters' function below.\n#\n# The function is...
eJx0lD2yZUuTFREYCNbGCBBBihwFZjABlDYEkFCYHrPCur8Kd499qqveq3vP2Znxs5av/X///X/9f//lP/67//Z//ul//PP//N//65/+83/4p//03//5zb/8/dd/3r/8fP/y81//nfnHN/vjXx/8+fCPx/vhH3cmV//8Ojn2j4Lz8ss/Cr2h257e797bs2/P7iUq0sG/k1l2JCab2Wn/dODn/OPPP3qMi3QrvxiKWvOMgmor4ewCrPqm8k3KZ8rz7x8/Xt35c5uuqvfn+XfUaL139+JYqK2O0PtnPXFaTP3TLxNEyM8Qntbx1YOTa71/...
null
21,083
Highest Value Palindrome
Palindromes are strings that read the same from the left or right, for example <em>madam</em> or <em>0110</em>. You will be given a string representation of a number and a maximum number of changes you can make. Alter the string, one digit at a time, to create the string representation of the largest number possi...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String highestValuePalindrome(String s, int n, int k)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "highestValuePalindrome(s, n, k)" ], "solution": "n, k = map(int, input().split())\ns = list(input())\n\nf = 0\nfor i in range(n // 2): f += s[i] != s[n - 1 - i]\n\nif f > k: print(-1)\nelse:\n for i in range(n // 2):\n if s[i] != s[n - 1 - i]:\n f -...
eJzs3cuqbtmW3XeB9SDBKcsw7xe9g+sGB7hgZUGVsAopEAiD31Ev5P77zxXGhPOkcBqBCnuTnIzYsdb3zcsYffTeemut/5//+n/+L//T//Cv/pf//Ld//8d/+I//+Ld/+9vf7t/W9fc/luPcj/f6/Y+//Zvf/vYP/+k//MP/9o//8O/+1//9P/7jz0+935+//R//5rf/x+/uv22//7Fex9//teuvv/L+dv7+x/ts5/pc7/PPfd+zPv/EN66/re+x3r//sa/7eS73uTzXsmzvdqzX+m7X/rznsvuBf/5O/t6fv37f/dt7Xdtc87PN83m2...
null
17,338
Bear and Steady Gene
A gene is represented as a string of length $n$ (where $n$ is divisible by $4$), composed of the letters $\text{A}$, $\text{C}$, $\text{T}$, and $\text{G}$. It is considered to be *steady* if each of the four letters occurs exactly $\frac{n}{4}$ times. For example, $\text{GACT}$ and $\text{AAGTGCCT}$ are both steady g...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int steadyGene(String gene)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] arg...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\t\n\tstatic final String GENES = \"ACGT\";\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tString s = nextToken();\n\t\tint[] a = new int[n...
{ "class_name": null, "func_sign": [ "steadyGene(gene)" ], "solution": "\ndef solve(S,n) :\n count = {}\n for c in S :\n count[c] = count.get(c,0) + 1\n\n for c in count :\n if count[c] > n//4 :\n count[c] = count[c]-n//4\n else :\n count[c] = 0\n\n if ...
eJykmrGutVtyVQnIeAmrYwfYEkYgEZQqqBeoAAlLBNABSeOgLSEhJN6W1+DsGmOufVqIqNvu2/f+95y9v2+tWlVzjrn+97/8j//h//yrf/Gf/ucf/tuf/umf//yHf/83f/j7f/MP//in+iv/03/lf+av/M/+lf/5xz/94W//5g9//B//9Mf/8uc//tf//N//+c+uzr/++Tf/62//5td6/d3f/yxX7/vq/++v/sP/+6v/7t/+3d/9/HH3rVjNVs3U/Hza5xP75x9//my7fv778381n//r+vnBz1/75y/7+ffzWa/++d/5/PbnH/bzfz9/...
null
66
Find Strings
A substring is defined as a contiguous sequence of one or more characters in the string. More information on substrings can be found [here](http://en.wikipedia.org/wiki/Substring "Substring"). <br> You are given *n* strings w[1], w[2], ......, w[n]. Let S[i] denote the set of all distinct substrings of the string w[i...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<String> findStrings(List<String> w, List<Integer> queries)" ], "script_name": "Solution", "solution": "\nimport java.io.* ;\nimport java.text.DecimalFormat;\nimport java.util.*;\nimport static java.lang.Math.* ;\nimport static java.util.Arrays.*...
{ "solution": "import java.io.* ;\nimport java.text.DecimalFormat;\nimport java.util.*;\nimport static java.lang.Math.* ;\nimport static java.util.Arrays.* ;\n\npublic class Solution {\n public static void main(String[] args) {\n new Solution().solveProblem();\n out.close();\n }\n stati...
{ "solution": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Comparator;\n\npublic class Solution \n{\n\tstatic int sa[],rank[],lcp[];\n\tpublic static void main(String args[])throws IOException\n\t{\n\t\tBufferedReader br=...
{ "class_name": null, "func_sign": [ "findStrings(w, queries)" ], "solution": "import sys\ndata = sys.stdin.readlines() \n\ndef get_suffixes(string):\n suffixes = set()\n string_len = len(string)\n for index in range(0, string_len):\n suffixes.add(string[index: string_len])\n r...
eJztfduO7DiWnQ34Qxr1PDDifvGbgXkZwPCjYcBpGLxJJEVSFCleRMOAP8I/5y/wb3hRWT0YdHfVTPdUd9U5qdh1spQKhcR9W2ttZWbE//53//X//r9/+2/+2//8QTmf1h/+w+9+ON8+nNW0xXmhrbk4EtZcMHWyha7WjlGo1ZZAFz5J49IkiCdxImkwLRmyljgyI7VcS+NLVWHwyigtnG5qyVxx73wcMxV0G9zgtbfJ22byMi2pNRU+nFLZzXab/LIZGhJfsoy0ri5LMSvf+LyOwg55C06weajRb3ktkys81JVOKo6OC7rYNjKXk2N1...
null
21,767
Gridland Metro
The city of Gridland is represented as an $n \times m$ matrix where the rows are numbered from $1$ to $n$ and the columns are numbered from $1$ to $m$. Gridland has a network of train tracks that always run in straight horizontal lines along a row. In other words, the start and end points of a train track are $(r, c1)...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int gridlandMetro(int n, int m, int k, List<List<Integer>> track)" ], "script_name": "Solution", "solution": "/*\n * Code Author: Akshay Miterani\n * DA-IICT\n */\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.math.RoundingMode;\nimpor...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"...
{ "class_name": null, "func_sign": [ "gridlandMetro(n, m, k, track)" ], "solution": "from collections import defaultdict\n\nn, m, k = map(int, input().split())\n\ntracks = defaultdict(list)\nfor _ in range(k):\n row, c1, c2 = map(int, input().split())\n tracks[row].append((c1, -1))\n tracks[row].ap...
eJzsvUuuLTuuLWYDbsjCLb+C/h+3xIAP4IJ9C66kX+E+wIBhwN11L8wxBknF2nlPC5wnc0ux5pwRIVH8DFIS9f/8D//T/9v++//uf/6//u1//8d//W//8W//48+/1braTzvt7p86+1//uMcu7IP11z9G6T9t9Hb0/V//mHfYd7es8dc/2rDb+rTb/Ms+8GXdtdlT+rLP7XLGt7tPfrvK/esftY7zU5s9KL4+/eLrM/bC19PacFcv+eyJZ88y7cu2f87o2aazD+6cpR9roH2Jh+S3dTb0ZozZ/vrHqvVn4FHRnbnsy3G2Xd/Wfu6478ba...
null
27,771
Minimum Loss
Lauren has a chart of distinct projected prices for a house over the next several years. She must buy the house in one year and sell it in another, and she must do so at a loss. She wants to minimize her financial loss. **Example** $price = [20, 15, 8, 2, 12]$ Her minimum loss is incurred by purchasing in y...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int minimumLoss(List<Long> price)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\npublic class b {\npublic static void main(String[] args) throws IOException {\n\tinput.init(System.in);\n\tPrintWriter out = new Pri...
{ "solution": "import java.util.*;\n\npublic class hello\n{\n public static void main(String []args)\n {\n Scanner sc=new Scanner(System.in);\n \n int x=sc.nextInt();\n long a[]=new long[x];\n \n HashMap <Long,Integer> map=new HashMap<Long,Integer>();\n \n ...
{ "solution": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\n\n/*\nbr = new BufferedReader(new FileReader(\"input.txt\"));\npw = new PrintWriter(new BufferedWriter(new FileWriter(\"output.txt\")));\nbr = new Buf...
{ "class_name": null, "func_sign": [ "minimumLoss(price)" ], "solution": "n=int(input())\n\nl = [int(item) for item in input().split()]\nl2 = l.copy()\nd={}\nfor i in range(len(l)):\n d[l[i]] = i\nl = sorted(l)\nm = float(\"inf\")\nfor i in range(len(l)-1):\n if d[l[i+1]] < d[l[i]] : m = min(m,l[i + 1...
eJx03c+Krd+yJmQb9ryJw2lXY/yZMyKGVyJYYENLsHOsRgmCCN6Cd+x63vlbBxtajcwPag4Oe7+xV2Y+X4yI/+u//u/+5//7v/mv/vv/41//l3/7z//bf/nX//Zf/vXz3vuP//Zda/2Lx3/583Q8taePp6+n8nQ9jaf952k7MU5sJ8aJ7cQ4sZ0YJ7YT48Rxop04TrQTx4l24jjRThwn2onrRDlxnSgnrhPlxHWinLhOlBMfJ75OfJz4OvFx4uvEx4mvEx8nvk58nfg48XXi48TXiY8TXyc+Tnyd+DhRTlwnyonrRDlxnSgnrhPlxHWi...
null
458
Missing Numbers
Given two arrays of integers, find which elements in the second array are missing from the first array. **Example** $arr = [7, 2, 5, 3, 5, 3]$ $brr = [7, 2, 5, 4, 6, 3, 5, 3]$ The $brr$ array is the orginal list. The numbers missing are $[4, 6]$. **Notes** * If a number occurs multiple times in the lists, ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> missingNumbers(List<Integer> arr, List<Integer> brr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n ...
{ "solution": "import java.util.*;\npublic class hello\n{\n public static void main(String []args)\n {\n Scanner sc=new Scanner(System.in);\n \n int x=sc.nextInt();\n \n // HashMap<Integer,Integer> map=new HashMap<Integer,Integer>();\n \n int f1[]=new int[10001];\...
{ "solution": "import java.util.*;\n\n/**\n * Created by Bruno on 05/08/2014.\n */\npublic class Solution {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n\n //Construct A\n int n = scan.nextInt();\n Map<Integer, Integer> A = new HashMap<>(n);\n ...
{ "class_name": null, "func_sign": [ "missingNumbers(arr, brr)" ], "solution": "n = int(input())\nA = [int(i) for i in input().split()]\nm = int(input())\nB = [int(i) for i in input().split()]\nvals = {}\nfor i in A:\n if i not in vals:\n vals[i] = -1\n else:\n vals[i] -= 1\nfor i in B:\...
eJzsvcuO7TqyJNiD7v8InPEdiKKeNerPaKA3UIOqHNRk9x3kBQooFNDD/uxeorubGRmkQrEfJ09mBe65K1csSXz4w9zcSWr/v//7//V//n//x//2f/+PP/7b93//j7//8Z/e/ji289v39JbOt/n13/qW0tuyvq3HW97f9reU33J6e/39+t/1+un1+bq8pOu+1/fX9bRftyzndU96m68Pu7ZcD75azOf13+uvZX+b92jnLO28eng1vl7dv5pa8tXOq4n9+niNJ1+t5XL51dCars7KQF//+3p8TqVrG8Z63b2UIb9uuL6UgeUynHX19pPd...
null
1,629
Cut the Tree
There is an undirected tree where each vertex is numbered from $1$ to $n$, and each contains a data value. The *sum* of a tree is the sum of all its nodes' data values. If an edge is cut, two smaller trees are formed. The *difference* between two trees is the absolute value of the difference in their sums. Given ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int cutTheTree(List<Integer> data, List<List<Integer>> edges)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Ar...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.*;\n\npublic class Solution {\n static class TreeNode{\n int value;\n int number;\n ArrayList<TreeNode> children;\n public TreeNode(int value,int number){\n this.value = value;\n this.number = number;\n children = new Arra...
{ "class_name": null, "func_sign": [ "cutTheTree(data, edges)" ], "solution": "from collections import deque\n\nclass Node(object):\n def __init__(self,index,value):\n self.index = index\n self.value = value\n self.children = set()\n self.parent = None\n self.value_of_s...
eJzsncvKNUl2nj0wvo5NjXuQccg46EoMLtBAqoE8KPWgGwRCoKv1dTie5439dSPTMxtsMFLXF3/uzMjIiHVeb6z49//8X//7//gv/+m//esv//T7H//8p1/+7vPL/vX3+ZZPKZ/Vn/O/8Vm1fdpz/s7xaXN99vv++nv51F9/r5/26+/t03/9vX9e/jn45+TXdbr57F/+8Pnlt3/542//8Kff/vHv//nPf7rvqKWeZ375tz98/urFvb3nybrm563vZ6/6We28//20eprzvOG8+x31U+b7mbOc28bn/P+7+qedu89o32d/3k8v/bPH49+3...
null
11,782
Gena Playing Hanoi
The [Tower of Hanoi](https://en.wikipedia.org/wiki/Tower_of_Hanoi) is a famous game consisting of $3$ rods and a number of discs of incrementally different diameters. The puzzle starts with the discs neatly stacked on one rod, ordered by ascending size with the smallest disc at the top. The game's objective is to move ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int hanoi(List<Integer> posts)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static int[] readIntArray3...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.Queue;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter ...
{ "class_name": null, "func_sign": [ "hanoi(posts)" ], "solution": "#!/bin/python3\n\nimport sys\n\ndef getRod(position, disc):\n return (position>>(disc*2))&3\n\ndef setRod(position, disc, rod):\n position = position & ~(3<<(disc*2)) | (rod<<(disc*2))\n return position\n\ndef getPosition(rods):\n ...
eJylU0sOgjAQdcFBJl0TQz+CeBKNGE2UhRt0AYmJIfEQel9nKAuc0koCkwKLeZ95bV/R5xQtume7w5/9U1yre1OLDYisqCRoLIXLgCoqEYMoH/fyXJeX462p+0aZijaGATIlpOmQiPXjNMOhREhHsXZkViADgJXrS4N1hm+/L46TOI+3OxlzhQKTx+hyVpRw5yuQcz4vr9w6IyH5V0ybOSFgZyBfdwwVyIu3y4QCc2qytzWdgp/yh8BPqNW2+Q2Wl8A4KSa0ZxrY8hPwTSQCBU75CfihsQSkKmHw9WcwRmD66Ky6CV4nnYn28F5+AfbG...
null
28,492
Red Knight's Shortest Path
In ordinary chess, the pieces are only of two colors, black and white. In our version of chess, we are including new pieces with unique movements. One of the most powerful pieces in this version is the *red knight*. The red knight can move to six different positions based on its current position (UpperLeft, UpperRig...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end)" ], "script_name": "Solution", "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\ni...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'printShortestPath' function below.\n *\n * The function accepts following parameters:\n * 1. INTEGER n\n * 2. INTEGER i_start\n * 3. INTEGER j_start\n * 4. INTEGER i_end\n * 5. INTEGER j_end\n */\n\...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n \n static String[] sym = {\"UR\", \"UL\", \"R\", \"LR\", \"LL\", \"L\"};\n static int[] di = {-2, -2, 0, 2, 2, 0};\n static int[] dj = {1, -1, 2, 1, -1, -...
{ "class_name": null, "func_sign": [ "printShortestPath(n, i_start, j_start, i_end, j_end)" ], "solution": "from collections import deque\n\nsurround = [(-2, -1, \"UL\"), (-2, 1, \"UR\"), (0, 2, \"R\"), (2, 1, \"LR\"), (2, -1, \"LL\"), (0, -2, \"L\")]\n\ndef printShortestPath(n, i_start, j_start, i_end, j_e...
eJydlM1KxDAUhV3oexyyHiQ3f218A6ErQRCsCGoXA2OmMB0QRPAh9H09cboQh5ZpmhYK7Zd77slJPs+/64uz3+tO+HL/rtap3w/qCqpqk0eAhbRJraC6t757HrqXx+1+GH+xbbptwKE+VviD+jYZgm4GvX7tt7vd+mnT/WNZ1pLV0MvZOrMBgrCcNSwskXWlgpTwkU07mJoCjFvOO5omEAenYXyBb6zvuGB5xaoC/SIsGiJrw9DCAgViTZtqmAjrEKctsFR6g+WjOek+jiKjxCjO6MlyJlmSM1Ek2zD/E1sgbwK73Mhw0CwwhVtA5wws...
null
25,952
Roads and Libraries
Determine the minimum cost to provide library access to all citizens of HackerLand. There are $n$ cities numbered from $1$ to $n$. Currently there are no libraries and the cities are not connected. Bidirectional roads may be built between any city pair listed in $cities$. A citizen has access to a library if: * Thei...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static long roadsAndLibraries(int n, int c_lib, int c_road, List<List<Integer>> cities)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class S...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n public class Solution{\n static int unionfind(int index,int [] parent)\n {\n while(index!=parent[index])\n {\...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static class Edge {\n public int u, v;\n public long w;\n public Edge(int u, int v, long w) {\n this.u = u;\n t...
{ "class_name": null, "func_sign": [ "roadsAndLibraries(n, c_lib, c_road, cities)" ], "solution": "from collections import defaultdict\nfrom collections import deque\n\nfrom math import pi,cos,sin\n\nclass graph:\n def __init__(self):\n self.nodes = []\n self.edges = defaultdict(set)\n d...
eJw03TsObMlWBmEkmAZS645g53plJiNB4k4Ap4UBFg4TZE5QGdFOeWv34/ynan9W/M8//ev//vM//sO//fff/v3P//iv//zbv/zxt/X3P/v7/ojvrPkj/4i//7n4yN9H/T769zG/j/37OL+P+/tY3/tc7/MdrXe13tl6d+sdrne53ul6t/Fu490G/9R3G+823m2823i38W7j3ea7zXeb/Mu+23y3+W7z3ea7zXeb77bebb3berfFf+m7rXdb77bebb3berf9bvvd9rvtd9v8b3q3/W773fa77Xc773be7bzbebfzbof/x+923u2823m3...
null
784
Journey to the Moon
The member states of the UN are planning to send $2$ people to the moon. They want them to be from different countries. You will be given a list of pairs of astronaut ID's. Each pair is made of astronauts from the same country. Determine how many pairs of astronauts from different countries they can choose from. __...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int journeyToMoon(int n, List<List<Integer>> astronaut)" ], "script_name": "Solution", "solution": "\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n publi...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.LinkedList;\n\npublic class Solution {\n\n static boolean[] visited;\n static int N, L;\n stat...
{ "class_name": null, "func_sign": [ "journeyToMoon(n, astronaut)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n N, I = list(map(int, sys.stdin.readline().split()))\n \n # Count astronauts from different countries\n astronauts = [-1] * N\n countries = [...
eJws3Tuu7tqWXGsZMlWIibRl/Bx8qyQCdCogZ0MQ7rXkqOjqX+NxIhugZMyuXGPHWpOdQf7f//zf//d//S//6X/8n//4n//8r/////uP//b3H9v5+/3+tpHfv/4Z+Nc/29/61z/73/Gvf46/81//XH/3v/65/55//fPO/9r8P8//kv+t9bft8z/2v23+N7fzb7vmf1x/2/xvb8/f9s7/eP/WXLDGcBzX+ltzwTr+1riu82/NBev+W+O8nr81F+y/v32s9+1vN8L+t4/1fvztc8F+/e1jvd9/+1ywv3/HWB+/v2MuONbfMdbHDG3q8+8Y...
null
5,580
Breadth First Search: Shortest Reach
Consider an undirected graph where each edge weighs 6 units. Each of the nodes is labeled consecutively from 1 to n. You will be given a number of queries. For each query, you will be given a list of edges describing an undirected graph. After you create a representation of the graph, you must determine and report ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<Integer> bfs(int n, int m, List<List<Integer>> edges, int s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "\nimport java.util.*;\npublic class BreadthFirstShortestSearch {\n public static void main(String[] args){\n Scanner input = new Scanner(System.in);\n int test = input.nextInt();\n while(test > 0){\n int n = input.nextInt();\n int m = input.nextInt();\n ...
{ "class_name": null, "func_sign": [ "bfs(n, m, edges, s)" ], "solution": "class Graph(object):\n def __init__(self, N, M):\n self.N, self.M = N, M\n self.alist = {key:list() for key in range(1, N+1)}\n for index in range(M):\n t, h = [int(value) for value in input().split...
eJzsvcuKLtmT5SeEHuSjxl3g++rueg+BQAEaSD3QpNSDbhAIgR5ADy1f67fM42Sek3Xrqv7nIMlDRGTE55d9sduyZbb/3//hf/6f/r///r/7X/7vv/s//uE//Zf//Hf/4+fv2tc/9Pnp5/76h/bp+jL0ZerL0hf/4dSXS19ufWmHvzZ/9UXNVzVf1nxd84XNVzZf2nxt97Xd13Zf231tf67tenj/+KelL1tfTn259OXWFz28++HdD+9+ePfDux/e/fDuh3c/vPvh3Q/vfnj3w7sf3v3w8fGXpS9bX059ufTl1hc9d/i5w88dfu7wc4ef...
null
5,686
Kruskal (MST): Really Special Subtree
Given an undirected weighted connected graph, find the Really Special SubTree in it. The Really Special SubTree is defined as a subgraph consisting of all the nodes in the graph and: * There is only one exclusive path from a node to every other node. * The subgraph is of minimum overall weight (sum of all edges) amo...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int kruskals(int gNodes, List<Integer> gFrom, List<Integer> gTo, List<Integer> gWeight)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\nclass E...
{ "solution": "import java.util.ArrayList;\nimport java.util.LinkedList;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Scanner;\n\npublic class KruskalMSTReallySpecialSubtree {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n EdgeWeightedGraph ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Solution {\n\n private StreamTokenizer in;\n private PrintWriter out;\n\n private int[] parent;\n private int[] rank;\n\n class Edge {\n public int v;\n public int u;\n public int cost;\n\n ...
{ "class_name": null, "func_sign": [ "kruskals(g_nodes, g_from, g_to, g_weight)" ], "solution": "import os\nclass DisjointSet:\n def __init__(self, n):\n # Initialize parent and rank for union-find\n self.parent = [i for i in range(n)]\n self.rank = [0] * n\n\n def find(self, u):\...
eJxE/U2y7MyOdAd/DXW+rkaw7R0BIxi/0kRkpjsBdcrUkFrqaOjCWs48da3qPMjcmcwgGUQgAHfH//s//W//8//6/////e//z//4P/7r//y//6//8b/8/Y/+PM/fqn/+81/tr/+9Zb3/+a8y/vbZffznv96/8ff2/ZY5/ubfuHve//zX/Ft/a7e3/+e/1t/+G3O/9bX9d/7aPafePX/3b5zd/vNf9689f3u+49RPPH+t/a3VnzpGWa3/nX6fVS/6X3vr/+5TP4Q1/sZz65hltPm37+On5l9bf3OtUQcuq+2/+byMuKxWPz6nLxhGjXo9...
null
54
Clique
A clique in a graph is set of nodes such that there is an edge between any two distinct nodes in the set. Finding the largest clique in a graph is a computationally difficult problem. Currently no polynomial time algorithm is known for solving this. However, you wonder what is the minimum size of the largest clique in...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int clique(int n, int m)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatch...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int t = input.nextInt();\n for(int c=0;c<t;c++){\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static int getMaxNonMCliqueEdgeNumber(int n,int k)\n {\n int g1 = n%k ;\n int g2 = k - g1 ;\n int sz1 = n/k + 1 ;\n int sz2 = n/k ;\n int ret = g1*sz1*g2*sz2 + g1*(g1-1)*sz1*sz1/2 + g2*(g2-1)*sz2*sz2/2 ;\n ...
{ "class_name": null, "func_sign": [ "clique(n, m)" ], "solution": "import math\ndef s1(n, m):\n ga = n%m\n gb = m-ga\n sa = n//m+1\n sb = n//m\n return ga*gb*sa*sb+ga*(ga-1)*sa*sa//2+gb*(gb-1)*sb*sb//2\ndef s(n,c):\n l = 1\n h = n+1\n while l+1 < h:\n m = l+(h-l)//2\n ...
eJyVVstuXUUQZMGSBTu2I68Rmn538yVIGLGALNiYLBIJCSHxEfC/VM2Nrxw71yjRie058+qurqo+f3/57zdffXH+/fA1/vjxz7vfHt6+f3f3/boTv3+wTl+RnZX3DxM6S8V8pDlXkitmb9+Y87Dlsq1K9P4ho5aMa90/VOfS3nsCq2brstIww3m+x5d4jpZgDu+wsM22z/1DY7yk9tgOHBiZOFG8zRtbK3CQqkVbNhbvwd7YNeocTuny3TVu9w933667N3+8ffPLuze//vz7+3cf0sOhl0fs8kseX1zGyDDOo3d/fbue4oL5ToQOAFrH...
null
93
Matrix
The kingdom of Zion has cities connected by bidirectional roads. There is a unique path between any pair of cities. Morpheus has found out that the machines are planning to destroy the whole kingdom. If two machines can join forces, they will attack. Neo has to destroy roads connecting cities with machines in order ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int minTime(List<List<Integer>> roads, List<Integer> machines)" ], "script_name": "Solution", "solution": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Solution {\n\tstatic class Foo51 {\n\t\tstatic class No...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Queue;\n\n...
{ "class_name": null, "func_sign": [ "minTime(roads, machines)" ], "solution": "def leader(x):\n if P[x]==x:\n return P[x]\n if P[x]==x+10**5:\n return P[x]\n P[x] = leader(P[x])\n return P[x]\n\ndef same(x, y):\n return leader(x)==leader(y)\n\ndef canJoin(x, y):\n return not(leader(x)>=10**5 an...
eJxrYJnKxgABPUzRsVP0ABkLAyg=
1
17,340
Recording Episodes
Dave is a die-hard fan of a show called "HackerRank", in which a young programmer uses her problem-solving abilities to solve crimes. He splurged on a Digital Video Recorder (DVR) so that he can record HackerRank episodes and watch them later. Luckily, Dave managed to get his hands on schedules for all the episodes in ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> episodeRecording(List<List<Integer>> episodes)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n pub...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static class Graph {\n int[] ptr;\n int[] nxt;\n int[] suc;\n int index = 1;\n\n public Graph(int nodes, int egges) {\n ptr = new int[nodes];\n nxt = new int[egges];\n suc = new int[egges];\n }\n\n ...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "episodeRecording(episodes)" ], "solution": "#True if two intervals interesects\ndef has_intersection(I1,I2):\n if I1[0] >= I2[0] and I1[0] <= I2[1]: return True\n if I1[1] >= I2[0] and I1[1] <= I2[1]: return True\n if I2[0] >= I1[0] and I2[0] <= I1[1]: return T...
eJx9vc2uLcmSVU2DBwnddgmF/7vzJEgkogHVoJNUo0pCQkg06NGFl+NpsDHMY9eFzHO/u77DqZN7rxUrwt3cbNqc0/77v/zf//P//Av/v3/zP+Iv//a//uU//f4P//SPf/nXz1/qb7/39dvv5W3vU0Y/TynvfMra47ff96jl2evtzz5rPqfW89vvZ7X2nLXij1N2/NF4i3esp49znl7q+/Rd+m+/j1HPM8tpzzh9PnP197ffay/taaXWp+7ZnnpOfHot833qGPOpbcZ/WS0+aNbx7P0+Kz6l9LfFj7X46Dr3ip+I62n9jR8bp8Z7l/U+...
null
52
ByteLandian Tours
The country of Byteland contains N cities and N - 1 bidirectional roads between them such that there is a path between any two cities. The cities are numbered (0,...,N - 1). The people were very unhappy about the time it took to commute, especially salesmen who had to go about every city selling goods. So it was decide...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int bytelandianTours(int n, List<List<Integer>> roads)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n private static final int MODULUS = 1000000007;\n\n private static class Node {\n Set<Node> neighbors = new HashSet<>();\n }\n\n /*\n * Complete...
{ "solution": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Solution {\n\tpublic static void main(String [] args){\n\t\tfinal int MOD = 1000000007;\n\t\tfinal int MAXN = 10002;\n\t\t ArrayList<Integer>[] G = new ArrayList[MAXN] ;\n\t\t long [] fac = new long[MAXN] ;\n\t\t for(int c=0;c<MAX...
{ "class_name": null, "func_sign": [ "bytelandianTours(n, roads)" ], "solution": "import math\ndef tours(adj, N):\n facts = [0]*N\n z=0\n for i in range(len(adj)):\n vertList = adj[i]\n z_count = 0\n nz_count = 0\n for neighbor in vertList:\n if len(adj[neighb...
eJxU/b+Khcu28Oc5MPg2mhMrmFXjX01ficEbHEhf4GRbwScwCIHuyJHuT727nlrg7CSrNmet39vd831mjfG//1//H/+//+P/9n/5f/6v//X//vf//L/89//6v//81/rXv9fn869/f37+83/97H/9e//Ev/4dP/mvf+dP/evf9dP/+nf/zL/+PT/nX/8+P99//fv7sz7/+ed+1n/+ofWzfv+xtX/W7z+44mf9/qMrf9bvP7zqZ/3+46t/1u8Ba37W7xHr/KzfQ9b3Z/+esj8/+/eU/fu//Z//8f2zf0/Z8bN/T9n5s39P2fWzf0/Z/bN/...
null
42
Quadrant Queries
There are $n$ points on a plane. Each point $p[i]$ is described by $[x[i], y[i]]$, where $1 \le i \le n$. There are three types of queries needed:  1. `X i j` Reflect all points in the inclusive range between points $p[i]$ and $p[j]$ along the $x$-axis. 2. `Y i j` Reflect all points in the inclusive range betwe...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static void quadrants(List<List<Integer>> p, List<String> queries)" ], "script_name": "Solution", "solution": "/* Enter your code here. Read input from STDIN. Print output to STDOUT */\n\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\n...
{ "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\n\npublic class Solution {\n private static final int[] BC = new int[1<<16];\n public static void main(String[] argv) throws Exception {\n prep();\n BufferedReade...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n \n public static int[] arr;\n static class SegmentTree {\n public int[] c;\n public int start, end;\n public boolean lazyx, lazyy;\n public SegmentTree left,right;\n public SegmentTree(int st...
{ "class_name": null, "func_sign": [ "quadrants(p, queries)" ], "solution": "#!/usr/env python\n\nimport bisect\nfrom math import sqrt\n\n_Rx = [ 3, 2, 1, 0 ]\n_Ry = [ 1, 0, 3, 2 ]\n\ndef create_test( N, Q, fp):\n from random import randint as rand\n r = [ ( rand(-2, 2), rand(-2, 2) ) for i in range( N) ]...
eJzsvcuOJEuyZUeA/BBHjXtg+lblNMacnwQLIAHyDjgp9uA20ABBgJ9OWUvUIvPUrazb3TMCRBVOeoRbuJvpQ1Qee2/5f/6HP/6n//W//+/+5//rL//H3/7jf/rXv/yPn7+M569/K5/617/VT//r39pn/vVv/bP/+rfxKfHO/JR4a31KvLc/Jd48nxLvludT+cP4y3i/1E+NC0r71Lii9E/lkvFpXDI/jUvWp3HJ/jQuOZ8Wl9Tn0+OSWj6dG4g7iEtq+/S4pPZP55Lx4Q7r/AwuWZ/BJfszuOR8RlzSns+MS1r5zLik1c/kQeJJ4pLW...
null
1,090
HackerX
**Update:** A slight modification in the problem statement (see below) Evil Nation A is angry and plans to launch **N** guided-missiles at the peaceful Nation B in an attempt to wipe out all of Nation B's people. Nation A's missile _i_ will arrive in nation B at time t<sub>i</sub>. Missile _i_ communicates with its ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int missileDefend(List<List<Integer>> missiles)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.Arrays;\n\npublic class Solution {\n\n static class Point implements Comparable<Point> {\n int x, y;\n\n ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static class Point implements Comparable<Point> {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n ...
{ "solution": "//package hackerrank;\n\nimport java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\nimport java.util.stream.IntStream;\n\n/**\n * Created by raggzy on 4/17/2016.\n * OOOh this was hard.\n * 1. Build graph i,j <=> fj-fi <= j-i. This transforms in...
{ "class_name": null, "func_sign": [ "missileDefend(missiles)" ], "solution": "n = int(input())\n\ninp = (map(int, input().split()) for i in range(n))\n\np = sorted(list((a + b, a - b) for a, b in inp))\n\na = list(y for x, y in p)\n\nd = []\nfor x in a:\n\tlow, high = -1, len(d) # >, <=\n\twhile high - low...
eJx0vcuuLUuSXaeGPmQr29WI8LfzSwToAmyQ2WAnWY0sgABBQJ8uG2PGPiBKqATyXPe1Y8WK8Ie5PaZN+3//z//7//pn+z/+n//5t//2j3/9t3/+7T/9/O396x/z5+29/fWPv/3Lz9/+/j/+9e//5Z9//6//+b//2z9/r/jb//qXn//tG+Ovf7Sfud+9abT3vfXd/jPOucebrXb2f3i38e/u1jp3efszXu5y5mz3r3+Mnzl6rz+t+tPZl8a5/a3fvj977v389Y/3+Wn9PPW39/25a45ZrfYz7jubrbrn5br+s049U7Xmzz7vS2v/3HbP...
null
4,941
Grid Challenge
Given a square grid of characters in the range ascii[a-z], rearrange elements of each row alphabetically, ascending. Determine if the columns are also in ascending alphabetical order, top to bottom. Return `YES` if they are or `NO` if they are not. **Example** $grid = \text{['abc','ade','efg']}$ The grid is i...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String gridChallenge(List<String> grid)" ], "script_name": "Solution", "solution": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\ni...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class Solution {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n\tpublic void solve() throws IOException...
{ "class_name": null, "func_sign": [ "gridChallenge(grid)" ], "solution": "def solve():\n\tn = int(input())\n\ta = [sorted(list(input())) for _ in range(n)]\n\tfor i in range(n - 1):\n\t\tfor j in range(n):\n\t\t\tif a[i][j] > a[i + 1][j]:\n\t\t\t\tprint(\"NO\")\n\t\t\t\treturn\n\tprint(\"YES\")\n\nt = int(...
eJwknGuuJEcVhBFiIdYsASwZsxIkWrLy/X6/kz9euiN7hICZO7erqzLPifiiMqv+/Md/6R9//9v//v/DxDz6j//88uPXT/wd/yXXemValJ5HU4fsVfq9WdmxFSnUZso5khwpa0dCpjxNWj4in03uoEtf7lLNs9r31ClxoCKotERoX50Mn+gIpSuxcOUlZ3k1y+G5UzKyOz1W5c9cvAqWpdNKSisqK4sIMrPsl5tyArsnRakl8TiglG0WHcuKjrORPnGr0ZvaomjX8OGyzrzUnEj9LbXxcZjwa1Cz0/TBpm7szpmaRLTHl4zLCO8qZGm8...
null
21,401
Maximum Perimeter Triangle
Given an array of stick lengths, use $3$ of them to construct a [non-degenerate triangle](https://en.wikipedia.org/wiki/Degeneracy_(mathematics)#Triangle) with the maximum possible perimeter. Return an array of the lengths of its sides as $3$ integers in non-decreasing order. If there are several valid triangles havin...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> maximumPerimeterTriangle(List<Integer> sticks)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n pub...
{ "solution": "//Greedy approach\n//Constraint = sum of two sides is greater than third side\n//Perimeter maximization\nimport java.util.*;\npublic class MaxPerimeter {\n\n public static void main(String[] args) {\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nint[] a = new int[n];\nfor (int i = 0; i <...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "maximumPerimeterTriangle(sticks)" ], "solution": "from itertools import *\nn = int(input())\nl = sorted(map(int, input().split()))\nans = (-1, -1, -1)\nfor i, j, k in product(*repeat(range(n), 3)):\n if i < j < k and l[i] + l[j] > l[k]:\n ans = max(ans, (l[k],...
eJztmM+Oo0kRxDnwCtxLfV5Q5d+q4kmQaMQB5gCHZlealZDQSjwEvC+/+Ja2F297EAdua2s0lv1VVWZkZGRU//3n//zmFz+7Xr/5Mx9++7eXP719/e3nl1+Pl9ivb3vvOfe00Sdyzd5n7HP8RK8YZb69Vuew3bNjZo/qHXayz8g949SIszvW8hg5IypWsZnZ8mmrhucxqz422Dx6W420eSzP5BM7Rhyfw2bu0zXnyK7cbj3MVwZx+Ngem+eD3XxZRebUWe6l72x28+ReI9NWnFw+yok3Vo6uVXsHZzlZkeAcdbIOCfBUrs1evseylbtt...
null
16,828
Beautiful Pairs
You are given two arrays, $A$ and $B$, both containing $N$ integers. A pair of indices $(i, j)$ is *beautiful* if the $i^{th}$ element of array $A$ is equal to the $j^{th}$ element of array $B$. In other words, pair $(i, j)$ is *beautiful* if and only if $A[i] = B[j]$. A set containing beautiful pairs is called a *be...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int beautifulPairs(List<Integer> A, List<Integer> B)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public stat...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static InputReader in;\n private static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out, true);\n\n int n = in.n...
{ "class_name": null, "func_sign": [ "beautifulPairs(A, B)" ], "solution": "input()\na = [x for x in input().split()]\nb = [x for x in input().split()]\naDict = dict()\nbDict = dict()\nfor val in a:\n if val in aDict:\n aDict[val] += 1\n else:\n aDict[val] = 1\nfor val in b:\n if val ...
eJztnU2uJUlShRmwkFCNWyj8352VIJGIAdSASdKDbgkJIbEImLAZZqwL+z6L10JVnSiLHlRVErxKMvPlffd6uNvPsWPHvP/1z//9v/7jz/y/v/rP+MNf//N3//D5t7//3Xd/eX1XPn3udX36vEb86bvfXN99/0+//f7vfvf93//tP/7+dx+v+e5ffnP9j5+pnz6Xcu1+f/q8+7x2bV/9o+PT53bHj6x5tbWvM8ZVzvn0ua51jX1fva+rzPjH/fXvWeNN95nxs/2qc18j3nz2dpV1rlnjfWe856lXm/1aY15n1/i9XKdfo/OtfvXarnnf...
null
2,149
Priyanka and Toys
Priyanka works for an international toy company that ships by container. Her task is to the determine the lowest cost way to combine her orders for shipping. She has a list of item weights. The shipping company has a requirement that all items loaded in a container must weigh less than or equal to 4 units plus the ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int toys(List<Integer> w)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static Reader in;\n private static PrintWriter out;\n\n public static void main(String[] args) throws...
{ "solution": "import java.util.*;\npublic class PriyankaAndToys {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n List<Integer> arr = new ArrayList<Integer>();\n for(int i=0;i<n;i++) {\n arr.add(sc.nextInt());\n ...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\npublic class Solution {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader bfr = new ...
{ "class_name": null, "func_sign": [ "toys(w)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n N = int(sys.stdin.readline())\n W = sorted(map(int, sys.stdin.readline().split()))\n\n cost = 0\n last_chosen = -5\n\n for w in W:\n if w > last_chosen +...
eJx0vbuubVm2XCdDgH5jI+1rjPeDnyFLgAqgQZZBJ3mNugABgoA+XaO1mDslFFBOISvznL3XmnOM/ogeEf3/+d//r/+z/B//2//9P//4b3/++3/844//9PPH/tufda2fcW77WaWvn153+xmj7Z/bdv/Zdbw/8se//fzx9//x73//L//4+3/9z//9P/7x+5f/+F//9vP/+2H9b3+uWttPK33+7HL7v/yb/Z/+5vzbn7eV+9POXD+3rP7Tyyo/89TxL3/G/Kefccr7KXXc+XN2KT9rz/Zz53n/t70f2nZ7P57v1fsuP7Xt+b7r+7Bz3vUz...
null
3,583
Jim and the Orders
Jim's Burgers has a line of hungry customers. Orders vary in the time it takes to prepare them. Determine the order the customers receive their orders. Start by numbering each of the customers from $1$ to $n$, front of the line to the back. You will then be given an *order number* and a *preparation time* for each ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> jimOrders(List<List<Integer>> orders)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimp...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelpe...
{ "class_name": null, "func_sign": [ "jimOrders(orders)" ], "solution": "tuples = []\na = int(input())\nfor i in range(a):\n x, y = map(int, input().split(' '))\n tuples.append((x+y, i+1))\n\ntuples.sort(key = lambda x:x[0])\nprint(' '.join([str(x[1]) for x in tuples]))\n", "template": "#\n# Complet...
eJzsvcuqds22paXghbyscgpjxGFEhFciuMCC7oKV5S5kQoIIXrrteXp8G/l1JQiKFhIx1/7+Oef7jhGHfmyt9f/tv/pv//W//i//i//uf/nb//SPf/0P//5v/83vb+vv/1jfbmv93uf7xt//sb/neb/f/mY7Lf8c7x7719/+jvzuPt+38s/99Wf//R9nrSc/bU9/vvP3f7Td++q/efp8+t//MeYa7/m935kjH/W3f/f727/8x3/9l//h3//L//jf/8//4d//eYLf+/t++avf+LW//a//7vd/eLrv7/94ez58/M77ff3wmf1869dWXytf...
null
833
Permuting Two Arrays
There are two $n$-element arrays of integers, $A$ and $B$. Permute them into some $A'$ and $B'$ such that the relation $A'[i] + B'[i] \ge k$ holds for all $i$ where $0 \le i \lt n$. There will be $q$ queries consisting of $A$, $B$, and $k$. For each query, return `YES` if some permutation $A'$, $B'$ satisfying the re...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String twoArrays(int k, List<Integer> A, List<Integer> B)" ], "script_name": "Solution", "solution": "/* HackerRank Template */\n\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.fill;\nimport...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\npublic class Solution {\n\t\n//\tInput Format\n//\tThe first line contains an integer, T, the number of test-cases. T test cases follow. \n//\tEach test case has the following format:\n//\n//\tThe first line ...
{ "class_name": null, "func_sign": [ "twoArrays(k, A, B)" ], "solution": "def isGood(listA, listB, k):\n n = len(listA)\n listA.sort()\n listB.sort(reverse=True)\n for i in range(n):\n if listA[i]+listB[i] < k:\n return False\n return True\n\nT = int(input().strip())\nfor i ...
eJyE3b3OLc2SHGYZ1H0sHJtGV3V3dTd9XoEcCfoAGdIYdD6NMQMIIATwknkJjCdqDw3K0BzMnD17v+9a/VOVlRkZEflf/t3/+u/+6//8P/3v//kf/+nvf/7Xf/nHf/j94/7r7/f+re+8nmO9X/6/75vfuZ75u8d85/2s8zfedazzuO7fvd5zfNd6f9d7nN/1O793nc8z5+86zvM+n/v4rTGeeYzn+s3rG+Ne3/HLp5/rHdfvGsc3ru/In/KJ5/mN7zeO6/3W9X2/a93XO8f9G/O5zlzH+L3zfPPzZz5tPuM+89e+a87b341jrfzku37X...
null
24,761
Cloudy Day
Quibdó in Colombia is one among the cities that receive maximum rainfall in the world. ____________________________________________________________________________________ All year round, the city is covered in clouds. The city has many towns, located on a one-dimensional line. The positions and populations of each to...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static long maximumPeople(List<Long> p, List<Long> x, List<Long> y, List<Long> r)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solutio...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'maximumPeople' function below.\n *\n * The function is expected to return a LONG_INTEGER.\n * The function accepts following parameters:\n * 1. LONG_INTEGER_ARRAY p\n * 2. LONG_INTEGER_ARRAY x\n * 3. LONG_INT...
{ "solution": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Iterator;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\...
{ "class_name": null, "func_sign": [ "maximumPeople(p, x, y, r)" ], "solution": "from collections import defaultdict\n\n\ndef maximumPeople(towns, cloud_start, cloud_end):\n towns = sorted(towns)\n cloud_start = sorted(cloud_start)\n cloud_end = sorted(cloud_end)\n\n cloud_start_i = 0\n cloud...
eJzsvcuubVuSZYUEHzLl5SyM94MvQeIiChAFKpcsZEpICIlP4hPprY11IZUhlzyBFBWPCHkcP2fvteYcD3t069btf/+v/pv/7v/4L/+L//Z//dv/9Oe//ff/7m//9fe3tuYff557ZxnjnG+32epZ+dPpbY46Rv/uXH2Xevu3z2r5x7W+NWvZe6/+rTZKu3N/tdZbRp/ty2fc0Vq937qt7zXm+vrYY7d77nfHqSOfsr9R7u2nzPrVVWfLp5xv9DJvfit/mqXlj/myfE1+e47yjdZX6eWer68929j5uX7HWCc/+rWT35tln2+2Pms/o311...
null
22,923
Flipping the Matrix
Sean invented a game involving a $2n \times 2n$ matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the $n \times n$ submatrix located in the upper-left quadrant of the matrix. Given the...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int flippingMatrix(List<List<Integer>> matrix)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static voi...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n while(t--!=0){\n int n=sc.n...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "flippingMatrix(matrix)" ], "solution": "q = int(input())\nwhile q > 0:\n q -= 1\n \n n = int(input())\n A = []\n for i in range(2 * n):\n A += [list(map(int, input().split()))]\n \n ans = 0\n for i in range(n):\n for j in range(n):\...
eJx0/c2qtcuypAcKSn3dwuS0s/HGf4SuRFAb1ChlQ50tNTJBIArq0hXPYzFWligKzl5nre+bc4z3J8LD3dzM/P/z3/9P/+v/43/47/6f/+d//K///t//63/5j//x7z/6v/5d7v+Nvf9G2//6dz2t/Y2y/vXvc/94z/1XSll/319bpf2VtftfLX381T3WX9lf+auj9r8z/kob82/2+9uj/bXd9v3B0/7q19df++7f9ernr/lXxl87X79/vM79/XZ/ed1vqLX8nXX/bvZ+/2S1v30/qvRS/tq4f//dixnj/trmG9u5f3I/cN5/4SPun46/...
null
28,615
Gaming Array
Andy wants to play a game with his little brother, Bob. The game starts with an array of distinct integers and the rules are as follows: - Bob always plays first. - In a single move, a player chooses the maximum element in the array. He removes it and all elements to its right. For example, if the starting array ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String gamingArray(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\n\npublic class B\n{\n String line;\n StringTokenizer inputParser;\n BufferedReader is...
{ "solution": "import java.util.*;\npublic class GamingArray {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int g = sc.nextInt();\n for(int tst=0;tst<g;tst++) {\n int n = sc.nextInt();\n int count = 0;\n int max = 0;\n ...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "gamingArray(arr)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\ng = int(input().strip())\nfor a0 in range(g):\n n = int(input().strip())\n a = list(map(int, input().split()))\n \n idx_sorted = [x for x,y in sorted(enumerate(a), key = lambda x: -x[1])]\n ...
eJx8nbHOLTuQlQlIeIutGxO0y3a7ezIQMaSguRIBTEBymWBGQkJIPB6PRX/f6vYgJEj2+c/e3W67XC67q1at+p///N//7f/6F//sb//7H//lr7//x3/4429+f7T686/Zn49a/ey/Wkfnc9T9fLZ2PZ99Lr45yl/n81nt5HM0Pou/x8mV7eKaVn6/Bp/z+fW8F6317jf5dfD3Mfm7Hzyxt9uWD1o4vf6wD8tetfJef23c24Z/D59404fDb45z2oI9pw/nfdmaT+zT1ibfDJ8+jlxjm46u3Yz3uLo9p+V+2+cz/Vca3af3yyfy92je1abS...
null
15,305
New Year Chaos
It is New Year's Day and people are in line for the Wonderland rollercoaster ride. Each person wears a sticker indicating their *initial* position in the queue from $1$ to $n$. Any person can bribe the person *directly in front* of them to swap positions, but they still wear their original sticker. One person can bribe...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static void minimumBribes(List<Integer> q)" ], "script_name": "Solution", "solution": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*; \nimport java....
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\n\npublic class HourRank4qB {\n\n\tstatic int pos[], arr[];\n\t\n\tpublic static void main(String args[]) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\n\t\tint t = in.nextInt();\n\t\t\n\t\twhile(t-- > 0 ...
{ "class_name": null, "func_sign": [ "minimumBribes(q)" ], "solution": "\ndef count_inversion(lst):\n return merge_count_inversion(lst)[1]\n\ndef merge_count_inversion(lst):\n if len(lst) <= 1:\n return lst, 0\n middle = int( len(lst) / 2 )\n left, a = merge_count_inversion(lst[:middle])\...
eJzVnc2uJMmRnbXQgyS4Hgjh/x56Di0EiIIgjAaQNpxZcAABgoDZ6QWkB9Ebyr7PPKuyb99bdau6SUKDaZJdFZkZEe5uduzYOe7/8q//z//6v//K//v3/xL/4z/8jz/8tz/90z//+Q//9vGH+sc/xf+XR/xHj/9/1Ed5tD/+6Q9/9/jDP/z3f/qHv//zP/yX//SP//znc/X1xz/9u3/8x8ff/9f//I9//m9/H5f9z797/PLLSvfbHu3RH+MxH+txP/ajXI9SHiW+vD284npeNeI6rtpxHX/6wQ+XuP7dn9uvP7fiq/KLXn/uUcajzEdZ...
null
15,577
Prime XOR
Penny has an array of $n$ integers, $[ a_0, a_1, \ldots, a_{n-1} ]$. She wants to find the number of unique [multisets](https://en.wikipedia.org/wiki/Multiset) she can form using elements from the array such that the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all the elements of the multiset ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int primeXor(List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\npublic class c {\npublic static void main(String[] args) throws IOException {\n\tinput.init(System.in);\n\tPrintWriter out = new PrintWr...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import javafx.beans.property.IntegerProperty;\n\nimport java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n static Scanner in;\n static PrintWriter out;\n\n static int N = 4501;\n static int M = 8192;\n static ...
{ "class_name": null, "func_sign": [ "primeXor(a)" ], "solution": "from collections import Counter\nfrom math import sqrt\n\n\ndef primes(n):\n x = [True]*((n-1)//2) # Representing all odd numbers >= 3 and <= n.\n for i in range(int((sqrt(n)-3)//2)+1):\n if x[i]: # Number represented by i (c...
eJxMvTuy7UqyXEuBDQFvC5BAZiLBPlCnGasDVMoo8ElPYavYPs4cwwPrCFW2z95rzQnkJz4eHh7/5z//9//73/7Lf/of//9//M9//6//73//x389/mP869/rvv/1796efvTWx9HP8R69P7//u/v6/d85jvsd7bif/uwf+f1pXs9xr/b7z/P3p35d8/evz+8fxtv3z63fj7zt98Pr97ujn78/3b/feNrvH97r/f3uun7/cM7fBzz37++e8/d/a//Dtf9z//Dbf/857t9T9fn71+fdf/d7tN+X7/87f383rrG/6Nqf8vuO6/l9/Br7e688...
null
15,974
HackerRank City
HackerRank-city is an acyclic connected graph (or [tree](https://en.wikipedia.org/wiki/Tree_(graph_theory))). Its not an ordinary place, the construction of the whole tree takes place in $N$ steps. The process is described below: * It initially has $1$ node. * At each step, you must create $3$ duplicates of the curren...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int hackerrankCity(List<Integer> A)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.In...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n /*\n * Complete the hackerrankCity function below.\n */\n static int hackerrankCity(int[] A) {\n int n = A.length;\n long[] cluster_size...
{ "solution": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOExcep...
{ "class_name": null, "func_sign": [ "hackerrankCity(A)" ], "solution": "import sys\n\ninp = sys.stdin\nn = int(inp.readline().strip())\nlengths = list(map(int, inp.readline().strip().split(' ')))\n\nf = 0\ng = 0\nh = 0\nm = 1\nfor a in lengths:\n f = (4*g*(3*m+2) + 4*f + 16*a*m*m + 12*a*m + a) % 1000000...
eJzs3bvOLUmWJGYK8yALKbeQcY/oJyHAAkaYKaGVnBKqgQEaA8xTU+Y529fnFqeLORLBJoiNQt7i/P/eER7u62LLzOp//qf//bf/8z/9b//Hv/32L3/87V///ts/12/778t6/OWPp85aav/x1/Xjf/ePfx4//rnUWs+P/62f/zo+/37++Ofy4+/7j3/un//ef/z89rl+/Pi3+/On54+f3/oz9h+/f33+/vy4dn1+8ufvHJ/v+/kd6+d7x3esnyvX5xOuzyf+/Gv/3MP54/d/ft75+Zanf/P+fMr1+bTn8/ef3zR+c3zmeJr78/et7+j4...
null
11,859
Summing Pieces
Consider an array, $A$, of length $n$. We can split $A$ into contiguous segments called *pieces* and store them as another array, $B$. For example, if $A = [1, 2, 3]$, we have the following arrays of pieces: - $B = [(1), (2), (3)]$ contains three $1$-element pieces. - $B = [(1, 2), (3)]$ contains two pieces, one havin...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int summingPieces(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n public static final long MOD ...
{ "solution": "\nimport java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n \n int n = in.nextInt();\n long sum = 0;\n ...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t// 6+9+11+18\n\tfinal ...
{ "class_name": null, "func_sign": [ "summingPieces(arr)" ], "solution": "def coeff(n):\n a = pow(2, n, 1000000007)\n res = [a - 1]\n for i in range((n - 1) // 2):\n a = a * 250000002 % 1000000007\n res.append((res[-1] + (a - 1) * pow(2, i, 1000000007)) % 1000000007)\n if n & 1:\n ...
eJxM3TuubV1znOky5FcXFn6bxrxf1AS1QEARKKNEoxyWDAoQIAhQj9UF5fPOLaD4geDhOXuvNS9j5MiMjIj8H//uP/7P//B//h//13/7x//7r//5v/zbP/797x/n+8//ul7bse77u/7O9dm25T6233Pt+3Idx++61v14lvP8Xe+zrNv1u+b/LNe+vL9ne69rO9/zdx7vex33u/3ubV3u/bre3/rM72/3Mf94rsf67Mf8wvz4fa/Pz///vvf7/u5zeZ9ze57fc9zX/OD2/vb3nL/e1ut3vOf+HMd5/659vmx9t+M313tt731cv/t41/d4...
null
61
Lego Blocks
You have an infinite number of 4 types of lego blocks of sizes given as (depth x height x width): ``` d h w 1 1 1 1 1 2 1 1 3 1 1 4 ``` Using these blocks, you want to make a wall of height $n$ and width $m$. Features of the wall are: <br> - The wall should not have any holes in it. - The wall you build should b...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int legoBlocks(int n, int m)" ], "script_name": "Solution", "solution": "import java.util.*;\n\npublic class Solution {\n\tint md=1000000007;\n\tint[][] ways = new int[1001][1001];\n\tint[][] waysRestrict = new int[1001][1001];\n\tpublic Solution(){\...
{ "solution": "import java.util.Scanner;\n\nclass Solution{\n static final int mod=1000000007;\n static int[] f;\n static int mult(int x, int y){\n long z=x;\n z*=y;\n return (int) (z%mod);\n }\n static int pow(int x, int n){\n int r=1;\n while(n!=1){\n if((n&1)==1) r=mult(r,x);\n...
{ "solution": "import java.util.Scanner;\n\npublic class LegoBlocks {\n\n\tprivate static long[] f = new long[1001];\n\tprivate static long[] g = new long[1001];\n\tprivate static long[] h = new long[1001];\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner in = new Scanner(System.in);\n\t\tint T = in.nextI...
{ "class_name": null, "func_sign": [ "legoBlocks(n, m)" ], "solution": "MAX = 1000000007\n\ndef calcLevels(levels):\n\tN = len(levels)\n\tM = len(levels[1])\n\n\tlevels[1][0] = 1\n\tp = 1\n\twhile p<M:\n\t\ti = 1\n\t\twhile i<=4 and p-i>=0:\n\t\t\tlevels[1][p] = (levels[1][p] + levels[1][p-i]) % MAX\n\t\t\t...
eJydl02OJUkRhFlwAI4QqvUIRYT/RXASJAqxgF6woJhFjzQSGolDwH35zKuA4dGvEVMtVWW/l+nhbm5ubvnXn//98y9+1j+//hMXv/nLyx/fvv3u88uvxst9fTsxMrf+nuF3vr7dmmPVeX0L32O9vtlZ497SRYw4/vq27YzkBrt7+OKWNdfweH17+Wa8fPr+20+///zpD7/783efP05x33bNZ+rOs+ec9vpW5cE1YQhQdmZFKA8+t7m3c+nn1IlVnL19znXXUZ5zxT728sM340eV6MmTY6+PRNfcT/Ph1BXkXDrtzJk2H6LxTayRm/P2...
null
85
Brick Tiling
You are given a grid having N rows and M columns. A grid square can either be blocked or empty. Blocked squares are represented by a '#' and empty squares are represented by '.'. Find the number of ways to tile the grid using L shaped bricks. A L brick has one side of length three units while other of length 2 units. A...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int brickTiling(List<String> grid)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Inp...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n private static final int MOD = 1000000007;\n private static final int[][] pieceMasks = new int[][] { {0,7,1,4}, {-2,2,-1,2,0,3}, \n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int T = in.nextInt();\n for (int t = 0; t < T; t++) {\n int N = in.nextInt();\n int M = in.nextInt();\n ...
{ "class_name": null, "func_sign": [ "brickTiling(grid)" ], "solution": "def memoize(func):\n pool = {}\n def wrapper(*arg):\n if arg not in pool:\n pool[arg] = func(*arg)\n return pool[arg]\n return wrapper\n\nmod = 1000000007\nshapes = (\\\n ((1,0),(2,0),(2,1)),\\\n ...
eJzNV0uO1DAQZcEFuEGU2o5KceJ8miU7boDEIBYwCzbNLHokJITEIeC+xK6PK3GcyQwgdcvtOP5UlV/VKzs/X/5+++pF/L17Mzfef6+/nO8fLvXrqva356lqb8+I+383VW5uxQLSsAVMYzXBnXitDsHWwlwgDbk+qT5Y6puqvvt2f/fpcvf549eHS9psQ6X+cVMtURiqIewUAYNiAKSd83t4hvfQD7Ef16g8tcxruyCJ1IUKbRXls1Kp6JUNkj5YCQCe0pF4tFUBl2YHFzLTahH1pCppJoMhn6yVMVgFuKby0WLaOFma6rwnq301RsXI...
null
330
Stock Maximize
Your algorithms have become so good at predicting the market that you now know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for the next number of days. Each day, you can either buy one share of WOT, sell any number of shares of WOT that you own, or not make any transaction at all. What is the m...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static long stockmax(List<Integer> prices)" ], "script_name": "Solution", "solution": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\nimport java.io.InputStreamReader;\npublic class Solution {\n public s...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nclass Solution {\n\tprivate static long[] getElements(String elements, int size) {\n\n\tString[] elementsArray = elements.trim().split(\" \");\n\n\t\tif (elementsArray.length != size)\n\t\t\tthrow new IllegalArgumentException(\"Number of elements in the list does...
{ "class_name": null, "func_sign": [ "stockmax(prices)" ], "solution": "test=int(input())\nfor i in range(test):\n n=int(input())\n a=list(map(int,input().split()))\n c=0\n i=len(a)-1\n while(i>=0):\n d=a[i]\n l=i\n p=0\n while(a[i]<=d and i>=0):\n p+=a[...
eJzsvc3KNMuWpCeErkKjYI9rkMtXeHhmX4lAG3pQdQY12XUGp6CgadDN6D5lj3mmo4kQAglajcGON23HF54/YfH7hLut/+1/+l/+x//9f/4f/tf/8se//vX3f//HH//p+mP8+dfb0/Wu6/261uda72utaz3Xmte6r9XXGteqa72u53M97+tZ1/Ncz7ye+3r6esb11PW8rvm55vua65rPNec172v2Ncc165qv6/5c9/u613U/1z2v+77uvu5x3XXdr6s/V7+vXlc/V8+r76v76nF1Xf26xuca72usazzXmNe4r9HXGNeoa7yu+lz1vmpd...
null
9,200
Two Robots
You have a warehouse with $M$ containers filled with an infinite number of candies. The containers are arranged in a single row, equally spaced to be $1$ meter apart. You also have $2$ robots that can pick up $1$ piece of candy and transport it between any two containers. The robots take instructions in the form of *q...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int twoRobots(int m, List<List<Integer>> queries)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.Arrays;\n\npublic class HR_two_robots {\n\n public static void solve(Input in, PrintWriter out) throws IOException {\...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class WeekOfCode19qB {\n\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\n\t\tint t = in.nextInt();\n\n\t\twhile(t-- > 0){\n\t\t\tint m = in.nextInt();\n\t\...
{ "class_name": null, "func_sign": [ "twoRobots(m, queries)" ], "solution": "from collections import defaultdict\n\ndef dist(x, y):\n return abs(x - y)\n\ndef solve(boxes):\n boxes.reverse()\n c = [0] * len(boxes)\n c[0] = dist(boxes[0][0], boxes[0][1])\n for bi in range(1, len(boxes)):\n ...
eJzsvU2uLE2zpQUSA0nddjXC/z0YCRJHogHVoHOpRpWEhJAYDDNhYth6lrnnqXvv10SiIDvxvvvk3pER7m5/y5aZ/R//zX/3f/5f//V/9d//b//0P//zf/hP//Gf/tvPP9U//9xa/5Q//1zm8+nPn3+e/f2U3v/8c53tM/aKT+r+1B0flWd8Sol/aW/9tBJ/NPb8lB2/PJ/26fqruHxmmfE7a33GE7/TZv30GX8Vf/xM3aXGB/HF9Vmfvt8//7zbZ/aqr45/aFv33/EM8RtNX6hv3vvThv4nPokvjY/id0dreswafx1/NMb8NL5nx20e...
null
514
Cut Tree
Given a tree *T* with *n* nodes, how many subtrees (*T'*) of *T* have at most *K* edges connected to (T - T')?
hackerrank
Medium
{ "class_name": null, "func_sign": [ "static int cuttree(int n, int k, int[][] edges)" ], "script_name": "Solution", "solution": "import java.io.BufferedInputStream;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\n\npublic class Solution {\n\tstatic long rooted[][] = new long [55][55];\n\tstati...
null
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n \n private static List<List<Integer>> children = new ArrayList<>(51);\n private static long[][] findCache = new long[51][51];\n private static long[][][][] ignoreCache = new long[51][51][51][51];\n\n static {\n fo...
{ "class_name": null, "func_sign": [ "cuttree(n, k, edges)" ], "solution": "line = input().split()\nn = int(line[0])\nK = int(line[1])\n\nadjlst = [[1]]\nfor i in range(n):\n adjlst.append([])\nadjlst[1].append(0)\n\nfor i in range(n - 1):\n line = input().split()\n x = int(line[0])\n y = int(li...
eJztWMtuJEUQ5MAf8AOlOa9Q5aNefAkSRhzABy7DHtYSEqzER8D/UhnRbte0py0tEkJI60P3PFzVmRGRkVnzx5d//f7VF/j79mm++O63y8/X908fLt+ki4wkD1dJGhd7uFryeFXiUuNti1f94appPFw9SX649iQSXwkWyVw1N3F8Mte1JHOhaJIWq2SurUnm4su7dHn89f3jjx8ef/rhl6cPWwTWLx/fpSWkkhmDxnKLi8dlbl0ipBIhtQhJIiRFSIqQFCENhCSCmBQxKWIqCCm+iMUZQUlJOtdLSxob5KSKf1FDDuqxn5ZIWmsAoA2f...
null
29,079
Tara's Beautiful Permutations
Tara has an array, $A$, consisting of $n$ integers where each integer occurs *at most* $2$ times in the array. Let's define $P$ to be a permutation of $A$ where $p_i$ is the $i^{th}$ element of permutation $P$. Tara thinks a permutation is *beautiful* if there is no index $i$ such that $p_i - p_{i+1} = 0$ where $i \i...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int beautifulPermutations(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void ...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n /*\n * Complete the beautifulPermutations function below.\n */\n static int beautifulPermutations(int[] arr) {\n /*\n * Write your code...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "beautifulPermutations(arr)" ], "solution": "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport sys\n\nmodval=1000000007\ninvmod=[1,500000004,250000002,125000001,562500004]\n\n\nclass Combination:\n\n\n def __init__(self,size):\n comb...
eJyUvcuuLMuybQUSHzJ1yhTC/B18BiUkjkQBboHK5hbulZAQEl/EN5Lu1lqsiH32KnAeM9fIkenhD+v26N0ixv/z3/1P/+P/+9/+N//z//Vv//s//vN//S//9j/8+bf493/Mf/9H+1P+1D9x/r/8+z/+7b//82//6f/8z//pf/0v/+l/+1/+j//6X/hsaePf/u///s/323H9+z/qn/773/Kn/f43zjB/P0i927r+4zDj3/9RmMTv+3//7X/x1bvvWbTxJ674fftq/ffP9ZvJVe793v6vWPu9+cfPVT9S4/nt/kXZ/1X25+q1fzH9SN1D...
null
5,553
Wet Shark and Two Subsequences
One day, Wet Shark was given an array $X = \{x_1, x_2, \ldots, x_m\}$. As always, he started playing with its [subsequences](http://en.wikipedia.org/wiki/Subsequence). <br> When you came to know about this habit, you presented him a task of finding all pairs of subsequences, $(A, B)$, which satisfies all of the follo...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int twoSubsequences(List<Integer> x, int r, int s)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimpo...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport ja...
{ "class_name": null, "func_sign": [ "twoSubsequences(x, r, s)" ], "solution": "def solve():\n mod = 10**9+7\n m,r,s = map(int,input().rstrip().split(' '))\n if m == 0 or r<=s: return 0\n arr = list(map(int,input().rstrip().split(' ')))\n if (r-s) % 2 != 0: return 0\n sumb = (r-s)//2\n ...
eJzllzGvZLcNhVOkD+AitfBqIxBFiZTySwLkGSmcLdK8uFgDBgwD/hHx/835qNmFkcUas0WaZBcz7869EkUeHh7y/vz7X/741e/q31/+oIu//vjyj7fvvn//8uf2Yr233uyc8/pm7X/h/+i9v3zdXt798N27b9+/+/vf/vn9+0ew/fXt5aev26/Cz9kitz7x+rY8mvWVbQ9dzBUt9dhsCB8LF0jztHF0xlpaOHQnbDfzKACz2eBrrqEVOdqaejgWD/dqc3tLw9SR0eDLU8t7LBacZqlVMq1NU4fMqRXZ5ckZMjh3Njcs+2y1cbn2DNee...
null
16,423
Nikita and the Game
Nikita just came up with a new array game. The rules are as follows: * Initially, Nikita has an array of integers. * In each move, Nikita must partition the array into $2$ non-empty contiguous parts such that the sum of the elements in the left partition is equal to the sum of the elements in the right partition. If ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int arraySplitting(List<Integer> arr)" ], "script_name": "Solution", "solution": "\nimport java.util.*;\nimport java.io.*;\n\npublic class B\n{\n public static void main(String[] args) throws Exception\n {\n FastScanner in = new FastScanner(...
{ "solution": "import java.util.*;\nimport java.io.*;\n\npublic class B\n{\n public static void main(String[] args) throws Exception\n {\n FastScanner in = new FastScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int T = in.nextInt();\n while (T-->0) new B(in, out);\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class AprilFools16QB {\n\n\tstatic int b[];\n\tstatic long pre[];\n\t\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\n\t\tint t = in.nextInt();\n\t\t\n\t\t...
{ "class_name": null, "func_sign": [ "arraySplitting(arr)" ], "solution": "import math\n\ndef solve(a):\n s = sum(a)\n if s % 2:\n return 0\n s //= 2\n t = 0\n for i in range(len(a)):\n t += a[i]\n if t == s:\n #print(sum(a[:i + 1]), sum(a[i + 1:]))\n ...
eJzsncuuZUlyXAVBHxLogUYcxPuhLxHAAjSQONAkxQEJCBAE6NNly9x3VnWLTYIzAUxWo1mdee85e0f4w9zcPOL//If//B//9t//u7/9X3/67z/+/h//4U//qfxp/PZjrvvbj1HP3quVtt8eo+1T1h711v1uWU1/9dZr5Y1aZxtzldFWHb2uU3qf+rFzV7m1tbvP6GXMfnofdZc72tuvzVZ2H2Oc20a5p98xt37jrfPGfVu/O++eR79cun7w6kdf0ffvcfRkZVw9wu6nlrlnnfrz5U+pa+pT2njjtdW6nv702vQxpa97+9Hjzaqfm2vq...
null
20,053
LCS Returns
Given two strings, $a$ and $b$, find and print the total number of ways to insert a character at any position in string $a$ such that the length of the [Longest Common Subsequence](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem?oldformat=true) of characters in the two strings increases by one.
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int tutzkiAndLcs(String a, String b)" ], "script_name": "Solution", "solution": "import java.awt.image.ReplicateScaleFilter;\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\nimport javax.swing.RepaintManager;\n\npublic class Main {\n\n...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class LCSReturns {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid solve() throws IOException {\n\t\tString a = nextToken();\n\t\tString b = nextToken();\n\n\t\tint n = a.length();\n\t\tint m = b.length();\n\n...
{ "class_name": null, "func_sign": [ "tutzkiAndLcs(a, b)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n#\n# Complete the 'tutzkiAndLcs' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts following parameters:\n# ...
eJztfdfS3MiSni70IBvnekMBb3QH0w3b8F5UKOC991AoQg8hvZyeRk1yzhzOkD/dzOxunOiPCWRWVmYhy6CqwO7G/7//8/9d/t9/+gCvfQr/7X/+reyGdfnbf/2XvwUdhWaGbdzlKiGcZtDZvKnWGNuY613HR/PUHq5vTVg5KmRQChKX30RDZ7IEhiV1tt3cMCMAlX3qwUNS7php5uEUjvsdp+Q2YYoy5dL7vZ6gw7GXxwZniVdEtIPcUTERJsq9oPGcSVlcIpIZCocK/vav//K39BjSeEmT/9Gvyy9xwjj6rvvb//rXf/kkdoRd45yL...
null
33,054
Matrix Land
You are playing a matrix-based game with the following setup and rules: - You are given a matrix $A$ with $n$ rows and $m$ columns. Each cell contains some points. When a player passes a cell their score increases by the number written in that cell and the number in the cell becomes $0$. (If the cell number is posi...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int matrixLand(List<List<Integer>> A)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(St...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.util.function.Consumer;\n\npublic class Solution {\n\n\n static MyScanner sc;\n private static PrintWriter out;\n static long M2 = 1_000_000_000L + 7;\n\n public static void main(String[] s) throws Exception {\n StringBuilder string...
{ "class_name": null, "func_sign": [ "matrixLand(A)" ], "solution": "import os, sys\n\nwith open('progIn.txt', 'w') as file:\n for line in sys.stdin:\n file.write(line)\n\nprog = r\"\"\"\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <set>\n#include <util...
eJztvUuO7EiWJVho1EIIH4cVKH+RXEkB5YUcZMYgJ54xiAASSCTQi6h99hZKzufSXmgwuiwaHu1qCcLxTJ1CKlUoIvfccz9y+X//1//+//yv/+u//I9//+lffvnDn/740z8cP/Vj/fzLR67l2H8q/jT86fgzrv9r19nCq+8unHdf4dV3F667r/DqmwvbefeV/w/3/hv6/dPvjp9+/29/+P0//fH3//yP//qnP3q89on/+N3xwwCmY3ck5XHM8/izj6/fou6v8Gly3j+eMRUZPc3oS0avMvqX0dOMhytn/J/axnVdu77LifrqvUr6wl15...
null
1,617
Bricks Game
You and your friend decide to play a game using a stack consisting of N bricks. In this game, you can alternatively remove 1, 2 or 3 bricks from the top, and the numbers etched on the removed bricks are added to your score. You have to play so that you obtain the maximum possible score. It is given that your friend wil...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int bricksGame(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Inpu...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.*;\nimport java.io.*;\nclass Solution {\n public static void main(String[] args) throws Exception {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n int T = Integer.parseInt(reader.readLine());\n for(int i = 0; i < T; i++) {\n ...
{ "class_name": null, "func_sign": [ "bricksGame(arr)" ], "solution": "INF = 10**18\n\ndef one_test():\n\tn = int(input())\n\ta = list(reversed(list(map(int, input().split()))))\n\tdp = [0] * (n + 1)\n\tfor i in range(n):\n\t\ttake = 0\n\t\tdp[i + 1] = -INF\n\t\tfor j in range(i, max(i - 3, -1), -1):\n\t\t\...
eJzsvb2urE2SnSdDru6h0PYY+f+jKxGgD6AhjUHnI40hQIAgoNvRXep51ntakCDSl5GdM3361N5VlW9mZMSKFSvy/B//4//y7/7P/+l/+F//yz/+/d//8T/92z/+598/6l9/t/LX3+VXf+3Xf+M3f+u3f+d3f5UX66+2X+2/On51/ur61f2r51fvX3//419+//jX//wf//V/+7d//d//3X/4T//25wPv4kf/9V9+/4/vGH/9XWfl9XNW7/W319pn/vpes/5uqbOXX9tz9vZrqza+ZZ0z+Jpzz+2/eeoe/Kjs085v3tEKb65rMcHW1zz7...
null
1,431
The Longest Increasing Subsequence
**An Introduction to the Longest Increasing Subsequence Problem** The task is to find the length of the longest subsequence in a given array of integers such that all elements of the subsequence are sorted in strictly ascending order. This is called the Longest Increasing Subsequence (LIS) problem. For example, the...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int longestIncreasingSubsequence(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n \n static i...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Arrays;\nimport java.util.Scanner;\npublic class Solution {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint[] Array=new int[n];\n\t\tfor(int i=0;i<Array.length;i++){\n\t\t\tArray[i]=in.nextInt();\n\t\t}\n\t\tint le...
{ "class_name": null, "func_sign": [ "longestIncreasingSubsequence(arr)" ], "solution": "def subsequence(seq):\n if not seq:\n return seq\n\n M = [None] * len(seq) # offset by 1 (j -> j-1)\n P = [None] * len(seq)\n\n # Since we have at least one element in our list, we can start by \n ...
eJx8ncmubsl1nG3Afg+ixhpk5spWr+GJAV/AA1sDTcoakIAAwYAf3RFf7FMULNECeENk1V73NPHvbL7V/J//9F//y3/8z//hv/3Lb//4+z/95c+//f2ffluttV+/D/2n3q/f1/31+zm/fn/71++9L/1RU3+s0h9n6I/X9S93PzH0r4+pf39sPTCunqimJ2roiZp6oraeqKsnpv+O2fXELD0xl56YR0/MpydW1xOr9MRaemIdPbGenthNT+yhJ/bUE3vriX31xGl64gw9caaeOFtPnKsnztMTt+uJW3riLj1xj564T0+8ride6Ym39MQ7...
1
3,514
Play with words
Shaka and his brother have created a boring game which is played like this: They take a word composed of lowercase English letters and try to get the maximum possible score by building exactly 2 **palindromic subsequences**. The score obtained is the product of the length of these 2 [subsequences](https://en.wikiped...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int playWithWords(String s)" ], "script_name": "Solution", "solution": "/**\n * Created by zhengf1 on 12/18/2014.\n */\nimport java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\npublic class Dec101_C...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class PlayWithWords {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid solve() throws IOException {\n\t\tchar[] s = nextToken().toCharArray();\n\t\tint n = s.length;\n\t\tint[][] dp = new int[n + 1][n + 1];\n\t...
{ "class_name": null, "func_sign": [ "playWithWords(s)" ], "solution": "def findMaxSubsequence(seq):\n length = len(seq)\n seqLength = [[0 for i in range(length)] for j in range(length)]\n for i in range(length):\n seqLength[i][i] = 1 \n for cols in range(2,length+1):\n for i in ra...
eJztnduqbUlynvvC+Dmauhamq6WWuvQkBtuYPEeez0cj8EPYz2v/s/GFqdYWajC4ETPHZFBr7bnmyIyM+P8vVlXl/u//7n/++/CbP43/+L/8b37zn/7bTzaVOX76x9/+xJ5mS3DLJP3n9NPf/PYndYoSQ8n/muf4P+/525/+6W9++3/9jGZVxfkC15fnmnP94U/+/Ptf/Whtj8sn/tWPqksI9Xx3ud7hgyVprZAm78hZkUnqSI+NmuSoVMer+8gT7e18hiT5qXvvQ2dxo388x59/+dVDKewVjMCn+baq7WuOHUU6cTtd54yJq7jUTtJZ...
null
101
Interval Selection
Given a set of $n$ intervals, find the size of its largest possible subset of intervals such that no three intervals in the subset share a common point.
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int intervalSelection(List<List<Integer>> intervals)" ], "script_name": "Solution", "solution": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Solution {\n\tstatic class Foo53 {\n\t\tvoid main() {\n\t\t\tBuff...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.util.Arrays;\nimport java.util.Scanner;\n\nclass IntervalsPicker {\n\tprivate class Interval implements Comparable<Interval> {\n\t\tint start, end;\n\n\t\tpublic Interval(int start, int end) {\n\t\t\tthis.start = start;\n\t\t\tthis.end = end;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareT...
{ "class_name": null, "func_sign": [ "intervalSelection(intervals)" ], "solution": "import sys\n\ndef readnums():\n return [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n\nfor i in range(readnums()[0]):\n intervals = []\n for j in range(readnums()[0]):\n intervals.append(readnu...
eJx0vc2q9UyTpmewD0TUuAfK/0wficEFHtg18KTcg2owGIPBB+BTdlxXaEmb+qo+6H6j9Ky9lpTKjN877vh//of/6f/7f//7/+5//r/+6X//1//63/7tn/7H65/6P//r+ud/PWWXs+7SL6V9Snsujr5PXjzj/C6u0sdzsbXxu1jP+8l9PxfnapuL9b7LfX7fWfNi/NCo5Xex3fX55L1qXIzbWqfGV/UyL6XSdvldbPN+LvY1fhdX3GteLOV+L/bfxXneT+79+/My2u/iLL+Lde/fxdPG74fq/j5Zr+ef93zvs63fD8334mj998lZ3+8c...
null
58
String Reduction
Given a string consisting of the letters $\text a$, $\text b$ and $\text c$, we can perform the following operation: * Take any two adjacent distinct characters and replace them with the third character. Find the shortest string obtainable through applying this operation repeatedly. For example, given the string...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int stringReduction(String s)" ], "script_name": "Solution", "solution": "/*\n * Anand Oza\n * October 29, 2011\n */\n\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.StreamTokenizer;\n\npublic class Solution {\n\tpubl...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n int min;\n\tint val;\n\tString cat;\n\tboolean flag;\n\tchar redux(char c1, char c2) {\n\t\tif (c1 == 'a') {\n\t\t\tif (c2 == 'b') return 'c';\n\t\t\tif (c2 == 'c') return 'b';\n\t\t}\n\t\tif (c1 == 'b') {\n\t\t\tif (c2 == 'a') retu...
{ "class_name": null, "func_sign": [ "stringReduction(s)" ], "solution": "#!/usr/bin/python\n\nimport collections, sys\n\n\nchar_set = 'abc'\n\nif __name__ == '__main__':\n T = int(sys.stdin.readline())\n \n for i in range(T):\n chars = sys.stdin.readline().lower().strip()\n count = c...
eJzFVs1u1DAQ5sCRh1jlXKHddCnQJ0FiEZoZ9sBl6WErIaFKPAS8GTdeBs/3jRMnsaNdCYSbto5jz+833/j785+/XzzDePcrTd5/6z6fHh7P3f2m6w8nkfSri5/DqbvZdMevD0c7Hz99/PJ4Ho/s0senm00h5/ZwMh8qomaiqibmgsXXrKJjTX5Vxc6l/Y3R1Px6u1C63x9OyX7zR90Hiyf5m1xNn9L3tCA+MfiJN3/1UOCv/zP3OWISQnJIXAP+plGECVMbAukmqMfWprH0Fxevwl2uThl6F5kWTKHCswI7BBbStsjM6JWG3LDEnUry...
null
51
Queens on Board
**Queens on Board** You have an *N* \* *M* chessboard on which some squares are blocked out. In how many ways can you place one or more queens on the board, such that, no two queens attack each other? Two queens attack each other, if one can reach the other by moving horizontally, vertically, or diagonally without pas...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int queensBoard(List<String> board)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.In...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.str...
{ "solution": " import java.util.ArrayDeque;\n import java.util.ArrayList;\n import java.util.HashMap;\n import java.util.HashSet;\n import java.util.List;\n import java.util.Map;\n import java.util.Queue;\n import java.util.Scanner;\n import java.util.Set;\n import java.util.Stack;\n ...
{ "class_name": null, "func_sign": [ "queensBoard(board)" ], "solution": "def memoize(func):\n pool = {}\n def wrapper(*arg):\n if arg not in pool:\n pool[arg] = func(*arg)\n return pool[arg]\n return wrapper\n\nmod = 1000000007\n\nfor case in range(int(input())):\n Y,X ...
eJztVktOxDAMZcEFuEGUbEdRPk0/nASJIhbQBZsyi46EhJA4BFyIHbcicVraijjTEYw0FekidtLYTuxnO6/n758XZ/BdfVjm+pk+tNtdRy8JlULUrSSybnndKqIsZXXL7EQT7SbczVjP4RvHPcAljUlj0pg0/lONdENo87Rt7rrm/vZx1w3F1qqo28ruAyYfmLTyc4W+bMi0T9lfhhjrXff9NWFH0OkJhoRcylJJFbqnFIAsJ80YIAsQx/etIaZMYUJWjHDeZAxE10P4KRxiKcHLQADdE3DHxYPhlK40RYQEjoGjZFQiPcEwUMmsFJUO...
null
3,994
Police Operation
Roy is helping the police department of his city in crime fighting. Today, they informed him about a new planned operation. Think of the city as a $2D$ plane. The road along the $X$-axis is very crime prone, because $n$ criminals live there. No two criminals live at the same position. To catch these criminals, the po...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int policeOperation(int h, List<Integer> criminals)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\t...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n\n static class Line {\n long k;\n long b; \n\n public Line(long k, long b) {\n this.k = k;\n this....
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic class Line {\n\t\tlong k;\n\t\tlong b; // y = k * x + b\n\n\t\tpublic Line(long k, long b) {\n\t\t\tthis.k = k;\n\t\t\tthis.b = b;\n\t\t}\n\n\...
{ "class_name": null, "func_sign": [ "policeOperation(h, criminals)" ], "solution": "#!/bin/python3\n\nimport os\nimport sys\n\n#\n# Complete the policeOperation function below.\n#\ndef cross(f, g):\n return (g[1]-f[1])/(f[0]-g[0])\n\ndef policeOperation(h, criminals):\n n = len(criminals)\n dp = 0...
eJx0nUvONct2VSkg2pG6ZRcy3hG0BAkkCuACFeOCLSEhJFpCQ2gdc4zYe59zffG1T/zry8ydz3isx1xz/e9/+x/+z//9d//mP/7Pv/y3f/jHf/6nv/z75y/1fd9nvJ///ad/KE8pby/nadN/dutr9Sfb3tk7O0/j317G2uepjROsp6623/M+7d3vbPl3zvOOnGWPWmp5eq99nvPkZHVkez+1zNOesVtpZT1zzTJaeVaZpe/xrLPeUeezR6k507PnO7iPfXr2z+eU3to6ua9SaykzQg5dc+QOZ8tdNISzi8LJ3+t9cqq9z1gRVp+zZlfd...
null
102
Unfair Game
  You are playing a game of Nim with a friend. The rules are are follows:   1) Initially, there are N piles of stones. Two players play alternately. 2) In each turn, a player can choose one non empty pile and remove any number of stones from it. At least one stone must be removed. 3) The player who picks the last ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int unfairGame(List<Integer> s)" ], "script_name": "Solution", "solution": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Solution {\n\tstatic class Foo57 {\n\t\tstatic final long INF = Long.MAX_VALUE/3;\n\t\...
{ "solution": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n/*\n * To change this template, choose Tools | Templates and open the template in\n * the editor.\n */\n/**\n *\n * @author muoi\n */\npublic class Solution {\n\n public static long MAX_BIT = 32;\n public static long n;\n static long a[]...
{ "solution": "//package hackerrank;\n\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\n/**\n * Created by raggzy on 4/15/2016.\n * <p>\n * Sprague-Grundy\n * We need to find such set, which gives 0 xor\n * So we just DP from each bit pos till end\n */\npublic class UnfairGame {\n\n public static ...
{ "class_name": null, "func_sign": [ "unfairGame(s)" ], "solution": "#!/bin/python3\n\nimport os\nimport sys\n\n#\n# Complete the unfairGame function below.\n#\ndef unfairGame(s):\n nimSum = 0\n for i in s:\n nimSum ^= int(i)\n \n if(nimSum == 0):\n return 0\n\n # if(nimSum == 1...
eJzFms2KbclxhTXwgyR33IjMyH8/icHXeGD1QBpcSdACgRH4Iez39ffFPvcgilsNGqlbJU5Xnb13ZsSKtVZE7v/5l//780+/yX/+7Q98+Pf//vL7b3/6yy9f/rV8aePrt9b5qbfdOk85p645b618WvxiDz6tqLOde0qPuviPu8ttp9196i79zrlv7aNE3XdEXD7d2nZvZ5dV9x5rjShjnX7Xur3wp8UD9y2j1rlHzPn1G4u4/ay+5+D3a5zVNt+Iw517zOUav35bu3O3daNw83bv3a2suc6JXk+Zd9TGAjtLYe08MUo/re4Yc5d9Y556...
null