kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
sviams__aoc23__4914a54/src/main/kotlin/day1.kt | object day1 {
val digitMap = mapOf(
"one" to "1",
"two" to "2",
"three" to "3",
"four" to "4",
"five" to "5",
"six" to "6",
"seven" to "7",
"eight" to "8",
"nine" to "9"
)
fun firstAndLast(input: String): String {
val onlyDigi... | [
{
"class_path": "sviams__aoc23__4914a54/day1.class",
"javap": "Compiled from \"day1.kt\"\npublic final class day1 {\n public static final day1 INSTANCE;\n\n private static final java.util.Map<java.lang.String, java.lang.String> digitMap;\n\n private day1();\n Code:\n 0: aload_0\n 1: invoke... |
sviams__aoc23__4914a54/src/main/kotlin/day3.kt | import kotlin.math.max
import kotlin.math.min
object day3 {
data class Number(val chars: String, val startIndex: Int, val row: Int) {
fun toInt() = chars.toInt()
val range by lazy { IntRange(startIndex, startIndex+chars.length-1) }
fun isAdjacentToSymbol(world: List<Line>): Boolean =
... | [
{
"class_path": "sviams__aoc23__4914a54/day3$Line.class",
"javap": "Compiled from \"day3.kt\"\npublic final class day3$Line {\n private final java.util.List<day3$Number> numbers;\n\n private final java.util.List<day3$Symbol> symbols;\n\n public day3$Line(java.util.List<day3$Number>, java.util.List<day3$S... |
sviams__aoc23__4914a54/src/main/kotlin/day4.kt | object day4 {
data class Card(val id: Int, val winning: List<Int>, val mine: List<Int>) {
val matches by lazy { mine.intersect(winning) }
val value by lazy {
if (matches.isEmpty()) 0 else
( 0 until matches.size-1).fold(1) { acc, i -> acc * 2 }
}
val copie... | [
{
"class_path": "sviams__aoc23__4914a54/day4.class",
"javap": "Compiled from \"day4.kt\"\npublic final class day4 {\n public static final day4 INSTANCE;\n\n private day4();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: retur... |
cuuzis__adventofcode__35e56aa/2020/december09.kt | import java.io.File
/**
* https://adventofcode.com/2020/day/9
*/
fun main() {
val weakNumber = star1()
println(weakNumber) // 85848519
println(star2(weakNumber)) // 13414198
}
private fun input(): List<String> {
return File("2020/december09.txt").readLines();
}
private val preambleSize = ... | [
{
"class_path": "cuuzis__adventofcode__35e56aa/December09Kt.class",
"javap": "Compiled from \"december09.kt\"\npublic final class December09Kt {\n private static final int preambleSize;\n\n public static final void main();\n Code:\n 0: invokestatic #10 // Method star1:()J\n ... |
cuuzis__adventofcode__35e56aa/2020/december10.kt | import java.io.File
/**
* https://adventofcode.com/2020/day/10
*/
fun main() {
println(star1()) // 1998
println(star2()) // 347250213298688
}
private fun input(): List<String> {
return File("2020/december10.txt").readLines();
}
private fun star1(): Int {
val adapters = input().map(String::toLong).s... | [
{
"class_path": "cuuzis__adventofcode__35e56aa/December10Kt.class",
"javap": "Compiled from \"december10.kt\"\npublic final class December10Kt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method star1:()I\n 3: istore_0\n 4: getstatic #16 ... |
kormeian__kotlin_koans__550c822/Generics/Generic functions/src/Task.kt | fun <T, C : MutableCollection<T>> Collection<T>.partitionTo(
first: C,
second: C,
predicate: (T) -> Boolean
): Pair<C, C> {
this.forEach { if (predicate(it)) first.add(it) else second.add(it) }
return Pair(first, second)
}
fun partitionWordsAndLines() {
val (words, lines) = listOf("a", "a b", "... | [
{
"class_path": "kormeian__kotlin_koans__550c822/TaskKt.class",
"javap": "Compiled from \"Task.kt\"\npublic final class TaskKt {\n public static final <T, C extends java.util.Collection<T>> kotlin.Pair<C, C> partitionTo(java.util.Collection<? extends T>, C, C, kotlin.jvm.functions.Function1<? super T, java... |
aquatir__code-samples__eac3328/code-sample-kotlin/algorithms/src/main/kotlin/com/codesample/algo/sorts.kt | fun <T> swap(array: Array<T>, fstIndex: Int, sndIndex: Int) {
val fstValue = array[fstIndex]
array[fstIndex] = array[sndIndex]
array[sndIndex] = fstValue
}
/** Selection sort: Find the smallest -> insert it to next position */
fun <T : Comparable<T>> selectionSort(array: Array<T>) {
for (i in array.in... | [
{
"class_path": "aquatir__code-samples__eac3328/SortsKt.class",
"javap": "Compiled from \"sorts.kt\"\npublic final class SortsKt {\n public static final <T> void swap(T[], int, int);\n Code:\n 0: aload_0\n 1: ldc #10 // String array\n 3: invokestatic #16 ... |
nerok__Advent-of-code-2021__4dee925/src/main/kotlin/day8.kt | import java.io.File
import java.util.*
fun main(args: Array<String>) {
day8part2()
}
fun day8part1() {
val countArray = IntArray(8) { 0 }
val input = File("day8input.txt").bufferedReader().readLines()
input.map { line ->
line.split(" | ").map { it.split(" ") }.let { it.first() to it.last() }
... | [
{
"class_path": "nerok__Advent-of-code-2021__4dee925/Day8Kt.class",
"javap": "Compiled from \"day8.kt\"\npublic final class Day8Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
nerok__Advent-of-code-2021__4dee925/src/main/kotlin/day3.kt | import java.io.File
fun main(args: Array<String>) {
day3part2()
}
fun day3part1() {
val countArray = IntArray(12) { 0 }
val input = File("day3input.txt").bufferedReader().readLines()
input.map { it.mapIndexed { index, value ->
if (value == '1') {
countArray[index] = (countArray[ind... | [
{
"class_path": "nerok__Advent-of-code-2021__4dee925/Day3Kt.class",
"javap": "Compiled from \"day3.kt\"\npublic final class Day3Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
nerok__Advent-of-code-2021__4dee925/src/main/kotlin/day4.kt | import java.io.File
fun main(args: Array<String>) {
day4()
}
fun day4() {
val input = File("day4input.txt").bufferedReader()
val drawings = input.readLine().split(",").map { it.toInt() }
input.readLines()
.asSequence()
.windowed(6, step = 6)
.map { board ->
board.fi... | [
{
"class_path": "nerok__Advent-of-code-2021__4dee925/Day4Kt.class",
"javap": "Compiled from \"day4.kt\"\npublic final class Day4Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
nerok__Advent-of-code-2021__4dee925/src/main/kotlin/day5.kt | import java.io.File
import kotlin.math.abs
fun main(args: Array<String>) {
val lines = File("day5input.txt").reader()
var coordinates = mutableListOf<List<Pair<Int, Int>>>()
var size = 0
lines.forEachLine { fileLine ->
fileLine
.split("->")
.map { coordinates ->
... | [
{
"class_path": "nerok__Advent-of-code-2021__4dee925/Day5Kt.class",
"javap": "Compiled from \"day5.kt\"\npublic final class Day5Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
Pleiterson__desafios-bootcamps-dio__003eda6/Kotlin/Solucionando problemas em Kotlin/PrimoRapido.kt | // Primo Rápido
/*
Mariazinha sabe que um Número Primo é aquele que pode ser dividido somente por
1 (um) e por ele mesmo. Por exemplo, o número 7 é primo, pois pode ser dividido
apenas pelo número 1 e pelo número 7 sem que haja resto. Então ela pediu para
você fazer um programa que aceite diversos valores e diga se ca... | [
{
"class_path": "Pleiterson__desafios-bootcamps-dio__003eda6/PrimoRapidoKt.class",
"javap": "Compiled from \"PrimoRapido.kt\"\npublic final class PrimoRapidoKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n ... |
Pleiterson__desafios-bootcamps-dio__003eda6/Kotlin/Solucionando problemas em Kotlin/Figurinhas.kt | // Figurinhas
/*
Ricardo e Vicente são aficionados por figurinhas. Nas horas vagas, eles arrumam
um jeito de jogar um “bafo” ou algum outro jogo que envolva tais figurinhas.
Ambos também têm o hábito de trocarem as figuras repetidas com seus amigos e
certo dia pensaram em uma brincadeira diferente. Chamaram todos os a... | [
{
"class_path": "Pleiterson__desafios-bootcamps-dio__003eda6/FigurinhasKt.class",
"javap": "Compiled from \"Figurinhas.kt\"\npublic final class FigurinhasKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n ... |
manan025__DS-Algo-Zone__c185dce/Kotlin/min_number_of_1.kt | import java.lang.Integer.min
import java.util.*
/*
KOTLIN PROGRAM TO FIND THE ROWS WITH MINIMUM NUMBER OF 1s
INPUT FORMAT :
number of rows and number of column
||THE ARRAY ||
OUTPUT FORMAT:
ith row which has the least number of 1s
the elements of row which has the least number of 1s
INPUT:
5 4
1 1 1 2
1 1 5 2
0 0 1 1
... | [
{
"class_path": "manan025__DS-Algo-Zone__c185dce/Min_number_of_1Kt.class",
"javap": "Compiled from \"min_number_of_1.kt\"\npublic final class Min_number_of_1Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/util/Scanner\n 3: dup\n 4: g... |
manan025__DS-Algo-Zone__c185dce/Kotlin/QuickSort.kt | import java.util.*
/*
Sample Input & Output :
---------------------
The first line of the input contains an integer 'n' denoting the size of the array
The second line of the input contains 'n' no integers
SAMPLE INPUT & OUTPUT 1
INPUT :
4
98 76 54 32
OUTPUT :
32 54 76 98
SAMPLE INPUT & OUTPUT 2
INPUT :
5
45 45 23 65 1... | [
{
"class_path": "manan025__DS-Algo-Zone__c185dce/QuickSort.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class QuickSort {\n private final int[] array;\n\n public QuickSort(int[]);\n Code:\n 0: aload_1\n 1: ldc #9 // String array\n 3: invoke... |
mdtausifahmad__adventofcode2022__13295fd/src/Day04.kt | import java.io.File
fun main(){
val numberOfCommonPairs = File("src/Day04.txt")
.readText()
.split("\n")
.flatMap { it.lines() }
.sumOf {
val split = it.split(",")
overLappingAssignmentPair(split[0].split("-"), split[1].split("-"))
}
println(num... | [
{
"class_path": "mdtausifahmad__adventofcode2022__13295fd/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
mdtausifahmad__adventofcode2022__13295fd/src/Day03.kt | import java.io.File
fun main(){
val groupSize = 3
val sumOfPriorities = File("src/Day03.txt")
.readText()
.also { println(it) }
.split("\n")
.flatMap { it.lines() }
.map { getCommonCharacters(it) }
.flatMap { it.map { elf -> getPriority(elf) } }
.sum()
... | [
{
"class_path": "mdtausifahmad__adventofcode2022__13295fd/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: istore_0\n 2: new #8 // class java/io/File\n 5: du... |
mdtausifahmad__adventofcode2022__13295fd/src/Day02.kt | import java.io.File
fun main(){
val score = File("src/Day02.txt")
.readText()
.split("\n")
.flatMap { it.lines() }
.map { it.split(" ") }
.sumOf { getPointOfRoundSecondPart(it[0].first(), it[1].first()) }
println(score)
}
fun getPointOfRound(first: Char, second: Char... | [
{
"class_path": "mdtausifahmad__adventofcode2022__13295fd/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
sysion__DataStructureAlgorithmKt__6f9afda/Lapindrome.kt | /**
* https://www.codechef.com/problems/LAPIN
*
*
* Lapindromes Problem Code: LAPIN
*
* Lapindrome is defined as a string which when split in the middle, gives two halves
* having the same characters and same frequency of each character. If there are odd
* number of characters in the string, we ignore the middle char... | [
{
"class_path": "sysion__DataStructureAlgorithmKt__6f9afda/LapindromeKt.class",
"javap": "Compiled from \"Lapindrome.kt\"\npublic final class LapindromeKt {\n public static final void main();\n Code:\n 0: ldc #8 // String xyzxy\n 2: astore_0\n 3: aload_0\n ... |
sysion__DataStructureAlgorithmKt__6f9afda/TwoSumEqualToTarget.kt | /**
* https://leetcode.com/problems/two-sum/
*
* Two Sum Less Than K
*
* Given an array of integers nums and an integer target, return indices of the
* two numbers such that they add up to target.
*
* You may assume that each input would have exactly one solution, and you may
* not use the same element twice.
*
* Yo... | [
{
"class_path": "sysion__DataStructureAlgorithmKt__6f9afda/TwoSumEqualToTargetKt.class",
"javap": "Compiled from \"TwoSumEqualToTarget.kt\"\npublic final class TwoSumEqualToTargetKt {\n public static final void main();\n Code:\n 0: iconst_2\n 1: newarray int\n 3: astore_1\n ... |
sysion__DataStructureAlgorithmKt__6f9afda/TwoSumLessThanTarget.kt | /**
* https://leetcode.com/problems/two-sum-less-than-k/
*
* 1. Two Sum Less Than K
*
* Given an array A of integers and integer K, return the maximum S such that
* there exists i < j with A[i] + A[j] = S and S < K. If no i, j exist satisfying
* this equation, return -1.
*
* Example 1:
* Input: A = [34,23,1,24,75,33... | [
{
"class_path": "sysion__DataStructureAlgorithmKt__6f9afda/TwoSumLessThanTargetKt.class",
"javap": "Compiled from \"TwoSumLessThanTarget.kt\"\npublic final class TwoSumLessThanTargetKt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: newarray int\n 3: astore_1\n ... |
ngothanhtuan1203__rectangle_find_fourth_point__5544f73/src/main/kotlin/main.kt | fun main(args: Array<String>) {
print(
"answer1:${
solution(
listOf(
intArrayOf(1, 4),
intArrayOf(3, 4),
intArrayOf(3, 10)
).toTypedArray()
).contentToString()
}\n"
)
print(
... | [
{
"class_path": "ngothanhtuan1203__rectangle_find_fourth_point__5544f73/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: i... |
perihanmirkelam__ProjectEuler__a24ac44/src/main/kotlin/P014_LongestCollatzSequence.kt | /**
* P14-Longest Collatz sequence
* The following iterative sequence is defined for the set of positive integers:
* n → n/2 (n is even)
* n → 3n + 1 (n is odd)
* Using the rule above and starting with 13, we generate the following sequence:
* 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
* It can be... | [
{
"class_path": "perihanmirkelam__ProjectEuler__a24ac44/P014_LongestCollatzSequenceKt.class",
"javap": "Compiled from \"P014_LongestCollatzSequence.kt\"\npublic final class P014_LongestCollatzSequenceKt {\n public static final void p14();\n Code:\n 0: lconst_0\n 1: lstore 6\n 3:... |
perihanmirkelam__ProjectEuler__a24ac44/src/main/kotlin/P011_LargestProductInAGrid.kt | /**
* P11-Largest product in a grid
* In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
* The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
* What is the greatest product of four adjacent numbers in the same direction
* (up, down, left, right, or diagonally) in the 20×... | [
{
"class_path": "perihanmirkelam__ProjectEuler__a24ac44/P011_LargestProductInAGridKt.class",
"javap": "Compiled from \"P011_LargestProductInAGrid.kt\"\npublic final class P011_LargestProductInAGridKt {\n public static final void p11();\n Code:\n 0: ldc #8 // String 08 02... |
perihanmirkelam__ProjectEuler__a24ac44/src/main/kotlin/P018_MaximumPathSum.kt | /**
* P18-Maximum Path Sum
* By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
* 3
* 7 4
* 2 4 6
* 8 5 9 3
* That is, 3 + 7 + 4 + 9 = 23.
* Find the maximum total from top to bottom of the triangle below:... | [
{
"class_path": "perihanmirkelam__ProjectEuler__a24ac44/P018_MaximumPathSumKt.class",
"javap": "Compiled from \"P018_MaximumPathSum.kt\"\npublic final class P018_MaximumPathSumKt {\n public static final java.lang.String str;\n\n private static final java.util.List<java.util.List<java.lang.Integer>> rows;\... |
perihanmirkelam__ProjectEuler__a24ac44/src/main/kotlin/P021_AmicableNumber.kt | /**
* P21 - Amicable Numbers
*
* Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
* If d(a) = b and d(b) = a, where a ≠ b,
* then a and b are an amicable pair and each of a and b are called amicable numbers.
*
* For example, the proper divisors of 220 are 1... | [
{
"class_path": "perihanmirkelam__ProjectEuler__a24ac44/P021_AmicableNumberKt.class",
"javap": "Compiled from \"P021_AmicableNumber.kt\"\npublic final class P021_AmicableNumberKt {\n public static final void p21();\n Code:\n 0: iconst_1\n 1: anewarray #8 // class kotlin/... |
perihanmirkelam__ProjectEuler__a24ac44/src/main/kotlin/P023_NonAbundantSums.kt | /**
* P23-Non-Abundant Sums
*
* A perfect number is a number for which the sum of its proper divisors is exactly equal to the number.
* For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28,
* which means that 28 is a perfect number.
*
* A number n is called deficient if the sum of i... | [
{
"class_path": "perihanmirkelam__ProjectEuler__a24ac44/P023_NonAbundantSumsKt.class",
"javap": "Compiled from \"P023_NonAbundantSums.kt\"\npublic final class P023_NonAbundantSumsKt {\n public static final void p23();\n Code:\n 0: sipush 28123\n 3: istore_0\n 4: bipush 12... |
aochsner__adventofcode2018__7c42ec9/kotlin/aoc2018/src/main/kotlin/Day11.kt | class Day11 {
fun part1(serialNumber: Int) : Pair<Int, Int> {
val powerGrid = Array(300) { x ->
Array(300) { y ->
getPowerLevel(x+1, y+1, serialNumber)
}
}
return findLargestSquare(powerGrid, 3).key
}
private fun findLargestSquare(powerGrid: A... | [
{
"class_path": "aochsner__adventofcode2018__7c42ec9/Day11.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class Day11 {\n public Day11();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n public final kotl... |
aochsner__adventofcode2018__7c42ec9/kotlin/aoc2018/src/main/kotlin/Day12.kt | import java.io.File
class Day12 {
fun part1(lines: List<String>): Int {
val puzzle = Puzzle(lines)
val pots = puzzle.generate(20)
return pots.asSequence().mapIndexed { index, char ->
if (char == '#')
index-(4*20)
else
0
}.sum()... | [
{
"class_path": "aochsner__adventofcode2018__7c42ec9/Day12.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class Day12 {\n public Day12();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n public final int ... |
aochsner__adventofcode2018__7c42ec9/kotlin/aoc2018/src/main/kotlin/Day02.kt | class Day02 {
fun solvePart1(rawValues : List<String>): Int {
val (twos, threes) = rawValues.fold(Pair(0,0)) { sum, element ->
val counts = element.asSequence().groupingBy { it }.eachCount()
Pair(sum.first + if (counts.values.contains(2)) 1 else 0, sum.second + if(counts.valu... | [
{
"class_path": "aochsner__adventofcode2018__7c42ec9/Day02$solvePart1$lambda$1$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Sequences.kt\"\npublic final class Day02$solvePart1$lambda$1$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Character, java.lang.Character> {\n fin... |
cyprienroche__GoogleHashCode20__5196612/src/main/kotlin/InputData.kt | import java.util.Scanner
class InputData(private val scanner: Scanner) {
private val totalBooks: Int = scanner.nextInt()
private val totalLibraries: Int = scanner.nextInt()
val totalDaysGiven: Day = Day(scanner.nextInt())
private val scores: List<Int> = List(totalBooks) { scanner.nextInt() }
val li... | [
{
"class_path": "cyprienroche__GoogleHashCode20__5196612/InputData$special$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class InputData$special$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public InputData$special$$inlined$sortedBy$1();\n Code:\n ... |
nmx__aoc2022__33da213/src/main/kotlin/Day04.kt | fun main(args: Array<String>) {
fun toRange(str: String): IntRange {
val (lo, hi) = str.split("-")
return IntRange(lo.toInt(), hi.toInt())
}
fun rangesFullyContained(a: IntRange, b: IntRange): Boolean {
return (a.first <= b.first && a.last >= b.last) ||
(b.first <= a... | [
{
"class_path": "nmx__aoc2022__33da213/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
nmx__aoc2022__33da213/src/main/kotlin/Day05.kt | fun main(args: Array<String>) {
fun parseStacks(input: List<String>): Pair<List<MutableList<Char>>, List<String>> {
val stackLabels = input.find { s -> s.startsWith(" 1") }!!
val numStacks = stackLabels.split(" ").last { s -> !s.isEmpty() }.toInt()
val stacks = mutableListOf<MutableList<Cha... | [
{
"class_path": "nmx__aoc2022__33da213/Day05Kt$main$input$1.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class Day05Kt$main$input$1 {\n Day05Kt$main$input$1();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: retur... |
nmx__aoc2022__33da213/src/main/kotlin/Day08.kt | fun main(args: Array<String>) {
class Tree(val height: Int) {
var visited = false
var viewScore = 0
override fun toString(): String {
return "$height${if (visited) '*' else ' '} "
}
}
fun countRows(input: List<String>): Int {
return input.size
}
... | [
{
"class_path": "nmx__aoc2022__33da213/Day08Kt$main$Tree.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class Day08Kt$main$Tree {\n private final int height;\n\n private boolean visited;\n\n private int viewScore;\n\n public Day08Kt$main$Tree(int);\n Code:\n 0: aload_0\n 1: in... |
nmx__aoc2022__33da213/src/main/kotlin/Day07.kt | fun main(args: Array<String>) {
val TOTAL_DISK_SPACE = 70000000
val UNUSED_SPACE_NEEDED = 30000000
abstract class Node(val name: String, var size: Int) {
abstract fun calcSize(): Int
abstract fun sumMatchingSizes(): Int
}
class File(name: String, size: Int): Node(name, size) {
... | [
{
"class_path": "nmx__aoc2022__33da213/Day07Kt$main$Dir.class",
"javap": "Compiled from \"Day07.kt\"\npublic final class Day07Kt$main$Dir extends Day07Kt$main$Node {\n private final Day07Kt$main$Dir parent;\n\n private final java.util.Map<java.lang.String, Day07Kt$main$Node> children;\n\n public Day07Kt$... |
nmx__aoc2022__33da213/src/main/kotlin/Day03.kt | fun main(args: Array<String>) {
fun findCommonElement(strings: List<String>): Char {
val sets = strings.map { it.toSet() }
val intersection = sets.reduce { acc, set -> acc.intersect(set) }
if (intersection.size != 1) {
throw RuntimeException("expected exactly one match, found ${i... | [
{
"class_path": "nmx__aoc2022__33da213/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
nmx__aoc2022__33da213/src/main/kotlin/Day02.kt | fun main(args: Array<String>) {
class Shape(
val draw: Char,
val defeats: Char,
val score: Int
)
val shapes = buildMap<Char, Shape> {
put('X', Shape('A', 'C', 1)) // Rock smashes Scissors
put('Y', Shape('B', 'A', 2)) // Paper covers Rock
put('Z', Shape('C', '... | [
{
"class_path": "nmx__aoc2022__33da213/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
kannix68__advent_of_code_2021__fc98894/day01.kt | /**
* Advent of Code 2021 Day 1 solution.
* This is currently a fairly minimalistic code.
*/
import java.io.File
val testin = """
199
200
208
210
200
207
240
269
260
263
""".trimIndent()
/**
* Get diff of List "as series", first element will be null.
*/
private fun diff(ints: List<Int>): List<Int?> {
val di... | [
{
"class_path": "kannix68__advent_of_code_2021__fc98894/Day01Kt.class",
"javap": "Compiled from \"day01.kt\"\npublic final class Day01Kt {\n private static final java.lang.String testin;\n\n public static final java.lang.String getTestin();\n Code:\n 0: getstatic #11 // Field ... |
FasihMuhammadVirk__Concepts-in-Kotlin__089dedc/PF/9. Functions/Function_Exercise.kt | import java.util.*
import kotlin.collections.ArrayList
//Write a function that takes in two integers and return their sums
fun sum_numbers(x:Int , y:Int ):Int = x + y
//A function that reverse the value of the string
fun reverse_string(s:String):String = s.reversed()
//take an array of integer and return their aver... | [
{
"class_path": "FasihMuhammadVirk__Concepts-in-Kotlin__089dedc/Function_ExerciseKt.class",
"javap": "Compiled from \"Function_Exercise.kt\"\npublic final class Function_ExerciseKt {\n public static final int sum_numbers(int, int);\n Code:\n 0: iload_0\n 1: iload_1\n 2: iadd\n 3:... |
feczkob__Kotlin-Koans__b954a54/Generics/Generic functions/src/Task.kt | import java.util.*
fun <K, C : MutableCollection<K>> Collection<K>.partitionTo(
one: C,
two: C,
pred: Collection<K>.(K) -> Boolean,
): Pair<MutableCollection<K>, MutableCollection<K>> {
// * solution 1
// this.forEach {
// if (pred(it)) {
// one += it
// } else {
// ... | [
{
"class_path": "feczkob__Kotlin-Koans__b954a54/TaskKt.class",
"javap": "Compiled from \"Task.kt\"\npublic final class TaskKt {\n public static final <K, C extends java.util.Collection<K>> kotlin.Pair<java.util.Collection<K>, java.util.Collection<K>> partitionTo(java.util.Collection<? extends K>, C, C, kot... |
arcadioramos__google-code-jam__57451e0/solutions/mediansort/medianSort.kt | fun main(){
var (a, b, c) = readLine()!!.split(' ')
var testCases = a.toInt()
var numOfElemnts = b.toInt()
var numOfQueries = c.toInt()
while(testCases > 0){
if(!medianSort(numOfElemnts, numOfQueries))
return
}
testCases = testCases - 1
}
// Median Sort
fun ... | [
{
"class_path": "arcadioramos__google-code-jam__57451e0/MedianSortKt.class",
"javap": "Compiled from \"medianSort.kt\"\npublic final class MedianSortKt {\n public static final void main();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readLine:()Ljava/lang/String;\n ... |
ronhombre__MontgomeryArithmeticKotlinExample__24eac84/src/main/kotlin/Main.kt | //These values below should be saved since we assume that Q is a constant.
//The Q value for Kyber (ML-KEM). This is a prime number ((2^8 * 13) + 1)
const val Q: Short = 3329
//Negative Modular Inverse of Q base 2^16
const val Q_INV = -62209
//Base 2^16.
const val R_shift = 16
//R
const val R = 1 shl R_shift
//R * R = ... | [
{
"class_path": "ronhombre__MontgomeryArithmeticKotlinExample__24eac84/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final short Q;\n\n public static final int Q_INV;\n\n public static final int R_shift;\n\n public static final int R;\n\n public static ... |
JonahBreslow__advent-of-code-kotlin-2022__c307ff2/src/Day04.kt | import java.io.File
import kotlin.math.min
fun main () {
fun parseInput(input: String) : List<List<Set<Int>>>{
return File(input)
.readLines()
.map {
it.split(",")
}
.map{
val set1 = (it[0].split("-")[0].toInt() until it[0].split("-")[1].toInt()... | [
{
"class_path": "JonahBreslow__advent-of-code-kotlin-2022__c307ff2/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String data/day4_test.txt\n 2: astore_0\n 3: aload_... |
JonahBreslow__advent-of-code-kotlin-2022__c307ff2/src/Day03.kt | import java.io.File
val Char.priority: Int
get(): Int {
return when (this){
in 'a'..'z' -> this -'a' + 1
in 'A'..'Z' -> this - 'A' + 27
else -> error("Check your input! $this")
}
}
fun main () {
fun parseInput(input: String)... | [
{
"class_path": "JonahBreslow__advent-of-code-kotlin-2022__c307ff2/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final int getPriority(char);\n Code:\n 0: iload_0\n 1: istore_1\n 2: bipush 97\n 4: iload_1\n 5: if_i... |
JonahBreslow__advent-of-code-kotlin-2022__c307ff2/src/Day02.kt | import java.io.File
fun main(){
fun read_file(file_path: String) : List<String> {
val text = File(file_path).readLines()
return text
}
val fix = mapOf("A" to "X", "B" to "Y", "C" to "Z")
fun part1(x: String) : Int {
val me: String = x[2].toString()
val opp: String = f... | [
{
"class_path": "JonahBreslow__advent-of-code-kotlin-2022__c307ff2/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: anewarray #8 // class kotlin/Pair\n 4: astore_1\n ... |
JonahBreslow__advent-of-code-kotlin-2022__c307ff2/src/Day01.kt | import java.io.File
fun main() {
fun readFile(file_path: String) : List<String> {
val text = File(file_path).readLines()
return text
}
fun create_elves_calories(input: List<String>): List<Int>{
var calories = mutableListOf<Int>()
var counter:Int = 0
for (food in i... | [
{
"class_path": "JonahBreslow__advent-of-code-kotlin-2022__c307ff2/Day01Kt.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class Day01Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String data/day1_test.txt\n 2: invokestatic #12 ... |
BrightOS__os_3__7f4a263/src/main/kotlin/Main.kt | import java.io.File
fun parseInputFile(file: File): Pair<ArrayList<Process>, Int> {
var resultNumberOfTicks = 0
val list = arrayListOf<Process>().apply {
file.forEachLine {
it.split(" ").let {
add(
Process(
name = it[0],
... | [
{
"class_path": "BrightOS__os_3__7f4a263/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final kotlin.Pair<java.util.ArrayList<Process>, java.lang.Integer> parseInputFile(java.io.File);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
TimBo93__AdventOfCode2021__6995010/Day 12/src/main/kotlin/main.kt | import java.io.File
class Route (
val from: String,
val to: String
){
fun reverse(): Route {
return Route(to, from)
}
}
class Transitions {
private var allTransitions = mutableMapOf<String, MutableList<String>>()
fun addTransition (r: Route) {
addRoute(r)
addRoute(... | [
{
"class_path": "TimBo93__AdventOfCode2021__6995010/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class MainKt {\n private static int numPathes;\n\n public static final State initStatePartOne();\n Code:\n 0: new #9 // class State\n 3: dup\n ... |
salvaMsanchez__curso-intro-kotlin__a2fa5b8/ejercicio4A.kt | // Parte 1: Crea una lista “listaRandom” de 100 elementos compuesta de números aleatorios comprendidos entre el 0 y el 9.
// Imprime la lista por pantalla
// Parte 2: Crea una lista vacía “listaResultado” en cuya posición…
// Posición 0 se debe contar cuantos 0 hay en la listaRandom.
// Posición 1 se debe contar cuant... | [
{
"class_path": "salvaMsanchez__curso-intro-kotlin__a2fa5b8/Ejercicio4AKt.class",
"javap": "Compiled from \"ejercicio4A.kt\"\npublic final class Ejercicio4AKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method listaRandom:()Ljava/util/ArrayList;\n 3... |
becsegal__advent-of-code-2022__a4b744a/src/Day04.kt | import java.io.File
fun main() {
// assumes sorted
fun List<Int>.fullyContains(innerList: List<Int>): Boolean {
return this.first() <= innerList.first() && this.last() >= innerList.last()
}
// assumes sorted
fun List<Int>.overlaps(otherList: List<Int>): Boolean {
return (this.firs... | [
{
"class_path": "becsegal__advent-of-code-2022__a4b744a/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/lang/StringBuilder\n 3: dup\n 4: invokespecial #11 ... |
becsegal__advent-of-code-2022__a4b744a/src/Day05.kt | import java.io.File
fun main() {
var stacks: ArrayList<ArrayList<String?>> = ArrayList()
var instructions: ArrayList<List<Int>> = ArrayList()
fun initializeStackLine(row: List<String?>) {
row.forEachIndexed { index, value ->
if (stacks.size <= index) {
stacks.add(Array... | [
{
"class_path": "becsegal__advent-of-code-2022__a4b744a/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class Day05Kt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/jvm/internal/Ref$ObjectRef\n 3: dup\n 4: invokesp... |
becsegal__advent-of-code-2022__a4b744a/src/Day03.kt | import java.io.File
fun main() {
val letters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
fun mispackedCharacter(contents: String): String {
val compartmentAContents: CharArray = contents.substring(0, contents.length/2).toCharArray()
val compartmentBContents: CharArray = contents.... | [
{
"class_path": "becsegal__advent-of-code-2022__a4b744a/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\n 2: ast... |
becsegal__advent-of-code-2022__a4b744a/src/Day02.kt | import java.io.File
fun main() {
val notationToShape = mapOf(
"A" to "Rock",
"B" to "Paper",
"C" to "Scissors",
"X" to "Rock",
"Y" to "Paper",
"Z" to "Scissors"
)
val shapePoints = mapOf(
"Rock" to 1,
"Paper" to 2,
"Scissors" to 3
)
val winOver ... | [
{
"class_path": "becsegal__advent-of-code-2022__a4b744a/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: bipush 6\n 2: anewarray #8 // class kotlin/Pair\n 5: astore_1\n 6... |
zlataovce__aoc23__0f5317f/src/main/kotlin/day5B.kt | import kotlin.math.max
import kotlin.math.min
fun main() = println(
generateSequence(::readLine)
.joinToString("\n")
.split("\n\n")
.let { p ->
Pair(
p[0].substringAfter(": ")
.split(' ')
.map(String::toLong),
... | [
{
"class_path": "zlataovce__aoc23__0f5317f/Day5BKt.class",
"javap": "Compiled from \"day5B.kt\"\npublic final class Day5BKt {\n public static final void main();\n Code:\n 0: getstatic #12 // Field Day5BKt$main$1.INSTANCE:LDay5BKt$main$1;\n 3: checkcast #14 ... |
aisanu__advent-of-code__25dfe70/src/main/kotlin/Day3.kt | object Day3 {
// TODO: How to fix this mess
fun manhattanDistance(est: Long): Long {
val last = (1..Long.MAX_VALUE).takeWhile { Day3.bottomRightValue(it) <= est }.last()
val box = Day3.bottomRightValue(last)
var diff = est - box
val n = 2 * last
var (x, y) = (last - 1) t... | [
{
"class_path": "aisanu__advent-of-code__25dfe70/Day3.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class Day3 {\n public static final Day3 INSTANCE;\n\n private Day3();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
aisanu__advent-of-code__25dfe70/src/main/kotlin/Day2.kt | object Day2 {
fun part1Solution(input: String): Long = splitRows(input)
.map { splitColumns(it) }
.map { minMaxDiff(it) }
.sum()
fun part2Solution(input: String): Long = splitRows(input)
.map { splitColumns(it) }
.map { wholeDivider(it) }
... | [
{
"class_path": "aisanu__advent-of-code__25dfe70/Day2.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class Day2 {\n public static final Day2 INSTANCE;\n\n private Day2();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
pocmo__AdventOfCode2021__73bbb6a/src/day6/day6.kt | import java.io.File
fun readFishMap(): MutableMap<Int, Long> {
val fishes = File("day6.txt")
.readLines()[0]
.split(",")
.map { it.toInt() }
val map = mutableMapOf<Int, Long>()
fishes.forEach { fish ->
val count = map.getOrDefault(fish, 0)
map[fish] = count + 1
... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/Day6Kt.class",
"javap": "Compiled from \"day6.kt\"\npublic final class Day6Kt {\n public static final java.util.Map<java.lang.Integer, java.lang.Long> readFishMap();\n Code:\n 0: new #10 // class java/io/File\n 3: du... |
chaking__study__a394f10/Algorithm/HackerRank/src/OrganizingContainersOfBalls.kt | import java.io.*
import java.math.*
import java.security.*
import java.text.*
import java.util.*
import java.util.concurrent.*
import java.util.function.*
import java.util.regex.*
import java.util.stream.*
import kotlin.collections.*
import kotlin.comparisons.*
import kotlin.io.*
import kotlin.jvm.*
import kotlin.jvm.f... | [
{
"class_path": "chaking__study__a394f10/OrganizingContainersOfBallsKt.class",
"javap": "Compiled from \"OrganizingContainersOfBalls.kt\"\npublic final class OrganizingContainersOfBallsKt {\n public static final java.lang.String organizingContainers(java.lang.Integer[][]);\n Code:\n 0: aload_0\n ... |
chaking__study__a394f10/Algorithm/HackerRank/src/BigNumberMultiplication.kt | import java.io.*
import java.math.*
import java.security.*
import java.text.*
import java.util.*
import java.util.concurrent.*
import java.util.function.*
import java.util.regex.*
import java.util.stream.*
import kotlin.collections.*
import kotlin.comparisons.*
import kotlin.io.*
import kotlin.jvm.*
import kotlin.jvm.f... | [
{
"class_path": "chaking__study__a394f10/BigNumberMultiplicationKt.class",
"javap": "Compiled from \"BigNumberMultiplication.kt\"\npublic final class BigNumberMultiplicationKt {\n public static final java.lang.String multipliedBigNumbers(java.lang.String, java.lang.String);\n Code:\n 0: aload_0\n ... |
chaking__study__a394f10/Algorithm/HackerRank/src/BiggerIsGreater.kt | import java.io.*
import java.math.*
import java.security.*
import java.text.*
import java.util.*
import java.util.concurrent.*
import java.util.function.*
import java.util.regex.*
import java.util.stream.*
import kotlin.collections.*
import kotlin.comparisons.*
import kotlin.io.*
import kotlin.jvm.*
import kotlin.jvm.f... | [
{
"class_path": "chaking__study__a394f10/BiggerIsGreaterKt.class",
"javap": "Compiled from \"BiggerIsGreater.kt\"\npublic final class BiggerIsGreaterKt {\n public static final java.lang.String recursive(java.lang.String, java.lang.String, boolean, java.lang.String, boolean, int);\n Code:\n 0: aloa... |
JohannaGudmandsen__aoc-2022__21daaa4/src/Day09.kt | import java.io.File
import kotlin.collections.*
class Position(var X:Int, var Y:Int)
fun moveTail(head:Position, tail:Position){
if (head.X > tail.X + 1){
tail.X++
if (head.Y > tail.Y){
tail.Y++
}
else if (head.Y < tail.Y){
tail.Y--
}
}
else ... | [
{
"class_path": "JohannaGudmandsen__aoc-2022__21daaa4/Day09Kt.class",
"javap": "Compiled from \"Day09.kt\"\npublic final class Day09Kt {\n public static final void moveTail(Position, Position);\n Code:\n 0: aload_0\n 1: ldc #9 // String head\n 3: invokestatic... |
JohannaGudmandsen__aoc-2022__21daaa4/src/Day08.kt | import java.io.File
import kotlin.collections.*
fun getViewingScore(height:Int, trees:List<Int>):Int{
var viewingScore = 0
for (tree in trees){
viewingScore++
if (tree >= height){
break;
}
}
return viewingScore;
}
fun Day08() {
val input = File("src/input/day08... | [
{
"class_path": "JohannaGudmandsen__aoc-2022__21daaa4/Day08Kt.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class Day08Kt {\n public static final int getViewingScore(int, java.util.List<java.lang.Integer>);\n Code:\n 0: aload_1\n 1: ldc #10 // String tr... |
JohannaGudmandsen__aoc-2022__21daaa4/src/Day11.kt | import java.io.File
import kotlin.collections.*
class Test(var divisibleBy:Int, var trueThrowsToMonkey:Int, var falseThrowsToMonkey:Int)
class Operation(var type:String, var rightValue:String, var leftValue:String)
class Monkey(var id:Int, var items:ArrayList<Long>, var op:Operation, var test:Test, var inspect:Long)... | [
{
"class_path": "JohannaGudmandsen__aoc-2022__21daaa4/Day11Kt.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class Day11Kt {\n public static final void doOneRound(java.util.ArrayList<Monkey>, boolean, int);\n Code:\n 0: aload_0\n 1: ldc #10 // String mon... |
atig05__HACKTOBERFEST-2021__a13b4a7/DSA/kotlin-programming/happy_number.kt | /*
kotlin program to check happy numbers
A happy number is a number, if we reach to 1 after replacing the number by the squares of the digits of the number
Following examples will help to understand better:-
Input: n = 19
Output: True
19 is Happy Number,
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 ... | [
{
"class_path": "atig05__HACKTOBERFEST-2021__a13b4a7/Happy_numberKt.class",
"javap": "Compiled from \"happy_number.kt\"\npublic final class Happy_numberKt {\n public static final int squaredSum(int);\n Code:\n 0: iconst_0\n 1: istore_1\n 2: iload_0\n 3: istore_2\n 4: iload_... |
teemu-rossi__AdventOfCode__16fe605/day3/day3/src/main/kotlin/Day8.kt | val digits = mapOf(
0 to "abcefg", // 6
1 to "cf", // 2
2 to "acdeg", // 5
3 to "acdfg", // 5
4 to "bcdf", // 4
5 to "abdfg", // 5
6 to "abdefg", // 6
7 to "acf", // 3
8 to "abcdefg", // 7
9 to "abcdfg" // 6
)
fun main() {
val values = generateSequence(... | [
{
"class_path": "teemu-rossi__AdventOfCode__16fe605/Day8Kt$main$values$1.class",
"javap": "Compiled from \"Day8.kt\"\nfinal class Day8Kt$main$values$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function0<java.lang.String> {\n public static final Day8Kt$main$values$1 I... |
teemu-rossi__AdventOfCode__16fe605/day3/day3/src/main/kotlin/Main.kt | fun main(args: Array<String>) {
println("Hello World!")
val values = generateSequence(::readLine)
.mapNotNull { line -> line.trim().takeUnless { trimmed -> trimmed.isBlank() } }
.toList()
values.forEach { println(it) }
val bits = values.maxOf { it.length }
val gamma = buildString ... | [
{
"class_path": "teemu-rossi__AdventOfCode__16fe605/MainKt$main$values$1.class",
"javap": "Compiled from \"Main.kt\"\nfinal class MainKt$main$values$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function0<java.lang.String> {\n public static final MainKt$main$values$1 I... |
teemu-rossi__AdventOfCode__16fe605/day3/day3/src/main/kotlin/Day4.kt |
val CARD_WIDTH = 5
val CARD_HEIGHT = 5
fun List<Int>.isBingo(inputs: List<Int>) = this.all { inputs.contains(it) }
data class BingoCard(
val numbers: List<Int>
) {
fun get(row: Int, column: Int): Int = numbers[row * CARD_WIDTH + column]
fun getRow(row: Int) = (0 until CARD_WIDTH).map { get(row, it) }
... | [
{
"class_path": "teemu-rossi__AdventOfCode__16fe605/Day4Kt$main$values$1.class",
"javap": "Compiled from \"Day4.kt\"\nfinal class Day4Kt$main$values$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function0<java.lang.String> {\n public static final Day4Kt$main$values$1 I... |
teemu-rossi__AdventOfCode__16fe605/day3/day3/src/main/kotlin/Day13.kt | data class PointI(val x: Int, val y: Int)
fun main(args: Array<String>) {
val values = generateSequence(::readLine)
.mapNotNull { line -> line.trim().takeUnless { trimmed -> trimmed.isBlank() } }
.toList()
val coords = values
.filter { it.contains(",") }
.map {
val ... | [
{
"class_path": "teemu-rossi__AdventOfCode__16fe605/Day13Kt.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class Day13Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
teemu-rossi__AdventOfCode__16fe605/day3/day3/src/main/kotlin/Day5.kt | import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
data class Point(val x: Int, val y: Int) {
companion object {
fun from(string: String): Point {
val s = string.split(",").mapNotNull { it.trim().takeUnless { it.isEmpty() } }
require(s.size == 2)
return... | [
{
"class_path": "teemu-rossi__AdventOfCode__16fe605/Day5Kt$main$values$1.class",
"javap": "Compiled from \"Day5.kt\"\nfinal class Day5Kt$main$values$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function0<java.lang.String> {\n public static final Day5Kt$main$values$1 I... |
3mtee__exercism-kotlin__6e3eb88/yacht/src/main/kotlin/YachtCategory.kt | internal fun countDices(dices: List<Int>, digit: Int) = dices.filter { it == digit }.sum()
enum class YachtCategory(val score: (dices: List<Int>) -> Int) {
YACHT({ if (it.toSet().size == 1) 50 else 0 }),
ONES({ countDices(it, 1) }),
TWOS({ countDices(it, 2) }),
THREES({ countDices(it, 3) }),
FOURS(... | [
{
"class_path": "3mtee__exercism-kotlin__6e3eb88/YachtCategory$_init_$lambda$11$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class YachtCategory$_init_$lambda$11$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Integer, java.lang.Integer> {\n ... |
3mtee__exercism-kotlin__6e3eb88/forth/src/main/kotlin/Forth.kt | class Forth {
companion object {
private val OPS: Map<String, (List<Int>) -> List<Int>> = mapOf(
"+" to {
require(it.size >= 2) { "tsk-tsk-tsk" }
it.dropLast(2) + it.takeLast(2).sum()
},
"-" to {
require(it.size >= 2) { "ts... | [
{
"class_path": "3mtee__exercism-kotlin__6e3eb88/Forth$Companion.class",
"javap": "Compiled from \"Forth.kt\"\npublic final class Forth$Companion {\n private Forth$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: re... |
3mtee__exercism-kotlin__6e3eb88/complex-numbers/src/main/kotlin/ComplexNumbers.kt | import kotlin.math.*
data class ComplexNumber(val real: Double = 0.0, val imag: Double = 0.0) {
val abs = sqrt(real * real + imag * imag)
operator fun plus(other: ComplexNumber): ComplexNumber {
return ComplexNumber(this.real + other.real, this.imag + other.imag)
}
operator fun minus(other: C... | [
{
"class_path": "3mtee__exercism-kotlin__6e3eb88/ComplexNumbersKt.class",
"javap": "Compiled from \"ComplexNumbers.kt\"\npublic final class ComplexNumbersKt {\n public static final ComplexNumber exponential(ComplexNumber);\n Code:\n 0: aload_0\n 1: ldc #9 // String... |
3mtee__exercism-kotlin__6e3eb88/wordy/src/main/kotlin/Wordy.kt | import kotlin.math.pow
object Wordy {
private const val PREFIX = "What is "
private const val SUFFIX = "?"
private val operations = mapOf<String, (a: Int, b: Int) -> Int>(
"+" to { a, b -> a + b },
"-" to { a, b -> a - b },
"*" to { a, b -> a * b },
"/" to { a, b -> a / b }... | [
{
"class_path": "3mtee__exercism-kotlin__6e3eb88/Wordy.class",
"javap": "Compiled from \"Wordy.kt\"\npublic final class Wordy {\n public static final Wordy INSTANCE;\n\n private static final java.lang.String PREFIX;\n\n private static final java.lang.String SUFFIX;\n\n private static final java.util.Map... |
everyevery__algorithm_code__e9a93f2/leetcode/990-SatisfiabilityOfEqualityEquations/Solution.kt | class Solution {
class Some () {
val parent = IntArray(26) {it}
val rank = IntArray(26) {it}
fun union(a: Int, b: Int): Unit {
val pa = find(a)
val pb = find(b)
if (rank[a] > rank[b]) {
parent[pb] = pa
rank[pa] += rank[pb]
... | [
{
"class_path": "everyevery__algorithm_code__e9a93f2/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class Solution {\n public Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n publi... |
jamesrweb__advent-of-code__1180a7f/2022/05 - Supply Stacks/src/Main.kt | import java.io.File
import java.util.*
data class Crate constructor(val value: String)
data class Stacks constructor(val list: HashMap<Int, MutableList<Crate>>) {
fun viewResult(): String {
return this.list.tops().joinToString("")
}
companion object Static {
fun fromCrates(crates: String):... | [
{
"class_path": "jamesrweb__advent-of-code__1180a7f/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final Stacks executeMoves(java.util.List<java.lang.String>, Stacks, boolean);\n Code:\n 0: aload_0\n 1: ldc #10 // Str... |
19-2-SKKU-OSS__2019-2-OSS-L5__2b55676/Kotlin/EdmondsKarp/EdmondsKarp.kt | import java.util.Scanner
import java.util.*
//FloydWarshall
fun main(args: Array<String>){
println("FloydWarshall");
var capacity = Array<IntArray>(51, {IntArray(51)})
var flow = Array<IntArray>(51, {IntArray(51)})
var visited = IntArray(51){0}
val V = 5;
//V : number of vertices
//E : number of edges
... | [
{
"class_path": "19-2-SKKU-OSS__2019-2-OSS-L5__2b55676/EdmondsKarpKt.class",
"javap": "Compiled from \"EdmondsKarp.kt\"\npublic final class EdmondsKarpKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n ... |
mikegehard__AdventOfCode2017Kotlin__d582688/src/main/kotlin/Day2.kt | import kotlin.math.absoluteValue
data class Spreadsheet(private val rows: List<Row>) {
companion object {
fun from(s: String): Spreadsheet = Spreadsheet(
s.split("\n")
.filter { it.isNotBlank() }
.map { Row.from(it) }
)
}
fun ... | [
{
"class_path": "mikegehard__AdventOfCode2017Kotlin__d582688/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class Day2Kt {\n public static final java.util.List<kotlin.Pair<Cell, Cell>> permutations(Row);\n Code:\n 0: aload_0\n 1: ldc #10 // String ... |
andremion__SlidingPuzzle__8f8b9c4/shared/src/commonMain/kotlin/io/github/andremion/slidingpuzzle/domain/puzzle/PuzzleState.kt | package io.github.andremion.slidingpuzzle.domain.puzzle
import kotlin.math.sqrt
data class PuzzleState @Throws(IllegalArgumentException::class) constructor(
val tiles: List<Int>
) {
data class TilePosition(
val row: Int,
val column: Int
)
val matrixSize = sqrt(tiles.size.toDouble()).... | [
{
"class_path": "andremion__SlidingPuzzle__8f8b9c4/io/github/andremion/slidingpuzzle/domain/puzzle/PuzzleState$TilePosition.class",
"javap": "Compiled from \"PuzzleState.kt\"\npublic final class io.github.andremion.slidingpuzzle.domain.puzzle.PuzzleState$TilePosition {\n private final int row;\n\n private... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day07/Day07a.kt | package com.marcdenning.adventofcode.day07
import java.io.File
import java.util.*
import java.util.regex.Pattern
import java.util.stream.Collectors
fun main(args: Array<String>) {
var numberOfColors = 0
Scanner(File(args[0])).use { scanner ->
numberOfColors += getAncestorsOfTargetColor(parseRules(sca... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day07/Day07aKt.class",
"javap": "Compiled from \"Day07a.kt\"\npublic final class com.marcdenning.adventofcode.day07.Day07aKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day23/Day23a.kt | package com.marcdenning.adventofcode.day23
import java.util.Collections.*
fun main(args: Array<String>) {
var cups = args[0].map { Integer.parseInt(it + "") }
val moves = args[1].toInt()
for (i in 1..moves) {
cups = moveCups(cups)
}
println(getCupsStateString(cups))
}
/**
* Conduct mov... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day23/Day23aKt.class",
"javap": "Compiled from \"Day23a.kt\"\npublic final class com.marcdenning.adventofcode.day23.Day23aKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day12/Day12b.kt | package com.marcdenning.adventofcode.day12
import java.io.File
import kotlin.math.abs
fun main(args: Array<String>) {
var ship = Ship(
Coordinates(0, 0, 90),
Coordinates(10, 1, 0)
)
File(args[0]).readLines().map { parseInstruction(it) }
.forEach { ship = moveShipToWaypoint(ship, i... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day12/Day12bKt.class",
"javap": "Compiled from \"Day12b.kt\"\npublic final class com.marcdenning.adventofcode.day12.Day12bKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day12/Day12a.kt | package com.marcdenning.adventofcode.day12
import java.io.File
import java.util.regex.Pattern
import kotlin.math.abs
const val FORWARD = 'F'
const val NORTH = 'N'
const val SOUTH = 'S'
const val EAST = 'E'
const val WEST = 'W'
const val RIGHT = 'R'
const val LEFT = 'L'
fun main(args: Array<String>) {
var current... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day12/Day12aKt.class",
"javap": "Compiled from \"Day12a.kt\"\npublic final class com.marcdenning.adventofcode.day12.Day12aKt {\n public static final char FORWARD;\n\n public static final char NORTH;\n\n public static ... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day05/Day05a.kt | package com.marcdenning.adventofcode.day05
import java.io.File
import java.util.*
import java.util.regex.MatchResult
import java.util.stream.Stream
private const val NUMBER_OF_ROWS = 128
private const val NUMBER_OF_COLUMNS = 8
fun main(args: Array<String>) {
Scanner(File(args[0])).use { scanner ->
val ma... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day05/Day05aKt$main$1$maxSeatId$1.class",
"javap": "Compiled from \"Day05a.kt\"\nfinal class com.marcdenning.adventofcode.day05.Day05aKt$main$1$maxSeatId$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kot... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day18/Day18b.kt | package com.marcdenning.adventofcode.day18
import java.io.File
fun main(args: Array<String>) {
val sum = File(args[0]).readLines().map { evaluateExpressionInverse(it) }.sum()
println("Sum of all operations: $sum")
}
fun evaluateExpressionInverse(expression: String) = evaluateExpressionTree(buildTreeFromExpr... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day18/Day18bKt.class",
"javap": "Compiled from \"Day18b.kt\"\npublic final class com.marcdenning.adventofcode.day18.Day18bKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day16/Day16a.kt | package com.marcdenning.adventofcode.day16
import java.io.File
import java.util.regex.Pattern
fun main(args: Array<String>) {
val inputLines = File(args[0]).readLines()
val separatorLineIndex = inputLines.indexOf("")
val rules = inputLines.subList(0, separatorLineIndex).map { line ->
parseRule(lin... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day16/Day16aKt.class",
"javap": "Compiled from \"Day16a.kt\"\npublic final class com.marcdenning.adventofcode.day16.Day16aKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day11/Day11b.kt | package com.marcdenning.adventofcode.day11
import java.io.File
private const val FLOOR = '.'
private const val EMPTY = 'L'
private const val OCCUPIED = '#'
fun main(args: Array<String>) {
val floorPlanMatrix = File(args[0]).readLines().map { it.toCharArray() }.toTypedArray()
println("Number of occupied seat... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day11/Day11bKt.class",
"javap": "Compiled from \"Day11b.kt\"\npublic final class com.marcdenning.adventofcode.day11.Day11bKt {\n private static final char FLOOR;\n\n private static final char EMPTY;\n\n private static... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day11/Day11a.kt | package com.marcdenning.adventofcode.day11
import java.io.File
import java.lang.Integer.max
import java.lang.Integer.min
private const val FLOOR = '.'
private const val EMPTY = 'L'
private const val OCCUPIED = '#'
fun main(args: Array<String>) {
val floorPlanMatrix = File(args[0]).readLines().map { it.toCharArra... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day11/Day11aKt.class",
"javap": "Compiled from \"Day11a.kt\"\npublic final class com.marcdenning.adventofcode.day11.Day11aKt {\n private static final char FLOOR;\n\n private static final char EMPTY;\n\n private static... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day17/Day17a.kt | package com.marcdenning.adventofcode.day17
import java.io.File
const val ACTIVE = '#'
const val INACTIVE = '.'
fun main(args: Array<String>) {
val numberOfBootCycles = args[1].toInt()
var pocketDimension = arrayOf(File(args[0]).readLines().map { it.toCharArray() }.toTypedArray())
for (i in 1..numberOfBo... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day17/Day17aKt.class",
"javap": "Compiled from \"Day17a.kt\"\npublic final class com.marcdenning.adventofcode.day17.Day17aKt {\n public static final char ACTIVE;\n\n public static final char INACTIVE;\n\n public stati... |
marcdenning__advent-of-code-2020__b227acb/src/main/kotlin/com/marcdenning/adventofcode/day21/Day21a.kt | package com.marcdenning.adventofcode.day21
import java.io.File
fun main(args: Array<String>) {
val foods = File(args[0]).readLines().map { Food(getIngredients(it), getIdentifiedAllergens(it)) }
val allIngredientsList = foods.flatMap { it.ingredients }
val safeIngredients = getSafeIngredients(foods)
va... | [
{
"class_path": "marcdenning__advent-of-code-2020__b227acb/com/marcdenning/adventofcode/day21/Day21aKt.class",
"javap": "Compiled from \"Day21a.kt\"\npublic final class com.marcdenning.adventofcode.day21.Day21aKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1... |
waterlink__inference__159f87b/common/inference.kt | package com.tddfellow.inference
data class Relation(val name: String, val subject: String, val relative: String) {
private fun matcherFor(getter: (Relation) -> String): (Relation) -> Boolean {
val value = getter(this)
return if (value == "?") {
{ getter(it) != "?" }
} else {
... | [
{
"class_path": "waterlink__inference__159f87b/com/tddfellow/inference/InferenceKt.class",
"javap": "Compiled from \"inference.kt\"\npublic final class com.tddfellow.inference.InferenceKt {\n private static final java.util.List<com.tddfellow.inference.Relation> relations;\n\n public static final java.util... |
PacktPublishing__Hands-On-Object-Oriented-Programming-with-Kotlin__1d36b57/src/main/kotlin/Chapter05/Map.kt | package Chapter5
fun createMap(){
val map: Map<Int,String> = mapOf( Pair(1,"One"), Pair(1,"One"), Pair(2,"Two"), Pair(3,"Three"), 4 to "Four", 5 to "Five")
for(pair in map){
println("${pair.key} ${pair.value}")
}
val setOfPairs = map.entries
for ((key, value) in setOfPairs) {
pri... | [
{
"class_path": "PacktPublishing__Hands-On-Object-Oriented-Programming-with-Kotlin__1d36b57/Chapter5/MapKt.class",
"javap": "Compiled from \"Map.kt\"\npublic final class Chapter5.MapKt {\n public static final void createMap();\n Code:\n 0: bipush 6\n 2: anewarray #8 ... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day07/Solution.kt | package day07
import java.io.File
import kotlin.system.measureTimeMillis
data class DirectoryTree (
val name: String,
val size: Int = 0,
val children: List<DirectoryTree> = listOf()
) {
val fullSize: Int by lazy { size + children.sumOf { it.fullSize } }
fun getDirectorySizeList(): List<Int> =
... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day07/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day07.SolutionKt {\n public static final int sumDirectoriesUnderSize(day07.DirectoryTree, int);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day09/Solution.kt | package day09
import java.io.File
import kotlin.math.abs
data class Position(
val x: Int = 0,
val y: Int = 0
) {
fun doAStep(direction: Direction): Position {
return when (direction) {
Direction.UP -> this.copy(y = y+1)
Direction.DOWN -> this.copy(y = y-1)
Dire... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day09/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day09.SolutionKt {\n public static final int parseTailMovementAndCountPositions(int);\n Code:\n 0: new #8 // class java/io/File... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day12/Solution.kt | package day12
import java.io.File
fun Char.distance(other: Char) =
if (this == 'E') other - 'z'
else if (this == 'S') other - 'a'
else if (other == 'E') 'z' - this
else if (other == 'S') 'a' - this
else other - this
data class DijkstraParams(
val dist: MutableMap<Pair<Int, Int>, Distance> = m... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day12/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day12.SolutionKt {\n public static final int distance(char, char);\n Code:\n 0: iload_0\n 1: bipush 69\n 3: if_icmpne 13\n 6:... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day15/Solution.kt | package day15
import java.io.File
import kotlin.math.abs
import kotlin.system.measureTimeMillis
fun manhattanDistance(x1: Long, y1: Long, x2: Long, y2: Long) = abs(x1-x2) + abs(y1-y2)
class LineScan(
initStart: Long,
initEnd: Long
) {
val start = minOf(initStart, initEnd)
val end = maxOf(initStart, i... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day15/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day15.SolutionKt {\n public static final long manhattanDistance(long, long, long, long);\n Code:\n 0: lload_0\n 1: lload 4\n 3: lsub\n... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day13/Solution.kt | package day13
import java.io.File
abstract class Node : Comparable<Node>
class IntNode(
val value: Int
): Node() {
override fun compareTo(other: Node): Int =
if (other is IntNode) this.value.compareTo(other.value)
else ListNode(listOf(this)).compareTo(other)
}
class ListNode(
val childre... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day13/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day13.SolutionKt {\n public static final java.util.List<java.lang.String> parseListContent(java.lang.String, java.util.List<java.lang.Character>, java.util.List<ja... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day03/Solution.kt | package day03
import java.io.File
fun getItemsPriorities() =
('a'..'z').foldIndexed(mapOf<Char, Int>()) { index, acc, c ->
acc + (c to index+1)
} + ('A' .. 'Z').foldIndexed(mapOf()) { index, acc, c ->
acc + (c to index + 27)
}
fun getItemsFromFile() =
File("src/main/kotlin/day03/input... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day03/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day03.SolutionKt {\n public static final java.util.Map<java.lang.Character, java.lang.Integer> getItemsPriorities();\n Code:\n 0: new #10 ... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day02/Solution.kt | package day02
import java.io.File
import java.lang.Exception
enum class MoveTypes {
ROCK,
PAPER,
SCISSORS
}
fun getWinningMove(move: Move) = when(move.type) {
MoveTypes.ROCK -> Move("B")
MoveTypes.PAPER -> Move("C")
MoveTypes.SCISSORS -> Move("A")
}
fun getLosingMove(move: Move) = when(move.... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day02/SolutionKt$WhenMappings.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day02.SolutionKt$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 ... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day05/Solution.kt | package day05
import java.io.File
import java.util.*
data class Move(
val qty: Int,
val source: String,
val dest: String
)
fun parseStack(rawInput: List<String>): Map<String, Stack<Char>> =
(1 .. 9).fold(emptyMap()) { acc, it ->
acc + (it.toString() to rawInput
.last()
... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day05/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day05.SolutionKt {\n public static final java.util.Map<java.lang.String, java.util.Stack<java.lang.Character>> parseStack(java.util.List<java.lang.String>);\n C... |
TestaDiRapa__advent-of-code-2022__b5b7ebf/src/main/kotlin/day11/SolutionPart2.kt | package day11
import java.io.File
import java.lang.Exception
class IntModule(
initial: Int = 0,
oldModuleMap: Map<Int, Int>? = null
) {
private val moduleMap = oldModuleMap ?: listOf(2,3,5,7,11,13,17,19,23).fold(emptyMap()) { acc, it -> acc + (it to initial%it)}
operator fun plus(increment: Int): Int... | [
{
"class_path": "TestaDiRapa__advent-of-code-2022__b5b7ebf/day11/SolutionPart2Kt.class",
"javap": "Compiled from \"SolutionPart2.kt\"\npublic final class day11.SolutionPart2Kt {\n public static final kotlin.jvm.functions.Function1<day11.IntModule, java.lang.Integer> parseNextMonkeyWithModule(java.lang.Stri... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.