kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
Neonader__Advent-of-Code-2022__4d0cb6f/src/main/kotlin/day08/DayEight.kt | package day08
import java.io.File
val fileList = File("puzzle_input/day08.txt").useLines { it.toList() }
val forest = fileList.map { row -> row.toList().map { col -> col.code } }
val width = forest[0].size
val height = forest.size
fun visible(row: Int, col: Int): Boolean {
val tree = forest[row][col]
if (
r... | [
{
"class_path": "Neonader__Advent-of-Code-2022__4d0cb6f/day08/DayEightKt.class",
"javap": "Compiled from \"DayEight.kt\"\npublic final class day08.DayEightKt {\n private static final java.util.List<java.lang.String> fileList;\n\n private static final java.util.List<java.util.List<java.lang.Integer>> fores... |
Neonader__Advent-of-Code-2022__4d0cb6f/src/main/kotlin/day12/DayTwelve.kt | package day12
import java.io.File
import kotlin.math.min
val fileList = File("puzzle_input/day12.txt").readLines()
// the rows of 'S' and 'E' respectively
val startLine = fileList.indexOfFirst { line -> line.contains('S') }
val goalLine = fileList.indexOfFirst { line -> line.contains('E') }
// the coordinates of 'S'... | [
{
"class_path": "Neonader__Advent-of-Code-2022__4d0cb6f/day12/DayTwelveKt.class",
"javap": "Compiled from \"DayTwelve.kt\"\npublic final class day12.DayTwelveKt {\n private static final java.util.List<java.lang.String> fileList;\n\n private static final int startLine;\n\n private static final int goalLin... |
NicoMincuzzi__adventofcode-2021__345b69c/src/main/kotlin/com/github/nicomincuzzi/Day2Dive.kt | package com.github.nicomincuzzi
import kotlin.math.abs
class Day2Dive {
fun horizontalPositionAndDepth(commands: List<Pair<String, Int>>): Int {
val result = hashMapOf<String, Int>()
for (command in commands) {
if (calculateHorizontalPosition(result, command)) continue
if (... | [
{
"class_path": "NicoMincuzzi__adventofcode-2021__345b69c/com/github/nicomincuzzi/Day2Dive.class",
"javap": "Compiled from \"Day2Dive.kt\"\npublic final class com.github.nicomincuzzi.Day2Dive {\n public com.github.nicomincuzzi.Day2Dive();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
keeferrourke__aoc2021__44677c6/src/main/kotlin/com/adventofcode/Day05.kt | package com.adventofcode
import kotlin.math.roundToInt
data class Point(val x: Int, val y: Int) : Comparable<Point> {
override fun compareTo(other: Point): Int {
val xeq = x.compareTo(other.x)
return if (xeq != 0) xeq else y.compareTo(other.y)
}
}
data class Line(val start: Point, val end: Point) {
val... | [
{
"class_path": "keeferrourke__aoc2021__44677c6/com/adventofcode/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class com.adventofcode.Day05Kt {\n private static final java.util.List<com.adventofcode.Line> parse(java.lang.String);\n Code:\n 0: aload_0\n 1: checkcast #... |
keeferrourke__aoc2021__44677c6/src/main/kotlin/com/adventofcode/Day06.kt | package com.adventofcode
private const val DAYS_TO_REPRODUCE = 7
private const val DAYS_TO_MATURE = 2
data class Generation(val distribution: Map<Int, Long>) {
private fun fillGaps(sparseMap: Map<Int, Long>): Map<Int, Long> {
val result = mutableMapOf<Int, Long>()
for (i in 0..DAYS_TO_MATURE + DAYS_TO_REPRO... | [
{
"class_path": "keeferrourke__aoc2021__44677c6/com/adventofcode/Day06Kt.class",
"javap": "Compiled from \"Day06.kt\"\npublic final class com.adventofcode.Day06Kt {\n private static final int DAYS_TO_REPRODUCE;\n\n private static final int DAYS_TO_MATURE;\n\n public static final long computeFishPopulatio... |
keeferrourke__aoc2021__44677c6/src/main/kotlin/com/adventofcode/Day03.kt | package com.adventofcode
data class Diagnostic(val rowView: List<String>) {
private val colView: List<String> by lazy { readColumns(rowView) }
private fun readColumns(rows: List<String>): List<String> {
val columns = mutableMapOf<Int, String>()
for (row in rows) {
for (j in row.indices) {
co... | [
{
"class_path": "keeferrourke__aoc2021__44677c6/com/adventofcode/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class com.adventofcode.Day03Kt {\n public static final void day03(java.lang.String, java.util.List<java.lang.String>);\n Code:\n 0: aload_0\n 1: ldc #... |
keeferrourke__aoc2021__44677c6/src/main/kotlin/com/adventofcode/Day02.kt | package com.adventofcode
/**
* [https://adventofcode.com/2021/day/2]
*/
enum class Command {
FORWARD, DOWN, UP;
companion object {
fun of(string: String) = when (string) {
"forward" -> FORWARD
"down" -> DOWN
"up" -> UP
else -> error("Unknown command")
}
}
}
private data class ... | [
{
"class_path": "keeferrourke__aoc2021__44677c6/com/adventofcode/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class com.adventofcode.Day02Kt {\n public static final java.util.List<kotlin.Pair<com.adventofcode.Command, java.lang.Integer>> commands(java.lang.String);\n Code:\n ... |
keeferrourke__aoc2021__44677c6/src/main/kotlin/com/adventofcode/Day01.kt | package com.adventofcode
/**
* [https://adventofcode.com/2021/day/1]
*/
fun sonarSweep(readings: Sequence<Int>, window: Int = 1): Int = readings
.windowed(window)
.map { it.sum() }
.fold(listOf<Pair<Int, DepthChange>>()) { acc, windowedSum ->
acc + (acc.lastOrNull()?.let { windowedSum to DepthChange.of(it.... | [
{
"class_path": "keeferrourke__aoc2021__44677c6/com/adventofcode/Day01Kt.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class com.adventofcode.Day01Kt {\n public static final int sonarSweep(kotlin.sequences.Sequence<java.lang.Integer>, int);\n Code:\n 0: aload_0\n 1: ldc ... |
wanglikun7342__Leetcode-Kotlin__d7fb5ff/src/main/kotlin/com/eric/leetcode/MaxAreaOfIsland.kt | package com.eric.leetcode
class MaxAreaOfIsland {
private lateinit var grid: Array<IntArray>
private lateinit var seen: Array<BooleanArray>
private var count = 0
var dr = intArrayOf(1, -1, 0, 0)
var dc = intArrayOf(0, 0, 1, -1)
private fun getArea(r: Int, c: Int): Int {
count++
... | [
{
"class_path": "wanglikun7342__Leetcode-Kotlin__d7fb5ff/com/eric/leetcode/MaxAreaOfIslandKt.class",
"javap": "Compiled from \"MaxAreaOfIsland.kt\"\npublic final class com.eric.leetcode.MaxAreaOfIslandKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc ... |
wanglikun7342__Leetcode-Kotlin__d7fb5ff/src/main/kotlin/com/eric/leetcode/SatisfiabilityOfEqualityEquations.kt | package com.eric.leetcode
class SatisfiabilityOfEqualityEquations {
private class UnionFind(n: Int) {
private val parent: Array<Int> = Array(n) {
it
}
fun find(input: Int): Int {
var x = input
while (x != parent[x]) {
parent[x] = parent[p... | [
{
"class_path": "wanglikun7342__Leetcode-Kotlin__d7fb5ff/com/eric/leetcode/SatisfiabilityOfEqualityEquations$UnionFind.class",
"javap": "Compiled from \"SatisfiabilityOfEqualityEquations.kt\"\nfinal class com.eric.leetcode.SatisfiabilityOfEqualityEquations$UnionFind {\n private final java.lang.Integer[] pa... |
wanglikun7342__Leetcode-Kotlin__d7fb5ff/src/main/kotlin/com/eric/leetcode/MinimumPathSum.kt | package com.eric.leetcode
class MinimumPathSum {
fun minPathSum(grid: Array<IntArray>): Int {
val dp = Array(grid.size) { Array(grid[0].size) { 0 } }
for (i in grid.indices) {
for (j in grid[0].indices) {
if (i == 0 && j == 0) {
dp[0][0] = grid[0][0]
... | [
{
"class_path": "wanglikun7342__Leetcode-Kotlin__d7fb5ff/com/eric/leetcode/MinimumPathSumKt.class",
"javap": "Compiled from \"MinimumPathSum.kt\"\npublic final class com.eric.leetcode.MinimumPathSumKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc ... |
wanglikun7342__Leetcode-Kotlin__d7fb5ff/src/main/kotlin/com/eric/leetcode/FindTheShortestSuperstring.kt | package com.eric.leetcode
class FindTheShortestSuperstring {
fun shortestSuperstring(A: Array<String>): String {
val list = A.toMutableList()
while (list.size > 1) {
var x = 0
var y = 1
for (iv in list.withIndex()) {
for (index in iv.index + 1..li... | [
{
"class_path": "wanglikun7342__Leetcode-Kotlin__d7fb5ff/com/eric/leetcode/FindTheShortestSuperstring.class",
"javap": "Compiled from \"FindTheShortestSuperstring.kt\"\npublic final class com.eric.leetcode.FindTheShortestSuperstring {\n public com.eric.leetcode.FindTheShortestSuperstring();\n Code:\n ... |
wanglikun7342__Leetcode-Kotlin__d7fb5ff/src/main/kotlin/com/eric/leetcode/ArithmeticSlicesIISubsequence.kt | package com.eric.leetcode
import java.util.HashMap
/**
* 暴力解法，DFS
*/
//class ArithmeticSlicesIISubsequence {
//
// var num = 0
//
//
// fun numberOfArithmeticSlices(A: IntArray): Int {
// num = 0
// for (index in A.indices) {
// dfs(A, index, Long.MIN_VALUE, 1)
// }
// ... | [
{
"class_path": "wanglikun7342__Leetcode-Kotlin__d7fb5ff/com/eric/leetcode/ArithmeticSlicesIISubsequence.class",
"javap": "Compiled from \"ArithmeticSlicesIISubsequence.kt\"\npublic final class com.eric.leetcode.ArithmeticSlicesIISubsequence {\n public com.eric.leetcode.ArithmeticSlicesIISubsequence();\n ... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day15.kt | package com.codelicia.advent2021
import java.util.*
import kotlin.math.min
class Day15(val input: String) {
// Split the input string into a 2D grid of integers
private val grid = input.split("\n").map { it ->
it.toCharArray().map { it.digitToInt() }
}
private val maxRow = grid.lastIndex
... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day15.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class com.codelicia.advent2021.Day15 {\n private final java.lang.String input;\n\n private final java.util.List<java.util.List<java.lang.Integer>> grid;\n\n private ... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day03.kt | package com.codelicia.advent2021
import java.util.SortedMap
class Day03(private val input: List<String>) {
private val bitLength = input.first().length
private fun List<Int>.toInt() =
this.joinToString("").toInt(2)
private fun List<Int>.gamma() = this.toInt()
private fun List<Int>.epsilon(... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day03$countBits$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class com.codelicia.advent2021.Day03$countBits$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Integer, ja... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day13.kt | package com.codelicia.advent2021
import kotlin.math.max
class Day13(val input: String) {
fun solve(folds: Int): Int {
val (dots, fold) = input.split("\n\n")
val xs = dots.split("\n").map { it.split(",").map { s -> s.toInt() } }
val xMax = xs.maxOf { it[0] }
val yMax = xs.maxOf { i... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day13.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class com.codelicia.advent2021.Day13 {\n private final java.lang.String input;\n\n public com.codelicia.advent2021.Day13(java.lang.String);\n Code:\n 0: aloa... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day08.kt | package com.codelicia.advent2021
class Day08(private val signals: List<String>) {
data class SegmentMap(
val map: Map<String, Int>,
val decodedNumber: Int
) {
companion object {
private fun String.order() =
this.split("").sortedDescending().joinToString(sepa... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day08.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class com.codelicia.advent2021.Day08 {\n private final java.util.List<java.lang.String> signals;\n\n private final java.util.List<java.lang.Integer> easyDigits;\n\n ... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day05.kt | package com.codelicia.advent2021
import kotlin.math.max
import kotlin.math.min
typealias Vent = Pair<Int, Int>
typealias VentLine = Pair<Vent, Vent>
class Day05(input: String) {
private val vents: List<VentLine> = input.trimIndent()
.lines()
.map { x ->
val xs = x.split(" -> ")
... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class com.codelicia.advent2021.Day05Kt {\n}\n",
"javap_err": ""
},
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day05$Compan... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day16.kt | package com.codelicia.advent2021
class Day16(val input: String) {
private fun hexToBinary(input: String): List<Char> =
input.map { it.digitToInt(16).toString(2).padStart(4, '0') }.flatMap { it.toList() }
private var transmission: Iterator<Char> = hexToBinary(input).iterator()
fun Iterator<Char>.... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day16.class",
"javap": "Compiled from \"Day16.kt\"\npublic final class com.codelicia.advent2021.Day16 {\n private final java.lang.String input;\n\n private java.util.Iterator<java.lang.Character> transmission;\n\n public com.codel... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day09.kt | package com.codelicia.advent2021
import java.util.Stack
class Day09(private val input: List<String>) {
private fun parseHeightmap(xs: List<String>): List<List<Int>> =
xs.map { it.toCharArray().map(Char::digitToInt) }
private fun <T> List<List<T>>.getLocation(p: Pair<Int, Int>): T? =
this.get... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day09.class",
"javap": "Compiled from \"Day09.kt\"\npublic final class com.codelicia.advent2021.Day09 {\n private final java.util.List<java.lang.String> input;\n\n public com.codelicia.advent2021.Day09(java.util.List<java.lang.Stri... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day10.kt | package com.codelicia.advent2021
import java.util.Stack
class Day10(private val input: List<String>) {
private val scoreTable: Map<String, Long> = mapOf(
")" to 3L,
"]" to 57L,
"}" to 1197L,
">" to 25137L,
)
private val scoreTableForIncomplete: Map<String, Long> = mapOf(
... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day10.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class com.codelicia.advent2021.Day10 {\n private final java.util.List<java.lang.String> input;\n\n private final java.util.Map<java.lang.String, java.lang.Long> score... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day12.kt | package com.codelicia.advent2021
import java.util.Stack
class Day12(mapOfTheRemainingCaves: List<String>) {
data class Vertex(val label: String)
private val map = mapOfTheRemainingCaves
.map { cave -> cave.split("-") }
.map { cave -> cave.first() to cave.last() }
private val graph = bui... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day12.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class com.codelicia.advent2021.Day12 {\n private final java.util.List<kotlin.Pair<java.lang.String, java.lang.String>> map;\n\n private final java.util.Map<com.codeli... |
codelicia__adventofcode__df0cfd5/2021/kotlin/src/main/kotlin/com/codelicia/advent2021/Day04.kt | package com.codelicia.advent2021
class Day04(input: String) {
private val newline = "\n"
private val section = "\n\n"
private val sections = input.split(section)
private val draws = sections[0].trim().split(",").map(String::toInt)
private val cards : List<BingoBoard> = buildList {
for (i... | [
{
"class_path": "codelicia__adventofcode__df0cfd5/com/codelicia/advent2021/Day04.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class com.codelicia.advent2021.Day04 {\n private final java.lang.String newline;\n\n private final java.lang.String section;\n\n private final java.util.List<java.la... |
damcyb__BasicsOfCryptography__1dd03a2/StreamCiphers/src/main/kotlin/utils/BBSAnalyzer.kt | package utils
import java.math.BigDecimal
class BBSAnalyzer {
fun countOnes(bbs: String): Int = bbs.count { c: Char -> c == '1'}
fun countSeries(bbs: String, character: Char): Map<Int, Int> {
val occurrencesMap: MutableMap<Int, Int> = initializeOccurrencesMap()
var lastFoundChar: Char = 'x'
... | [
{
"class_path": "damcyb__BasicsOfCryptography__1dd03a2/utils/BBSAnalyzer$incrementOccurrencesMap$1.class",
"javap": "Compiled from \"BBSAnalyzer.kt\"\nfinal class utils.BBSAnalyzer$incrementOccurrencesMap$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function2<java.lang... |
KentVu__CSProblems__52cb15d/model/src/main/java/com/kentvu/csproblems/Playground.kt | package com.kentvu.csproblems
import kotlin.reflect.full.hasAnnotation
import kotlin.reflect.full.memberFunctions
class Playground {
@Target(AnnotationTarget.FUNCTION)
annotation class AlgoFunction
@OptIn(ExperimentalStdlibApi::class)
val algos: List<String> get() {
return Playground::class.m... | [
{
"class_path": "KentVu__CSProblems__52cb15d/com/kentvu/csproblems/Playground.class",
"javap": "Compiled from \"Playground.kt\"\npublic final class com.kentvu.csproblems.Playground {\n public com.kentvu.csproblems.Playground();\n Code:\n 0: aload_0\n 1: invokespecial #8 // M... |
arindamxd__kotlin-development__d9393b8/app/src/main/java/com/arindam/kotlin/ds/GFG.kt | package com.arindam.kotlin.ds
/**
* Kotlin program to find out all combinations of positive numbers that add up to given number.
*
* Created by <NAME> on 29/7/19.
*/
fun main() {
val k = 5
findCombinations(k)
}
/**
* @param arr array to store the combination
* @param index next location in ... | [
{
"class_path": "arindamxd__kotlin-development__d9393b8/com/arindam/kotlin/ds/GFGKt.class",
"javap": "Compiled from \"GFG.kt\"\npublic final class com.arindam.kotlin.ds.GFGKt {\n public static final void main();\n Code:\n 0: iconst_5\n 1: istore_0\n 2: iload_0\n 3: invokestatic ... |
walkmansit__AlgoHub__2497fcc/src/main/kotlin/Algorithms/MaxSubarraySum/DivideAndConquer.kt | package Algorithms.MaxSubarraySum
class DivideAndConquer {
companion object {
fun findMaxSubarraySum(array: IntArray): Int {
return findMaxSubarrayDiapason(array, 0, array.size - 1).third
}
private fun findMaxSubarrayDiapason(
array: IntArray,
low: Int... | [
{
"class_path": "walkmansit__AlgoHub__2497fcc/Algorithms/MaxSubarraySum/DivideAndConquer$Companion.class",
"javap": "Compiled from \"DivideAndConquer.kt\"\npublic final class Algorithms.MaxSubarraySum.DivideAndConquer$Companion {\n private Algorithms.MaxSubarraySum.DivideAndConquer$Companion();\n Code:\... |
CX-Checkout__rvpk01__9209c41/src/main/kotlin/befaster/solutions/Item.kt | package befaster.solutions
sealed abstract class Item(open val price: Price)
object A : Item(50)
object B : Item(30)
object C : Item(20)
object D : Item(15)
object E : Item(40)
object Invalid : Item(-1)
typealias Basket = List<Item>
typealias Price = Int
interface Deal {
val howManyYouNeedToBuy: Int
}
data clas... | [
{
"class_path": "CX-Checkout__rvpk01__9209c41/befaster/solutions/Item.class",
"javap": "Compiled from \"Item.kt\"\npublic abstract class befaster.solutions.Item {\n private final int price;\n\n private befaster.solutions.Item(int);\n Code:\n 0: aload_0\n 1: invokespecial #9 ... |
Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/src/day04/Day04.kt | package day04
import java.io.File
fun main() {
fun part1(input: String) : Long {
val data = input.split("\n").sumOf { line ->
val parts = line.split(",")
val firstPart = parts[0].split("-")
val secondPart = parts[1].split("-")
val firstStart = firstPart.fir... | [
{
"class_path": "Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/day04/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class day04.Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/src/day03/Day03.kt | package day03
import java.io.File
fun main() {
val letters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
fun part1(input: String) : Int {
val data = input.split("\n")
var sum = 0
for (line in data) {
val secondHalf = line.substring(line.length/2)
for ... | [
{
"class_path": "Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/day03/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class day03.Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWX... |
Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/src/day02/Day02.kt | package day02
import java.io.File
fun main() {
fun part1(input: String) : Long {
val lostSet = setOf("A Z", "B X", "C Y")
val winSet = setOf("A Y", "B Z", "C X")
val drawSet = setOf("A X", "B Y", "C Z")
val scoreMap = mapOf('X' to 1, 'Y' to 2, 'Z' to 3)
val data = input.... | [
{
"class_path": "Sardorbekcyber__aoc-2022-in-kotlin__56f29c8/day02/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class day02.Day02Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
laech__intellij-jump__a404fe4/src/main/java/com/gitlab/lae/intellij/jump/Tree.kt | package com.gitlab.lae.intellij.jump
data class TreePath<out K>(val keys: List<K>)
operator fun <K> TreePath<K>.plus(key: K) = TreePath(keys + key)
sealed class Tree<out K, out V>
data class TreeLeaf<out V>(val value: V) : Tree<Nothing, V>() {
override fun toString() = "TreeLeaf($value)"
}
data class TreeNode<ou... | [
{
"class_path": "laech__intellij-jump__a404fe4/com/gitlab/lae/intellij/jump/TreeKt.class",
"javap": "Compiled from \"Tree.kt\"\npublic final class com.gitlab.lae.intellij.jump.TreeKt {\n private static final com.gitlab.lae.intellij.jump.TreePath emptyPath;\n\n private static final com.gitlab.lae.intellij.... |
codetreats__aoc2023__3cd4aa5/src/main/kotlin/net/codetreats/aoc/common/Dijkstra.kt | package net.codetreats.aoc.common
class Dijkstra {
/**
* Calculate the minimum distance between startNode and endNode.
* The algorithm expects, that there are exactly [nodeCount] nodes with names from 0 to [nodeCount - 1]
* @param: nodeCount the total number of nodes
* @param: startNOde the nam... | [
{
"class_path": "codetreats__aoc2023__3cd4aa5/net/codetreats/aoc/common/Dijkstra.class",
"javap": "Compiled from \"Dijkstra.kt\"\npublic final class net.codetreats.aoc.common.Dijkstra {\n public net.codetreats.aoc.common.Dijkstra();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
codetreats__aoc2023__3cd4aa5/src/main/kotlin/net/codetreats/aoc/day02/Game.kt | package net.codetreats.aoc.day02
import kotlin.math.max
data class Game(val id: Int, val extractions: List<Extraction>) {
fun isPossible(input: Map<String, Int>) =
extractions.map { it.dices }.flatten().none { input[it.color]!! < it.amount }
fun power(): Int {
val min = mutableMapOf("green" t... | [
{
"class_path": "codetreats__aoc2023__3cd4aa5/net/codetreats/aoc/day02/Game.class",
"javap": "Compiled from \"Game.kt\"\npublic final class net.codetreats.aoc.day02.Game {\n public static final net.codetreats.aoc.day02.Game$Companion Companion;\n\n private final int id;\n\n private final java.util.List<n... |
ssynhtn__leetcode__511f658/src/com/ssynhtn/medium/UniquePermutations.kt | package com.ssynhtn.medium
import java.util.*
class UniquePermutations {
fun permuteUnique(nums: IntArray): List<List<Int>> {
nums.sort()
val collection = mutableListOf<List<Int>>()
permute(nums, 0, collection)
return collection
}
private fun permute(nums: IntArray, fixCo... | [
{
"class_path": "ssynhtn__leetcode__511f658/com/ssynhtn/medium/UniquePermutationsKt.class",
"javap": "Compiled from \"UniquePermutations.kt\"\npublic final class com.ssynhtn.medium.UniquePermutationsKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc ... |
ssynhtn__leetcode__511f658/src/com/ssynhtn/medium/NQueens.kt | package com.ssynhtn.medium
class NQueens {
fun solveNQueens2(n: Int): Int {
val table = Array<CharArray>(n, {i -> CharArray(n)})
for (i in 0 until n) {
for (j in 0 until n) {
table[i][j] = '.'
}
}
return putQueens(table, 0)
}
priva... | [
{
"class_path": "ssynhtn__leetcode__511f658/com/ssynhtn/medium/NQueensKt.class",
"javap": "Compiled from \"NQueens.kt\"\npublic final class com.ssynhtn.medium.NQueensKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // Strin... |
ssynhtn__leetcode__511f658/src/com/ssynhtn/medium/MaximumSubarray.kt | package com.ssynhtn.medium
class MaximumSubarray {
fun maxSubArrayDivConquer(nums: IntArray): Int {
return maxSubArrayDivConquer(nums, 0, nums.size)[0] // max, left max, right max, total, each requiring at least length one
}
// end > start
fun maxSubArrayDivConquer(nums: IntArray, start: Int, ... | [
{
"class_path": "ssynhtn__leetcode__511f658/com/ssynhtn/medium/MaximumSubarray.class",
"javap": "Compiled from \"MaximumSubarray.kt\"\npublic final class com.ssynhtn.medium.MaximumSubarray {\n public com.ssynhtn.medium.MaximumSubarray();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
ssynhtn__leetcode__511f658/src/com/ssynhtn/medium/Permutations.kt | package com.ssynhtn.medium
class Permutations {
var swapCount = 0;
fun permute(nums: IntArray): List<List<Int>> {
val collect = mutableListOf<List<Int>>()
permute(nums, 0, collect)
return collect
}
fun permute2(nums: IntArray): List<List<Int>> {
val collect = mutableLis... | [
{
"class_path": "ssynhtn__leetcode__511f658/com/ssynhtn/medium/Permutations.class",
"javap": "Compiled from \"Permutations.kt\"\npublic final class com.ssynhtn.medium.Permutations {\n private int swapCount;\n\n public com.ssynhtn.medium.Permutations();\n Code:\n 0: aload_0\n 1: invokespecia... |
ezAuton__ezAuton__b08c522/Core/src/main/kotlin/com/github/ezauton/core/utils/math/AlgebraUtils.kt | package com.github.ezauton.core.utils.math
/**
* @param map
* @return If is odd function
*/
fun hasOddSymmetry(map: Map<out Double, Double>): Boolean {
return map.entries.stream().allMatch { entry ->
val key = entry.key
val value = entry.value
val symmetricEntry = map[-key]?.toDouble()
symmetricEn... | [
{
"class_path": "ezAuton__ezAuton__b08c522/com/github/ezauton/core/utils/math/AlgebraUtilsKt.class",
"javap": "Compiled from \"AlgebraUtils.kt\"\npublic final class com.github.ezauton.core.utils.math.AlgebraUtilsKt {\n public static final boolean hasOddSymmetry(java.util.Map<? extends java.lang.Double, jav... |
lm41__pro-train-kotlin__bba220a/src/main/kotlin/o9referenzdatentypen/Fraction.kt | package o9referenzdatentypen
/**
* Programmieren Trainieren Seite 192
* W.9.2 <NAME>
*
* Erweitert um [Fraction.divide] und weitere helper wie [Fraction.shorten] und [Fraction.gcd]
* */
fun main() {
val a = Fraction(numerator = 1, denominator = 2)
val b = Fraction(numerator = 1, denominator = 4)
val... | [
{
"class_path": "lm41__pro-train-kotlin__bba220a/o9referenzdatentypen/Fraction.class",
"javap": "Compiled from \"Fraction.kt\"\npublic final class o9referenzdatentypen.Fraction {\n private final int numerator;\n\n private final int denominator;\n\n public o9referenzdatentypen.Fraction(int, int);\n Cod... |
DPNT-Sourcecode__CHK-cvvr01__326235b/src/main/kotlin/solutions/CHK/CheckoutSolution.kt | package solutions.CHK
object CheckoutSolution {
fun checkout(skus: String): Int {
val skuList = skus.map { it.toString() }
if (containsInvalidSkus(skuList)) {
return -1
}
val checkoutItemsMap = getCheckoutItemsMap(skuList)
val items = setupItems()
return... | [
{
"class_path": "DPNT-Sourcecode__CHK-cvvr01__326235b/solutions/CHK/CheckoutSolution$applyMostExpensiveBundle$$inlined$sortedByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class solutions.CHK.CheckoutSolution$applyMostExpensiveBundle$$inlined$sortedByDescending$1<T> implemen... |
vikaskushwaha9oct__intstar__27ee780/intstar-mcalculus/src/main/kotlin/intstar/mcalculus/Prelude.kt | package intstar.mcalculus
import java.nio.ByteBuffer.wrap
import java.util.*
import kotlin.math.abs
typealias InputStream = java.io.InputStream
const val INFINITY = Double.POSITIVE_INFINITY
const val NEG_INFINITY = Double.NEGATIVE_INFINITY
fun <T> Iterable<T>.sumsToOne(valueFn: (T) -> Double): Boolean {
return... | [
{
"class_path": "vikaskushwaha9oct__intstar__27ee780/intstar/mcalculus/PreludeKt.class",
"javap": "Compiled from \"Prelude.kt\"\npublic final class intstar.mcalculus.PreludeKt {\n public static final double INFINITY;\n\n public static final double NEG_INFINITY;\n\n private static final byte[] EMPTY_BYTE_... |
vikaskushwaha9oct__intstar__27ee780/intstar-mcalculus/src/main/kotlin/intstar/mcalculus/Measurement.kt | package intstar.mcalculus
data class Measurement(
val left: DerivedMeasure,
val comparison: Comparison,
val right: Measure,
val confidence: List<ConfidenceValue>
) {
init {
require(confidence.sumsToOne { it.value }) { "Total confidence should be 1" }
require(confiden... | [
{
"class_path": "vikaskushwaha9oct__intstar__27ee780/intstar/mcalculus/Measurement.class",
"javap": "Compiled from \"Measurement.kt\"\npublic final class intstar.mcalculus.Measurement {\n private final intstar.mcalculus.DerivedMeasure left;\n\n private final intstar.mcalculus.Comparison comparison;\n\n p... |
serbanghita__kotlin-pocs__bca5629/src/com/kotlin/pocs/predicates/Predicates.kt | package com.kotlin.pocs.predicates
fun main(args: Array<String>): Unit {
// val n = listOf(1,2,3,4,5,6,7,8);
// val pred = { value: Int -> value > 5 }
//
// println(n.all(pred))
// println(n.any(pred))
// println(n.count { it > 5 })
//
// println(n.find(pred))
val players = listOf(
Play... | [
{
"class_path": "serbanghita__kotlin-pocs__bca5629/com/kotlin/pocs/predicates/PredicatesKt.class",
"javap": "Compiled from \"Predicates.kt\"\npublic final class com.kotlin.pocs.predicates.PredicatesKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc ... |
ascheja__aoc2020__f115063/day5/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day5
fun main() {
val testCodes = listOf(
"FBFBBFFRLR",
"BFFFBBFRRR",
"FFFBBBFRRR",
"BBFFBBFRLL"
)
testCodes.forEach { testCode ->
println(SeatCoordinates.ofSeatCode(testCode))
}
ClassLoader.getSystemResourceAsStream("input.txt")!... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day5/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day5.AppKt {\n public static final void main();\n Code:\n 0: iconst_4\n 1: anewarray #10 // class java/lang/String\... |
ascheja__aoc2020__f115063/day12/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day12
import kotlin.math.abs
fun main() {
println(readInstructions("testinput.txt").calculateManhattanDistancePart1())
println(readInstructions("input.txt").calculateManhattanDistancePart1())
println(readInstructions("testinput.txt").calculateManhattanDistancePart2())
prin... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day12/AppKt$readInstructions$1$1.class",
"javap": "Compiled from \"App.kt\"\nfinal class net.sinceat.aoc2020.day12.AppKt$readInstructions$1$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.lang.S... |
ascheja__aoc2020__f115063/day15/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day15
fun main() {
println("1, 3, 2, ... = ${theElvesGamePart1(listOf(1, 3, 2)).nth(2020)}")
println("2, 1, 3, ... = ${theElvesGamePart1(listOf(2, 1, 3)).nth(2020)}")
println("1, 2, 3, ... = ${theElvesGamePart1(listOf(1, 2, 3)).nth(2020)}")
println("2, 3, 1, ... = ${theElves... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day15/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day15.AppKt {\n public static final void main();\n Code:\n 0: new #8 // class java/lang/StringBuilder\n 3: ... |
ascheja__aoc2020__f115063/day14/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day14
import kotlin.properties.Delegates
fun main() {
println(part1InstructionProcessor(readInstructions("testinput.txt")))
println(part1InstructionProcessor(readInstructions("input.txt")))
println(part2InstructionProcessor(readInstructions("testinput2.txt")))
println(part... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day14/AppKt$readInstructions$1$1.class",
"javap": "Compiled from \"App.kt\"\nfinal class net.sinceat.aoc2020.day14.AppKt$readInstructions$1$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.lang.S... |
ascheja__aoc2020__f115063/day13/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day13
fun main() {
run {
val (currentTime, busIds) = readInputPart1("testinput.txt")
val (busId, nextDeparture) = busIds.nextDepartures(currentTime).minByOrNull { (_, nextDeparture) ->
nextDeparture
}!!
println("$busId x ($nextDeparture - $cu... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day13/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day13.AppKt {\n public static final void main();\n Code:\n 0: iconst_0\n 1: istore_0\n 2: ldc #8 // S... |
ascheja__aoc2020__f115063/day9/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day9
import java.util.LinkedList
fun main() {
val testInput = parseInput("testinput.txt")
val testBuffer = RingBuffer.fromSequence(testInput, 5)
println(lookForFirstInvalidNumber(testBuffer, testInput))
val input = parseInput("input.txt")
val invalidNumber = run {
... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day9/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day9.AppKt {\n public static final void main();\n Code:\n 0: ldc #8 // String testinput.txt\n 2: invokestati... |
ascheja__aoc2020__f115063/day16/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day16
import kotlin.properties.Delegates
fun main() {
run {
val parseResult = parseInput("testinput.txt")
println(parseResult.calculateScanningErrorRate())
}
run {
val parseResult = parseInput("input.txt")
println(parseResult.calculateScanningErr... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day16/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day16.AppKt {\n static final kotlin.reflect.KProperty<java.lang.Object>[] $$delegatedProperties;\n\n public static final void main();\n Code:\n ... |
ascheja__aoc2020__f115063/day11/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day11
import kotlin.math.abs
import kotlin.math.sign
import net.sinceat.aoc2020.day11.Part1EvolutionRules.evolveUntilStable
fun main() {
with (Part1EvolutionRules) {
run {
val fullyEvolvedGrid = readGrid("testinput.txt").evolveUntilStable().last()
Grid.c... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day11/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day11.AppKt {\n public static final void main();\n Code:\n 0: getstatic #12 // Field net/sinceat/aoc2020/day11/Part1Evol... |
ascheja__aoc2020__f115063/day10/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day10
fun main() {
println(differences(parseFile("testinput.txt")))
println(differences(parseFile("input.txt")))
println(with(Cached()) { parseFile("testinput.txt").combinations() })
println(
with(Cached()) {
val result = parseFile("input.txt").combinati... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day10/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day10.AppKt {\n public static final void main();\n Code:\n 0: ldc #8 // String testinput.txt\n 2: invokesta... |
ascheja__aoc2020__f115063/day17/src/main/kotlin/App.kt | package net.sinceat.aoc2020.day17
fun main() {
run {
var grid = Grid(readInput("testinput.txt") { x, y -> GridPoint3d(x, y, 0) }, ::drawGrid3d)
(1 .. 6).forEach {
grid = grid.evolve()
}
println(grid.countActive())
println()
}
run {
var grid = Grid... | [
{
"class_path": "ascheja__aoc2020__f115063/net/sinceat/aoc2020/day17/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class net.sinceat.aoc2020.day17.AppKt {\n public static final void main();\n Code:\n 0: iconst_0\n 1: istore_0\n 2: aconst_null\n 3: astore_1\n ... |
markburk__potential-lamp__d28656b/src/main/kotlin/com/mobiento/aoc/Day04.kt | package com.mobiento.aoc
fun Pair<Int, Int>.toSequence(): Set<Int> {
val result = arrayListOf<Int>()
for (x in first .. second) {
result.add(x)
}
return result.toSet()
}
class Day04 {
companion object {
val regex = "(\\d+)-(\\d+),(\\d+)-(\\d+)".toRegex()
}
fun part1(input... | [
{
"class_path": "markburk__potential-lamp__d28656b/com/mobiento/aoc/Day04$Companion.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class com.mobiento.aoc.Day04$Companion {\n private com.mobiento.aoc.Day04$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 //... |
markburk__potential-lamp__d28656b/src/main/kotlin/com/mobiento/aoc/Day02.kt | package com.mobiento.aoc
class Day02 {
fun part1(input: List<String>): Int {
return input.sumOf { line ->
line.split(" ").takeIf { it.size >= 2 }?.let { parts ->
scoreForRoundPart1(parts[0], parts[1])
} ?: 0
}
}
fun scoreForRoundPart1(a: String, b: ... | [
{
"class_path": "markburk__potential-lamp__d28656b/com/mobiento/aoc/Day02$Choice.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class com.mobiento.aoc.Day02$Choice extends java.lang.Enum<com.mobiento.aoc.Day02$Choice> {\n public static final com.mobiento.aoc.Day02$Choice$Companion Companion;\n\... |
markburk__potential-lamp__d28656b/src/main/kotlin/com/mobiento/aoc/Day03.kt | package com.mobiento.aoc
class Day03 {
private val priority: Map<Char, Int> = hashMapOf<Char, Int>().apply {
var priority = 0
for (c in 'a' .. 'z') {
this[c] = ++priority
}
for (c in 'A' .. 'Z') {
this[c] = ++priority
}
}
fun part1(input: Li... | [
{
"class_path": "markburk__potential-lamp__d28656b/com/mobiento/aoc/Day03.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class com.mobiento.aoc.Day03 {\n private final java.util.Map<java.lang.Character, java.lang.Integer> priority;\n\n public com.mobiento.aoc.Day03();\n Code:\n 0: alo... |
Clausr__advent_of_code__dd33c88/src/main/aoc2022/Day12.kt | package aoc2022
import java.util.*
typealias Coordinates = Pair<Int, Int>
private fun Coordinates.getNeighbors(): List<Coordinates> {
val leftOf = Coordinates(first - 1, second)
val rightOf = Coordinates(first + 1, second)
val topOf = Coordinates(first, second - 1)
val bottomOf = Coordinates(first, ... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2022/Day12$PathCost.class",
"javap": "Compiled from \"Day12.kt\"\nfinal class aoc2022.Day12$PathCost implements java.lang.Comparable<aoc2022.Day12$PathCost> {\n private final kotlin.Pair<java.lang.Integer, java.lang.Integer> coordinates;\n\n private fina... |
Clausr__advent_of_code__dd33c88/src/main/aoc2022/Day13.kt | package aoc2022
class Day13(val input: String) {
sealed class Packets : Comparable<Packets> {
data class Single(val value: Int) : Packets()
data class Multi(val packets: List<Packets>) : Packets()
private fun Single.toList() = Multi(listOf(this))
override fun compareTo(other: Pa... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2022/Day13$Packets$Single.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class aoc2022.Day13$Packets$Single extends aoc2022.Day13$Packets {\n private final int value;\n\n public aoc2022.Day13$Packets$Single(int);\n Code:\n 0: aload_0... |
Clausr__advent_of_code__dd33c88/src/main/aoc2022/Day11.kt | package aoc2022
class Day11(input: List<String>) {
private val monkeys = input.parseMonkeys()
fun solvePart1(): Long {
rounds(numRounds = 20) { it / 3 }
return monkeys.business()
}
fun solvePart2(): Long {
val testProduct = monkeys.map { it.test }.reduce(Long::times)
r... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2022/Day11.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class aoc2022.Day11 {\n private final java.util.List<aoc2022.Monkey> monkeys;\n\n public aoc2022.Day11(java.util.List<java.lang.String>);\n Code:\n 0: aload_1\n 1: ldc ... |
Clausr__advent_of_code__dd33c88/src/main/aoc2023/Day02.kt | package aoc2023
class Day02(input: List<String>) {
private val parsedInput = input.map {
val gameId = it.substringBefore(":").split(" ").last().toInt()
println("GameID: $gameId")
val rawThrows = it.substringAfter(": ")
val reveals = rawThrows.split("; ")
val cubesInReveals ... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2023/Day02$Game.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class aoc2023.Day02$Game {\n private final int id;\n\n private final java.util.List<java.util.List<kotlin.Pair<java.lang.Integer, java.lang.String>>> throws;\n\n public aoc2023.D... |
Clausr__advent_of_code__dd33c88/src/main/aoc2023/Day01.kt | package aoc2023
class Day01(val input: List<String>) {
fun solvePart1(): Int {
val sum = input.sumOf {
addFirstAndLastDigit(it)
}
return sum
}
private fun addFirstAndLastDigit(line: String): Int {
val first = line.first { it.isDigit() }
val last = line.l... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2023/Day01.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class aoc2023.Day01 {\n private final java.util.List<java.lang.String> input;\n\n private final java.util.Map<java.lang.String, java.lang.Integer> words;\n\n public aoc2023.Day01(java... |
Clausr__advent_of_code__dd33c88/src/main/aoc2018/Day10.kt | package aoc2018
class Day10(input: List<String>) {
private val lights = input.map(Light::from)
fun solvePart1(): String {
val message = Sky(lights).getMessageWithLeastArea()
println(message.second)
return message.first
}
fun solvePart2(): Int {
val message = Sky(ligh... | [
{
"class_path": "Clausr__advent_of_code__dd33c88/aoc2018/Day10$Light$WhenMappings.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class aoc2018.Day10$Light$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 // ... |
crepppy__coding-challenges__9bcfed8/src/main/kotlin/com/jackchapman/codingchallenges/hackerrank/QueensAttack.kt | package com.jackchapman.codingchallenges.hackerrank
import kotlin.math.abs
/**
* Problem: [Queen's Attack II](https://www.hackerrank.com/challenges/queens-attack-2/)
*
* Given a chess board and a list of obstacles, find the number of valid moves a queen can make
* @param size The size of the chess board
* @param... | [
{
"class_path": "crepppy__coding-challenges__9bcfed8/com/jackchapman/codingchallenges/hackerrank/QueensAttackKt.class",
"javap": "Compiled from \"QueensAttack.kt\"\npublic final class com.jackchapman.codingchallenges.hackerrank.QueensAttackKt {\n public static final int queensAttack(int, int, int, int, int... |
crepppy__coding-challenges__9bcfed8/src/main/kotlin/com/jackchapman/codingchallenges/hackerrank/EmasSupercomputer.kt | package com.jackchapman.codingchallenges.hackerrank
typealias Plus = List<Pair<Int, Int>>
/**
* Problem: [Ema's Supercomputer](https://www.hackerrank.com/challenges/two-pluses/)
*
* Given a matrix of good (`G`) cells and bad (`B`) cells, find 2 pluses made of
* good cells whose area has the greatest product
* @p... | [
{
"class_path": "crepppy__coding-challenges__9bcfed8/com/jackchapman/codingchallenges/hackerrank/EmasSupercomputerKt.class",
"javap": "Compiled from \"EmasSupercomputer.kt\"\npublic final class com.jackchapman.codingchallenges.hackerrank.EmasSupercomputerKt {\n public static final int twoPluses(java.lang.S... |
arryaaas__Matrix-Calculator__393d2e9/app/src/main/java/com/arya/matrixcalculator/logic/InverseOperation.kt | package com.arya.matrixcalculator.logic
object InverseOperation {
// const val N = 3
// Function to get cofactor of A[p][q] in temp[][]. n is current
// dimension of A[][]
private fun getCofactor(A: Array<Array<Float>>, temp: Array<Array<Float>>, p: Int, q: Int, n: Int) {
var i = 0
v... | [
{
"class_path": "arryaaas__Matrix-Calculator__393d2e9/com/arya/matrixcalculator/logic/InverseOperation.class",
"javap": "Compiled from \"InverseOperation.kt\"\npublic final class com.arya.matrixcalculator.logic.InverseOperation {\n public static final com.arya.matrixcalculator.logic.InverseOperation INSTAN... |
PartlyFluked__PASS-android__d2540dc/app/src/main/java/com/example/SecretService/KylesMathPack.kt | package com.example.SecretService
/**
* Created by menta on 29/03/2018.
*/
import java.lang.Math.pow
fun List<Int>.innerProduct(B:List<Int>): Int {
return zip(B)
.map { it.first * it.second }
.sum()
}
fun List<Int>.vandermond(): List<List<Int>> {
return map { xval -> List<Int>(size,... | [
{
"class_path": "PartlyFluked__PASS-android__d2540dc/com/example/SecretService/KylesMathPackKt.class",
"javap": "Compiled from \"KylesMathPack.kt\"\npublic final class com.example.SecretService.KylesMathPackKt {\n public static final int innerProduct(java.util.List<java.lang.Integer>, java.util.List<java.l... |
salamanders__nrsc5-chopper__c19094a/src/main/kotlin/info/benjaminhill/fm/chopper/TimedEvent.kt | package info.benjaminhill.fm.chopper
import java.time.Duration
import java.time.Instant
/**
* A timed event is a pair of "stuff (state) that happened at time (ts)"
* The idea is to keep a collection (ArrayDeque?) of these to record when things first happened.
*/
data class InstantState<T>(
val ts: Instant,
... | [
{
"class_path": "salamanders__nrsc5-chopper__c19094a/info/benjaminhill/fm/chopper/TimedEventKt$sumDurations$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Sequences.kt\"\npublic final class info.benjaminhill.fm.chopper.TimedEventKt$sumDurations$$inlined$groupingBy$1 implements kotlin.collections.G... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/IntegerToRomanK.kt | package name.valery1707.problem.leet.code
/**
* # 12. Integer to Roman
*
* Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
*
* | Symbol | Value |
* |--------|-------|
* | `I` | `1` |
* | `V` | `5` |
* | `X` | `10` |
* | `L` | `50` |
* | `C` | `100` |
* | `D`... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/IntegerToRomanK.class",
"javap": "Compiled from \"IntegerToRomanK.kt\"\npublic interface name.valery1707.problem.leet.code.IntegerToRomanK {\n public abstract java.lang.String intToRoman(int);\n}\n",
"javap_err": ""... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/CanPlaceFlowersK.kt | package name.valery1707.problem.leet.code
import kotlin.math.max
import kotlin.math.roundToInt
/**
* # 605. Can Place Flowers
*
* You have a long flowerbed in which some of the plots are planted, and some are not.
* However, flowers cannot be planted in **adjacent** plots.
*
* Given an integer array `flowerbed`... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/CanPlaceFlowersK$Implementation$regexp$canPlaceFlowers$str$1.class",
"javap": "Compiled from \"CanPlaceFlowersK.kt\"\nfinal class name.valery1707.problem.leet.code.CanPlaceFlowersK$Implementation$regexp$canPlaceFlowers$s... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/FizzBuzzK.kt | package name.valery1707.problem.leet.code
/**
* # 412. Fizz Buzz
*
* Given an integer `n`, return a string array answer (**1-indexed**) where:
* * `answer[i] == "FizzBuzz"` if `i` is divisible by `3` and `5`.
* * `answer[i] == "Fizz"` if `i` is divisible by `3`.
* * `answer[i] == "Buzz"` if `i` is divisible by `... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/FizzBuzzK.class",
"javap": "Compiled from \"FizzBuzzK.kt\"\npublic interface name.valery1707.problem.leet.code.FizzBuzzK {\n public abstract java.util.List<java.lang.String> fizzBuzz(int);\n}\n",
"javap_err": ""
}... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/ConcatenationOfConsecutiveBinaryNumbersK.kt | package name.valery1707.problem.leet.code
import java.math.BigInteger
/**
* # 1680. Concatenation of Consecutive Binary Numbers
*
* Given an integer `n`, return the **decimal value** of the binary string formed by concatenating the binary representations of `1` to `n` in order,
* **modulo** `10^9 + 7`.
*
* ### ... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/ConcatenationOfConsecutiveBinaryNumbersK$Implementation$sumThenModulo_fold.class",
"javap": "Compiled from \"ConcatenationOfConsecutiveBinaryNumbersK.kt\"\nfinal class name.valery1707.problem.leet.code.ConcatenationOfCon... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/BinaryGapK.kt | package name.valery1707.problem.leet.code
import kotlin.math.max
/**
* # 868. Binary Gap
*
* Given a positive integer `n`, find and return the **longest distance** between any two **adjacent** `1`'s in the *binary representation* of `n`.
* If there are no two adjacent `1`'s, return `0`.
*
* Two `1`'s are **adja... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/BinaryGapK.class",
"javap": "Compiled from \"BinaryGapK.kt\"\npublic interface name.valery1707.problem.leet.code.BinaryGapK {\n public abstract int binaryGap(int);\n}\n",
"javap_err": ""
},
{
"class_path": "... |
valery1707__problem-solving__76d175f/src/main/kotlin/name/valery1707/problem/leet/code/RomanToIntegerK.kt | package name.valery1707.problem.leet.code
/**
* # 13. Roman to Integer
*
* Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
*
* | Symbol | Value |
* |--------|-------|
* | `I` | `1` |
* | `V` | `5` |
* | `X` | `10` |
* | `L` | `50` |
* | `C` | `100` |
* | `D`... | [
{
"class_path": "valery1707__problem-solving__76d175f/name/valery1707/problem/leet/code/RomanToIntegerK$Implementation.class",
"javap": "Compiled from \"RomanToIntegerK.kt\"\npublic abstract class name.valery1707.problem.leet.code.RomanToIntegerK$Implementation extends java.lang.Enum<name.valery1707.problem... |
iafsilva__codility-lessons__5d86aef/src/main/kotlin/lesson3/FrogJmp.kt | package lesson3
/**
* A small frog wants to get to the other side of the road.
*
* The frog is currently located at position X and wants to get to a position greater than or equal to Y.
*
* The small frog always jumps a fixed distance, D.
*
* Count the minimal number of jumps that the small frog must perform to... | [
{
"class_path": "iafsilva__codility-lessons__5d86aef/lesson3/FrogJmp.class",
"javap": "Compiled from \"FrogJmp.kt\"\npublic final class lesson3.FrogJmp {\n public lesson3.FrogJmp();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
iafsilva__codility-lessons__5d86aef/src/main/kotlin/lesson3/PermMissingElem.kt | package lesson3
/**
* An array A consisting of N different integers is given.
*
* The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing.
*
* Your goal is to find that missing element.
*
* Write a function:
*
* fun solution(A: IntArray): Int
*
* that, give... | [
{
"class_path": "iafsilva__codility-lessons__5d86aef/lesson3/PermMissingElem.class",
"javap": "Compiled from \"PermMissingElem.kt\"\npublic final class lesson3.PermMissingElem {\n public lesson3.PermMissingElem();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lan... |
iafsilva__codility-lessons__5d86aef/src/main/kotlin/lesson2/CyclicRotation.kt | package lesson2
/**
* An array A consisting of N integers is given.
*
* Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place.
*
* For example, the rotation of array A = [[3, 8, 9, 7, 6]] is [[6, 3, 8, 9, 7]] (elements are shifte... | [
{
"class_path": "iafsilva__codility-lessons__5d86aef/lesson2/CyclicRotation.class",
"javap": "Compiled from \"CyclicRotation.kt\"\npublic final class lesson2.CyclicRotation {\n public lesson2.CyclicRotation();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Ob... |
iafsilva__codility-lessons__5d86aef/src/main/kotlin/lesson2/OddOccurrencesInArray.kt | package lesson2
/**
* A non-empty array A consisting of N integers is given.
* The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired.
*
* For example, in array A such that:
* ```
* A[0... | [
{
"class_path": "iafsilva__codility-lessons__5d86aef/lesson2/OddOccurrencesInArray.class",
"javap": "Compiled from \"OddOccurrencesInArray.kt\"\npublic final class lesson2.OddOccurrencesInArray {\n public lesson2.OddOccurrencesInArray();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
iafsilva__codility-lessons__5d86aef/src/main/kotlin/lesson1/BinaryGap.kt | package lesson1
/**
* A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.
*
* For example:
* - The number 9 has binary representation 1001 and contains a binary gap of length 2.
* - The number 529 has bina... | [
{
"class_path": "iafsilva__codility-lessons__5d86aef/lesson1/BinaryGap.class",
"javap": "Compiled from \"BinaryGap.kt\"\npublic final class lesson1.BinaryGap {\n public lesson1.BinaryGap();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\... |
cweckerl__aoc__612badf/src/d09/Main.kt | package d09
import java.io.File
import kotlin.math.pow
import kotlin.math.sqrt
fun main() {
fun dist(p1: Pair<Int, Int>, p2: Pair<Int, Int>) = sqrt(
(p1.first - p2.first).toDouble().pow(2) +
(p1.second - p2.second).toDouble().pow(2)
)
fun part1(input: List<String>) {
var ... | [
{
"class_path": "cweckerl__aoc__612badf/d09/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class d09.MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 // Str... |
cweckerl__aoc__612badf/src/d07/Main.kt | package d07
import java.io.File
fun main() {
data class Trie(
val dir: String,
val children: MutableMap<String, Trie> = mutableMapOf(),
val parent: Trie? = null,
var dirSize: Long = 0L
)
// combining parts for this day
val input = File("src/d07/input").readLines()
... | [
{
"class_path": "cweckerl__aoc__612badf/d07/MainKt$main$Trie.class",
"javap": "Compiled from \"Main.kt\"\npublic final class d07.MainKt$main$Trie {\n private final java.lang.String dir;\n\n private final java.util.Map<java.lang.String, d07.MainKt$main$Trie> children;\n\n private final d07.MainKt$main$Tri... |
cweckerl__aoc__612badf/src/d08/Main.kt | package d08
import java.io.File
fun main() {
fun part1(input: List<String>) {
var trees = 0
val visited = mutableMapOf<Int, Char>()
for (i in input.indices) {
for (j in input[0].indices) {
if (i == 0 || i == input.size - 1 || j == 0 || j == input[0].length - 1... | [
{
"class_path": "cweckerl__aoc__612badf/d08/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class d08.MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 // Str... |
cweckerl__aoc__612badf/src/d05/Main.kt | package d05
import java.io.File
import java.util.LinkedList
fun main() {
fun part1(input: List<String>) {
val (a, b) = input.partition { !Regex("""move \d+ from \d+ to \d+""").matches(it) }
val crates = mutableMapOf<Int, LinkedList<Char>>()
a.forEach { line ->
line.forEachInd... | [
{
"class_path": "cweckerl__aoc__612badf/d05/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class d05.MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 // Str... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day4/Main.kt | package pl.klemba.aoc.day4
import java.io.File
import kotlin.math.pow
fun main() {
// ----- PART 1 -----
File(inputPath)
.readLines()
.sumOf { card -> getNumberOfPointsForCard(card) }
.let { println(it) }
// ----- PART 2 -----
val cardList = File(inputPath)
.readLines()
val amountOfScratch... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day4/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day4.MainKt {\n private static final kotlin.text.Regex winningNumbersRegex;\n\n private static final kotlin.text.Regex numbersYouHaveRegex;\n\n priva... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day3/Main.kt | package pl.klemba.aoc.day3
import java.io.File
fun main() {
// ----- PART 1 -----
File(inputPath)
.readLines()
.let { schematic ->
schematic.mapIndexed { lineIndex, line ->
numberRegex.findAll(line)
.filter { schematic.checkIfAdjacentToASymbol(it.range, lineIndex) }
.map ... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day3/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day3.MainKt {\n private static final java.lang.String inputPath;\n\n private static final kotlin.text.Regex numberRegex;\n\n private static final kot... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day2/Main.kt | package pl.klemba.aoc.day2
import java.io.File
fun main() {
// ----- PART 1 -----
File(inputPath)
.readLines()
.foldIndexed(0) { index, acc, line -> if (line.meetsRequirements) acc + index + 1 else acc }
.let { println(it) }
// ----- PART 2 -----
File(inputPath)
.readLines()
.map { it.max... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day2/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day2.MainKt {\n private static final kotlin.text.Regex redRegex;\n\n private static final kotlin.text.Regex greenRegex;\n\n private static final kotl... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day5/Main.kt | package pl.klemba.aoc.day5
import java.io.File
fun main() {
// ----- PART 1 -----
val almanac = File(inputPath)
.readLines()
val seeds: List<Long> = getSeeds(almanac)
println("Seeds: $seeds")
val mappings = getMappings(almanac)
mappings
.forEach { println(it) }
seeds
.map { seed -> seed.m... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day5/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day5.MainKt {\n private static final kotlin.text.Regex numberRegex;\n\n private static final kotlin.text.Regex mappingLineRegex;\n\n private static f... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day1/Main.kt | package pl.klemba.aoc.day1
import java.io.File
fun main2() {
// ----- PART 1 -----
File(inputPath)
.readLines()
.map { extractCalibrationValue(it) }
.reduce { accumulator, calibrationValue -> accumulator + calibrationValue }
.let { println(it) }
// ----- PART 2 -----
File(inputPath)
.read... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day1/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day1.MainKt {\n private static final java.lang.String inputPath;\n\n private static final java.util.Map<java.lang.String, java.lang.Integer> digitName... |
aklemba__adventOfCode2023__2432d30/src/main/kotlin/pl/klemba/aoc/day10/Main.kt | package pl.klemba.aoc.day10
import java.io.File
fun main() {
// ----- PART 1 -----
val pipeField = File(inputPath)
.readLines()
// Find starting point
val startingIndex: Coordinates = pipeField.findStartingIndex()
println("Starting index: ${startingIndex}")
// Find one of the pipes that create the l... | [
{
"class_path": "aklemba__adventOfCode2023__2432d30/pl/klemba/aoc/day10/MainKt$WhenMappings.class",
"javap": "Compiled from \"Main.kt\"\npublic final class pl.klemba.aoc.day10.MainKt$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 ... |
greyovo__PicQuery__4c95be2/app/src/main/java/me/grey/picquery/common/Algorithm.kt | package me.grey.picquery.common
import kotlin.math.acos
import kotlin.math.asin
import kotlin.math.pow
import kotlin.math.sqrt
fun calculateSimilarity(vectorA: FloatArray, vectorB: FloatArray): Double {
var dotProduct = 0.0
var normA = 0.0
var normB = 0.0
for (i in vectorA.indices) {
dotProdu... | [
{
"class_path": "greyovo__PicQuery__4c95be2/me/grey/picquery/common/AlgorithmKt.class",
"javap": "Compiled from \"Algorithm.kt\"\npublic final class me.grey.picquery.common.AlgorithmKt {\n public static final double calculateSimilarity(float[], float[]);\n Code:\n 0: aload_0\n 1: ldc ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day24ElectromagneticMoat.kt | package adventofcode2017
class Day24ElectromagneticMoat
data class Port(val sideA: Int, val sideB: Int) {
val strength: Int
get() = sideA + sideB
}
class Bridge(val ports: List<Port> = listOf()) {
fun totalStrength(): Int = ports.sumOf { it.strength }
val totalLength: Int = ports.size
overr... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day24ElectromagneticMoat.class",
"javap": "Compiled from \"Day24ElectromagneticMoat.kt\"\npublic final class adventofcode2017.Day24ElectromagneticMoat {\n public adventofcode2017.Day24ElectromagneticMoat();\n Code:\n 0: al... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day03SpiralMemory.kt | package adventofcode2017
import adventofcode2017.Direction.*
import kotlin.math.absoluteValue
class Day03SpiralMemory
data class Coordinate(val x: Int, val y: Int)
enum class Direction {
RIGHT,
LEFT,
UP,
DOWN
}
class SpiralMemory(private val input: Int = 1) {
private val memory = mutableMapOf<I... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day03SpiralMemory.class",
"javap": "Compiled from \"Day03SpiralMemory.kt\"\npublic final class adventofcode2017.Day03SpiralMemory {\n public adventofcode2017.Day03SpiralMemory();\n Code:\n 0: aload_0\n 1: invokespeci... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day25TheHaltingProblem.kt | package adventofcode2017
class Day25TheHaltingProblem
data class StateResult(val writeValue: Int, val nextDirection: Int, val nextState: TuringState)
data class StateRule(val ruleOnNull: StateResult, val ruleOnOne: StateResult)
sealed class TuringState {
object A : TuringState()
object B : TuringState()
... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day25TheHaltingProblem.class",
"javap": "Compiled from \"Day25TheHaltingProblem.kt\"\npublic final class adventofcode2017.Day25TheHaltingProblem {\n public adventofcode2017.Day25TheHaltingProblem();\n Code:\n 0: aload_0\n ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day07RecursiveCircus.kt | package adventofcode2017
class Day07RecursiveCircus
data class RCProgram(val name: String, val weight: Int, val dependants: List<String>)
data class WeightedChild(
val name: String,
val parent: String,
val weight: Int,
val dependants: List<String>,
val dependantsWeight: Int
)
class RCTower(val p... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day07RecursiveCircus.class",
"javap": "Compiled from \"Day07RecursiveCircus.kt\"\npublic final class adventofcode2017.Day07RecursiveCircus {\n public adventofcode2017.Day07RecursiveCircus();\n Code:\n 0: aload_0\n 1:... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day08LikeRegisters.kt | package adventofcode2017
import adventofcode2017.Comparator.*
import adventofcode2017.RegisterOperation.*
class Day08LikeRegisters
enum class RegisterOperation {
INC, DEC
}
enum class Comparator {
LT, LET, EQ, NE, GET, GT
}
data class Register(val name: String, var value: Int = 0) {
fun inc(incValue: I... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day08LikeRegisters.class",
"javap": "Compiled from \"Day08LikeRegisters.kt\"\npublic final class adventofcode2017.Day08LikeRegisters {\n public adventofcode2017.Day08LikeRegisters();\n Code:\n 0: aload_0\n 1: invokes... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2017/Day21FractalArt.kt | package adventofcode2017
class Day21FractalArt
data class FractalRule(val original: String, val transformed: String)
class FractalArt(ruleLines: List<String>) {
val rules: List<FractalRule>
val fractals: MutableList<Fractal> = mutableListOf()
val activePixels: Int
get() = fractals.sumOf { it.acti... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2017/Day21FractalArt.class",
"javap": "Compiled from \"Day21FractalArt.kt\"\npublic final class adventofcode2017.Day21FractalArt {\n public adventofcode2017.Day21FractalArt();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2019/Day06UniversalOrbitMap.kt | package adventofcode2019
class Day06UniversalOrbitMap
data class OrbitObject(val code: String)
data class Orbit(val center: OrbitObject, val satelite: OrbitObject)
class SpaceOrbit(val orbitMap: List<String>) {
val orbits: List<Orbit>
init {
orbits = orbitMap.map {
val (center, satelite... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2019/Day06UniversalOrbitMap.class",
"javap": "Compiled from \"Day06UniversalOrbitMap.kt\"\npublic final class adventofcode2019.Day06UniversalOrbitMap {\n public adventofcode2019.Day06UniversalOrbitMap();\n Code:\n 0: aload_0\n ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2019/Day03CrossedWires.kt | package adventofcode2019
import kotlin.math.abs
class Day03CrossedWires
data class DistanceCoordinate(
val distance: Int,
val coordinate: Pair<Int, Int>
)
data class GravityWire(val coordinates: List<Pair<Int, Int>> = emptyList()) {
val distanceCoordinates = mutableListOf<DistanceCoordinate>()
fun ... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2019/Day03CrossedWires.class",
"javap": "Compiled from \"Day03CrossedWires.kt\"\npublic final class adventofcode2019.Day03CrossedWires {\n public adventofcode2019.Day03CrossedWires();\n Code:\n 0: aload_0\n 1: invokespeci... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2019/Day10MonitoringStation.kt | package adventofcode2019
import java.lang.Math.toDegrees
import kotlin.math.abs
import kotlin.math.atan2
class Day10MonitoringStation
data class Asteroid(
val x: Int,
val y: Int,
var isVaborized: Boolean = false
)
class Ceres(map: List<String>) {
val asteroids: List<Asteroid>
init {
ast... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2019/Day10MonitoringStation.class",
"javap": "Compiled from \"Day10MonitoringStation.kt\"\npublic final class adventofcode2019.Day10MonitoringStation {\n public adventofcode2019.Day10MonitoringStation();\n Code:\n 0: aload_0\n ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2019/Day12TheNbodyProblem.kt | package adventofcode2019
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.sqrt
class Day12TheNbodyProblem
data class MoonVelocity(var x: Int, var y: Int, var z: Int) {
val kineticEnergy: Int
get() = abs(x) + abs(y) + abs(z)
}
data class JupiterMoon(val id: Int, var x: Int, var y: Int, va... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2019/Day12TheNbodyProblem.class",
"javap": "Compiled from \"Day12TheNbodyProblem.kt\"\npublic final class adventofcode2019.Day12TheNbodyProblem {\n public adventofcode2019.Day12TheNbodyProblem();\n Code:\n 0: aload_0\n 1:... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.