kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day11/Day11.kt | package day11
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day11/Day11.txt")
val answer1 = part1(data.toMutableList())
val answer2 = part2(data.toMutableList())
println("🎄 Day 11 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
p... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day11/Day11Kt.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class day11.Day11Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day11/Day11.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day10/Day10.kt | package day10
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day10/Day10.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 10 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day10/Day10Kt.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class day10.Day10Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day10/Day10.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day17/Day17.kt | package day17
import java.io.File
import kotlin.math.abs
import kotlin.math.max
fun main() {
val data = parse("src/main/kotlin/day17/Day17.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 17 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
pr... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day17/Day17Kt.class",
"javap": "Compiled from \"Day17.kt\"\npublic final class day17.Day17Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day17/Day17.txt\n 2: invokestati... |
iproduct__course-kotlin__89884f8/07-functions-lambdas/src/main/kotlin/lambdas.kt | package course.kotlin.functions
fun <T> max(collection: Collection<T>, comparatorFn: (T, T) -> Int): T? {
var maxElem: T? = null
for (e in collection) {
if (maxElem == null) {
maxElem = e
} else if (e != null && comparatorFn(e, maxElem) > 0)
maxElem = e
}
return ... | [
{
"class_path": "iproduct__course-kotlin__89884f8/course/kotlin/functions/LambdasKt$main$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class course.kotlin.functions.LambdasKt$main$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public course.kotlin.function... |
PacktPublishing__Kotlin-Quick-Start-Guide__5c781d2/Chapter06/KotlinCollectionsApi.kt | package quickstartguide.kotlin.chapter5
fun filterEvensThenSquare(numbers: Collection<Int>) {
val result: List<String> = numbers.filter { n -> n % 2 == 0 }
.map { n -> n * n }
.sorted()
.takeWhile { n -> n < 1000 }
.map { n -> n.toString() }
}
// FILTERING
fun drop... | [
{
"class_path": "PacktPublishing__Kotlin-Quick-Start-Guide__5c781d2/quickstartguide/kotlin/chapter5/KotlinCollectionsApiKt.class",
"javap": "Compiled from \"KotlinCollectionsApi.kt\"\npublic final class quickstartguide.kotlin.chapter5.KotlinCollectionsApiKt {\n public static final void filterEvensThenSquar... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day09/Solution.kt | package day09
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
val dx = arrayOf(0, 1, 0, -1)
val dy = arrayOf(-1, 0, 1, 0)
fun part1(lines: Input): Int {
var answer = 0
for (x in lines.indices) {
outer@for (y in lines[x].indices) {
for (d in 0 until 4) {
val xx ... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day09/SolutionKt$main$part2$DSU.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day09.SolutionKt$main$part2$DSU {\n private final int[] parent;\n\n private final int[] size;\n\n public day09.SolutionKt$main$part2$DSU(int);\n Co... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day08/Solution.kt | package day08
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(lines: Input): Int {
return lines.sumOf { entry ->
val (_, reading) = entry.split("|")
reading.split(" ")
.filter { it.isNotBlank() }
.count { it.length in setOf(2, 3, 4, 7) }
}
}
fun ... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day08/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day08.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day06/Solution.kt | package day06
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
val mem = Array(2) {
Array(9) {
LongArray(257) { -1 }
}
}
fun model(daysLeft: Int, day: Int, part: Int): Long {
require(daysLeft in 0..8)
require(part in 0..1)
val lastDay = if (part == 0) 80 else 256
r... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day06/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day06.SolutionKt {\n public static final void main();\n Code:\n 0: iconst_0\n 1: istore_1\n 2: iconst_2\n 3: anewarray #8 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day23/Solution.kt | package day23
import java.nio.file.Files
import java.nio.file.Paths
import java.util.TreeSet
import kotlin.math.absoluteValue
import kotlin.system.measureTimeMillis
fun main() {
val amphipods = "ABCD"
val step = listOf(1, 10, 100, 1000)
val rooms = listOf(3, 5, 7, 9)
fun Input.isFinal(): Boolean {
for (i... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day23/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day23.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String ABCD\n 2: astore_0\n 3: iconst_4\n ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day24/Solution.kt | package day24
import java.nio.file.Files
import java.nio.file.Paths
import java.util.TreeMap
import kotlin.system.measureTimeMillis
fun main() {
fun Char.registerId() = code - 'w'.code
val alu = longArrayOf(0, 0, 0, 0)
var nextInput = -1
fun String.parseCommand(): Command {
return if (startsWith("inp ")... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day24/SolutionKt$main$solve$2.class",
"javap": "Compiled from \"Solution.kt\"\nfinal class day24.SolutionKt$main$solve$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function2<day24.SolutionKt$main$solve$State, day24... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day12/Solution.kt | package day12
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun buildGraph(lines: Input): Map<String, List<String>> = buildMap<String, MutableList<String>> {
for (line in lines) {
val (v, w) = line.split("-")
val vList = getOrPut(v) { mutableListOf() }
val wList = getOrPut... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day12/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day12.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day15/Solution.kt | package day15
import java.nio.file.Files
import java.nio.file.Paths
import java.util.TreeSet
import kotlin.system.measureTimeMillis
fun main() {
fun part1(input: Input): Int {
val costs = Array(input.size) {
IntArray(input[it].size) { Int.MAX_VALUE }
}
val priorityQueue = TreeSet(
Comparator... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day15/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day15.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day14/Solution.kt | package day14
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(input: Input): Int {
fun iterate(template: String, rules: Map<String, String>) = buildString {
append(template[0])
for (i in 1 until template.length) {
rules[template.substring(i - 1, i + 1)]?.let {
... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day14/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day14.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day13/Solution.kt | package day13
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun log(field: Array<BooleanArray>) = buildString {
for (y in field[0].indices) {
for (x in field.indices) {
append(if (field[x][y]) '#' else '.')
}
append('\n')
}
}.let { System.err.println(it) }
... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day13/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day13.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day25/Solution.kt | package day25
import java.nio.file.Files
import java.nio.file.Paths
import kotlin.system.measureTimeMillis
fun main() {
fun part1(input: Input): Int {
val field = input.map { it.toCharArray() }
var moves = 0
val herds = ">v"
val di = intArrayOf(0, 1)
val dj = intArrayOf(1, 0)
val moved = arr... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day25/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day25.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day22/Solution.kt | package day22
import java.nio.file.Files
import java.nio.file.Paths
import kotlin.system.measureTimeMillis
fun main() {
fun MutableList<Int>.inPlaceDistinct() {
sort()
var ptr = 1
for (i in 1 until this.size) {
if (this[i] != this[i - 1]) {
this[ptr++] = this[i]
}
}
while (si... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day22/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day22.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day04/Solution.kt | package day04
import java.io.BufferedReader
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun solveBoard(board: Board, sequence: List<Int>): Pair<Int, Int> {
val rows = IntArray(5) { 5 }
val cols = IntArray(5) { 5 }
var sum = board.sumOf { it.sum() }
for ((index, number) in sequ... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day04/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day04.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day03/Solution.kt | package day03
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(numbers: List<String>): Int {
val count = IntArray(numbers[0].length)
for (num in numbers) {
for ((index, bit) in num.withIndex()) {
count[index] += if (bit == '1') 1 else 0
}
}
val gamma =... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day03/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day03.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day05/Solution.kt | package day05
import java.nio.file.Files
import java.nio.file.Paths
import kotlin.math.sign
fun main() {
fun part1(lines: List<Line>): Int {
val maxX = lines.maxOf { maxOf(it.first.first, it.second.first) }
val maxY = lines.maxOf { maxOf(it.first.second, it.second.second) }
val map = Array(maxX + 1) {
... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day05/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day05.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day18/Solution.kt | package day18
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(input: Input): Int {
return input.reduce { acc, snailfish ->
SnailfishPair(acc, snailfish).reduce()
}.magnitude()
}
fun part2(input: Input): Int {
return input.maxOf { lhs ->
input.maxOf { rhs ->
... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day18/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day18.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day20/Solution.kt | package day20
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun wrap(field: List<String>, surrounding: Char = '.'): List<String> {
val length = field.first().length
val darkRow = buildString(length) { repeat(length) { append(surrounding) } }
val fix = List(3) { darkRow }
return ... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day20/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day20.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day16/Solution.kt | package day16
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(input: Input): Int {
fun dfs(packet: Packet): Int {
var sum = packet.version
if (packet is Operation) {
for (subPacket in packet.subPackets) {
sum += dfs(subPacket)
}
}
re... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day16/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day16.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String D2FE28\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day11/Solution.kt | package day11
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun iterate(octopuses: Input): Int {
var flashes = 0
val queue = mutableListOf<Pair<Int, Int>>()
val flashed = Array(octopuses.size) { BooleanArray(octopuses[it].size) }
for ((i, row) in octopuses.withIndex()) {
f... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day11/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day11.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day10/Solution.kt | package day10
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
val matching = mapOf(
'(' to ')',
'[' to ']',
'{' to '}',
'<' to '>',
)
fun part1(lines: Input): Int {
val points = mapOf(
')' to 3,
']' to 57,
'}' to 1197,
'>' to 25137,
)
retur... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day10/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day10.SolutionKt {\n public static final void main();\n Code:\n 0: iconst_4\n 1: anewarray #8 // class kotlin/Pair\n 4: astor... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day17/Solution.kt | package day17
import java.nio.file.Files
import java.nio.file.Paths
import kotlin.math.absoluteValue
import kotlin.math.sign
fun main() {
fun part1(input: Input): Int {
val (xRange, yRange) = input.toList().map { it.first..it.second }
require(xRange.first > 0 && xRange.last >= xRange.first)
require(yRan... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day17/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day17.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day21/Solution.kt | package day21
import java.nio.file.Files
import java.nio.file.Paths
fun main() {
fun part1(input: Input): Int {
var rolled = 0
val score = intArrayOf(0, 0)
val position = input.map { it - 1 }.toIntArray()
var current = 0
while (score.all { it < 1000 }) {
var move = 0
repeat(3) {
... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day21/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day21.SolutionKt {\n public static final void main();\n Code:\n 0: ldc #8 // String test-input.txt\n 2: invokestatic #12 ... |
vadimsemenov__advent-of-code__8f31d39/2021/src/day19/Solution.kt | package day19
import java.nio.file.Files
import java.nio.file.Paths
import kotlin.math.absoluteValue
import kotlin.system.measureTimeMillis
fun main() {
val rotations = createRotations()
fun fullMap(input: Input): MutableList<Pair<Point, List<Point>>> {
val fixed = mutableListOf(Point(0, 0, 0) to input.first... | [
{
"class_path": "vadimsemenov__advent-of-code__8f31d39/day19/SolutionKt.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day19.SolutionKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method createRotations:()Ljava/util/List;\n 3: a... |
amedee__adventofcode__02e8e07/src/main/kotlin/be/amedee/adventofcode/aoc2015/day01/Day01.kt | package be.amedee.adventofcode.aoc2015.day01
import java.io.BufferedReader
import java.io.InputStreamReader
/**
* Single move to the next floor, up or down.
*
* @return do we go up or down
*/
fun move(): (String) -> Int =
{
when (it) {
"(" -> 1
")" -> -1
else -> 0
... | [
{
"class_path": "amedee__adventofcode__02e8e07/be/amedee/adventofcode/aoc2015/day01/Day01.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class be.amedee.adventofcode.aoc2015.day01.Day01 {\n public be.amedee.adventofcode.aoc2015.day01.Day01();\n Code:\n 0: aload_0\n 1: invokespeci... |
amedee__adventofcode__02e8e07/src/main/kotlin/be/amedee/adventofcode/aoc2015/day02/Day02.kt | package be.amedee.adventofcode.aoc2015.day02
import java.io.BufferedReader
import java.io.InputStreamReader
fun getSurfaceArea(
length: Int,
width: Int,
height: Int,
) = 2 * ((length * width) + (width * height) + (height * length))
fun getSlack(
length: Int,
width: Int,
height: Int,
) = minOf... | [
{
"class_path": "amedee__adventofcode__02e8e07/be/amedee/adventofcode/aoc2015/day02/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class be.amedee.adventofcode.aoc2015.day02.Day02Kt {\n public static final int getSurfaceArea(int, int, int);\n Code:\n 0: iconst_2\n 1: iloa... |
SeanShubin__factor-analysis__a0ae7f3/ratio/src/main/kotlin/com/seanshubin/factor/analysis/ratio/Ratio.kt | package com.seanshubin.factor.analysis.ratio
data class Ratio(val numerator: Int, val denominator: Int) : Comparable<Ratio> {
init {
require(denominator != 0){
"Denominator must not be zero in $numerator/$denominator"
}
}
operator fun plus(that: Ratio): Ratio {
val lcm =... | [
{
"class_path": "SeanShubin__factor-analysis__a0ae7f3/com/seanshubin/factor/analysis/ratio/Ratio.class",
"javap": "Compiled from \"Ratio.kt\"\npublic final class com.seanshubin.factor.analysis.ratio.Ratio implements java.lang.Comparable<com.seanshubin.factor.analysis.ratio.Ratio> {\n public static final co... |
joseluisgs__Kotlin-NumericMatrixProcessor__b0d49e4/src/main/kotlin/processor/Matrix.kt | package processor
import kotlin.system.exitProcess
fun main() {
doMenuActions()
}
/**
* Menu and Actions
* @param data List of data
* @param index Index of data
*/
private fun doMenuActions() {
do {
val menu = readMenuOption()
when (menu) {
0 -> exit()
1 -> addMatr... | [
{
"class_path": "joseluisgs__Kotlin-NumericMatrixProcessor__b0d49e4/processor/MatrixKt.class",
"javap": "Compiled from \"Matrix.kt\"\npublic final class processor.MatrixKt {\n public static final void main();\n Code:\n 0: invokestatic #9 // Method doMenuActions:()V\n 3: ret... |
chengw315__daily-study__501b881/letcode/src/main/java/daily/LeetCode154.kt | package daily
fun main() {
val solution = Solution154()
//1
val array = solution.minArray(intArrayOf(3, 4, 5, 1, 2))
//1
val array1 = solution.minArray(intArrayOf(1, 2, 3, 4, 5))
//5
val array2 = solution.minArray(intArrayOf(5, 15, 5, 5, 5))
//4
val array4 = solution.minArray(intArr... | [
{
"class_path": "chengw315__daily-study__501b881/daily/LeetCode154Kt.class",
"javap": "Compiled from \"LeetCode154.kt\"\npublic final class daily.LeetCode154Kt {\n public static final void main();\n Code:\n 0: new #8 // class daily/Solution154\n 3: dup\n 4: i... |
chengw315__daily-study__501b881/letcode/src/main/java/daily/LeetCodeLCP13.kt | package daily
import java.util.*
fun main() {
//16
val i = SolutionLCP13().minimalSteps(arrayOf("S#O", "M..", "M.T"));
//-1
val i1 = SolutionLCP13().minimalSteps(arrayOf("S#O", "M.#", "M.T"));
//17
val i2 = SolutionLCP13().minimalSteps(arrayOf("S#O", "M.T", "M.."));
}
class SolutionLCP13 {
... | [
{
"class_path": "chengw315__daily-study__501b881/daily/LeetCodeLCP13Kt.class",
"javap": "Compiled from \"LeetCodeLCP13.kt\"\npublic final class daily.LeetCodeLCP13Kt {\n public static final void main();\n Code:\n 0: new #8 // class daily/SolutionLCP13\n 3: dup\n ... |
chengw315__daily-study__501b881/letcode/src/main/java/daily/LeetCode167.kt | package daily
fun main() {
val solution = Solution167()
//4,5
val twoSum4 = solution.twoSum(intArrayOf(1,2,3,4,4,8,9,75), 8)
//2,3
val twoSum3 = solution.twoSum(intArrayOf(5,25,75), 100)
//1，2
val twoSum = solution.twoSum(intArrayOf(2, 7, 11, 15), 9)
//1,5
val twoSum2 = solution.two... | [
{
"class_path": "chengw315__daily-study__501b881/daily/LeetCode167Kt.class",
"javap": "Compiled from \"LeetCode167.kt\"\npublic final class daily.LeetCode167Kt {\n public static final void main();\n Code:\n 0: new #8 // class daily/Solution167\n 3: dup\n 4: i... |
chengw315__daily-study__501b881/letcode/src/main/java/daily/LeetCode309.kt | package daily
fun main() {
val solution = Solution309()
//10
val i8 = solution.maxProfit(intArrayOf(8,6,4,3,3,2,3,5,8,3,8,2,6))
//13
val i7 = solution.maxProfit(intArrayOf(1,7,2,4,11))
//6
val i4 = solution.maxProfit(intArrayOf(3, 3, 5, 0, 0, 3, 1, 4))
//3
val i = solution.maxProfit... | [
{
"class_path": "chengw315__daily-study__501b881/daily/LeetCode309Kt.class",
"javap": "Compiled from \"LeetCode309.kt\"\npublic final class daily.LeetCode309Kt {\n public static final void main();\n Code:\n 0: new #8 // class daily/Solution309\n 3: dup\n 4: i... |
chengw315__daily-study__501b881/letcode/src/main/java/daily/LeetCode10.kt | package letcode10
fun main() {
val solution = Solution10()
//false
val match9 = solution.isMatch("aaa", "aaaa")
//true
val match8 = solution.isMatch("ab", ".*..")
//true
val match7 = solution.isMatch("aab", "c*a*b*")
//false
val match = solution.isMatch("aa", "a")
//true
val... | [
{
"class_path": "chengw315__daily-study__501b881/letcode10/LeetCode10Kt.class",
"javap": "Compiled from \"LeetCode10.kt\"\npublic final class letcode10.LeetCode10Kt {\n public static final void main();\n Code:\n 0: new #8 // class letcode10/Solution10\n 3: dup\n ... |
mantono__linear-regression__0c7cb0f/src/main/kotlin/com/mantono/lingress/Spread.kt | package com.mantono.lingress
fun median(c: Collection<Number>): Double = c.asSequence().median()
fun mean(c: Collection<Number>): Double = c.map { it.toDouble() }.average()
fun range(c: Collection<Number>): Double = c.asSequence().range()
fun variance(c: Collection<Number>): Double = c.asSequence().variance()
fun stan... | [
{
"class_path": "mantono__linear-regression__0c7cb0f/com/mantono/lingress/SpreadKt.class",
"javap": "Compiled from \"Spread.kt\"\npublic final class com.mantono.lingress.SpreadKt {\n public static final double median(java.util.Collection<? extends java.lang.Number>);\n Code:\n 0: aload_0\n 1... |
mantono__linear-regression__0c7cb0f/src/main/kotlin/com/mantono/lingress/Regression.kt | package com.mantono.lingress
data class RegressionLine(val m: Double, val b: Double)
{
fun y(x: Double): Double = m*x+b
fun x(y: Double): Double = (y-b)/m
operator fun get(x: Double): Double = y(x)
override fun toString(): String = "y = $m * x + $b"
}
data class Point(val x: Double, val y: Double)
{
constructor(... | [
{
"class_path": "mantono__linear-regression__0c7cb0f/com/mantono/lingress/RegressionKt.class",
"javap": "Compiled from \"Regression.kt\"\npublic final class com.mantono.lingress.RegressionKt {\n public static final double residual(com.mantono.lingress.RegressionLine, com.mantono.lingress.Point);\n Code:... |
skipoleschris__event-modeller__4e7fe75/src/main/kotlin/uk/co/skipoles/eventmodeller/visualisation/render/CenteredMultiLineStringRenderer.kt | package uk.co.skipoles.eventmodeller.visualisation.render
import java.awt.Graphics2D
import java.awt.geom.Rectangle2D
internal fun Graphics2D.drawCentredMultiLineString(
s: String,
x: Int,
y: Int,
width: Int,
height: Int
) {
val lines = divideIntoLines("", s, width, areaForString(this))
val li... | [
{
"class_path": "skipoleschris__event-modeller__4e7fe75/uk/co/skipoles/eventmodeller/visualisation/render/CenteredMultiLineStringRendererKt.class",
"javap": "Compiled from \"CenteredMultiLineStringRenderer.kt\"\npublic final class uk.co.skipoles.eventmodeller.visualisation.render.CenteredMultiLineStringRend... |
jabrena__functional-rosetta-stone__c722696/problems/src/main/kotlin/org/fundamentals/fp/euler/EulerProblem03.kt | package org.fundamentals.fp.euler
/**
* Largest prime factor
* https://projecteuler.net/problem=3
*
* The prime factors of 13195 are 5, 7, 13 and 29.
*
* What is the largest prime factor of the number 600851475143 ?
*
* Scenario 13195
*
* Given primeFactor
* When 13195
* Then 29 [5, 7, 13, 29]
*
* Scenar... | [
{
"class_path": "jabrena__functional-rosetta-stone__c722696/org/fundamentals/fp/euler/EulerProblem03Kt.class",
"javap": "Compiled from \"EulerProblem03.kt\"\npublic final class org.fundamentals.fp.euler.EulerProblem03Kt {\n public static final long KotlinSolution03(long);\n Code:\n 0: lload_0\n ... |
vamsitallapudi__HackerEarth__9349fa7/src/main/algorithms/searching/IceCreamParlour.kt | package main.algorithms.searching
import java.util.*
import kotlin.collections.*
import kotlin.ranges.*
import kotlin.text.*
// Complete the whatFlavors function below.
fun whatFlavors(menu: Array<Int>, money: Int): Array<Int>? {
val sortedMenu = menu.clone()
Arrays.sort(sortedMenu)
for ( i in 0 until ... | [
{
"class_path": "vamsitallapudi__HackerEarth__9349fa7/main/algorithms/searching/IceCreamParlourKt.class",
"javap": "Compiled from \"IceCreamParlour.kt\"\npublic final class main.algorithms.searching.IceCreamParlourKt {\n public static final java.lang.Integer[] whatFlavors(java.lang.Integer[], int);\n Co... |
vamsitallapudi__HackerEarth__9349fa7/src/main/algorithms/searching/BinarySearchRecursive.kt | package main.algorithms.searching
fun main(args: Array<String>) {
val input = readLine()!!.trim().split(" ").map { it -> it.toInt() }.toIntArray() // to read an array (from user input)
val eleToSearch = readLine()!!.trim().toInt() // to read the element to be searched (from user input)
val pos = binar... | [
{
"class_path": "vamsitallapudi__HackerEarth__9349fa7/main/algorithms/searching/BinarySearchRecursiveKt.class",
"javap": "Compiled from \"BinarySearchRecursive.kt\"\npublic final class main.algorithms.searching.BinarySearchRecursiveKt {\n public static final void main(java.lang.String[]);\n Code:\n ... |
vamsitallapudi__HackerEarth__9349fa7/src/main/algorithms/sorting/MergeSort.kt | package main.algorithms.sorting
fun main(args: Array<String>) {
val array = readLine()!!.split(" ").map { it.toInt() }.toIntArray() // 1) Read the input and split into array
mergeSort(array)
for(i in array) println(i)
}
fun mergeSort(array : IntArray, helper:IntArray = IntArray(array.size), low:Int = 0, h... | [
{
"class_path": "vamsitallapudi__HackerEarth__9349fa7/main/algorithms/sorting/MergeSortKt.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class main.algorithms.sorting.MergeSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9... |
vamsitallapudi__HackerEarth__9349fa7/src/main/algorithms/sorting/QuickSort.kt | package main.algorithms.sorting
fun main(args: Array<String>) {
val array = readLine()!!.split(" ").map { it.toInt() }.toIntArray() // 1) Read the input and split into array
quickSort(array, 0, array.size-1)
for(i in array) println(i)
}
fun quickSort(array: IntArray, left: Int, right: Int) {
val inde... | [
{
"class_path": "vamsitallapudi__HackerEarth__9349fa7/main/algorithms/sorting/QuickSortKt.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class main.algorithms.sorting.QuickSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9... |
vamsitallapudi__HackerEarth__9349fa7/src/main/basicprogramming/implementation/kotlin/BatmanAndTicTacToe.kt | package main.basicprogramming.implementation.kotlin
fun main(args: Array<String>) {
var testCases:Int = readLine()!!.toInt()
while(testCases-- > 0) {
val line1 = readLine()!!
val line2 = readLine()!!
val line3 = readLine()!!
val line4 = readLine()!!
if(ticTacToeLogic(... | [
{
"class_path": "vamsitallapudi__HackerEarth__9349fa7/main/basicprogramming/implementation/kotlin/BatmanAndTicTacToeKt.class",
"javap": "Compiled from \"BatmanAndTicTacToe.kt\"\npublic final class main.basicprogramming.implementation.kotlin.BatmanAndTicTacToeKt {\n public static final void main(java.lang.S... |
imdudu1__algorithm-diary__ee7df89/jvm/src/main/kotlin/boj/ChickenDelivery.kt | package boj
import java.io.BufferedReader
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
class ChickenDelivery constructor(private val map: Array<Array<Int>>) {
private val stores: List<Point> by lazy { getObjects(2) }
private val houses: List<Point> by lazy { getObjects(1) }
... | [
{
"class_path": "imdudu1__algorithm-diary__ee7df89/boj/ChickenDelivery.class",
"javap": "Compiled from \"ChickenDelivery.kt\"\npublic final class boj.ChickenDelivery {\n private final java.lang.Integer[][] map;\n\n private final kotlin.Lazy stores$delegate;\n\n private final kotlin.Lazy houses$delegate;\... |
imdudu1__algorithm-diary__ee7df89/jvm/src/main/kotlin/boj/CoffeeShopII.kt | package boj
import java.io.BufferedReader
import java.io.InputStreamReader
class CoffeeShopII constructor(private val numbers: Array<Long>) {
private val segmentTree: Array<Long> = Array(numbers.size * 4) { 0 }
init {
initTree(0, numbers.size - 1)
}
private fun initTree(begin: Int, end: Int... | [
{
"class_path": "imdudu1__algorithm-diary__ee7df89/boj/CoffeeShopIIKt.class",
"javap": "Compiled from \"CoffeeShopII.kt\"\npublic final class boj.CoffeeShopIIKt {\n public static final void coffeeShopII(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // Strin... |
vorpal-research__kparsec__3238c73/src/main/kotlin/ru/spbstu/kparsec/examples/tip/constraint/Equalities.kt | package ru.spbstu.kparsec.examples.tip.constraint
import java.util.*
sealed class Node {
abstract operator fun contains(v: Node): Boolean
}
data class Var(val id: String = dict[currentId].also { ++currentId }) : Node() {
override fun contains(v: Node): Boolean = v == this
override fun toString() = id
... | [
{
"class_path": "vorpal-research__kparsec__3238c73/ru/spbstu/kparsec/examples/tip/constraint/EqualitiesKt.class",
"javap": "Compiled from \"Equalities.kt\"\npublic final class ru.spbstu.kparsec.examples.tip.constraint.EqualitiesKt {\n public static final void collectVariables(ru.spbstu.kparsec.examples.tip... |
hi-dhl__Leetcode-Solutions-with-Java-And-Kotlin__b5e34ac/00-code(源代码)/src/com/hi/dhl/algorithms/offer/_13/kotlin/Solution.kt | package com.hi.dhl.algorithms.offer._13.kotlin
import java.util.*
/**
* <pre>
* author: dhl
* desc :
* </pre>
*/
class Solution {
fun movingCount(m: Int, n: Int, k: Int): Int {
val robot = Array(m, { IntArray(n) })
return dfs(robot, 0, 0, m, n, k)
}
fun dfs(robot: Array<Int... | [
{
"class_path": "hi-dhl__Leetcode-Solutions-with-Java-And-Kotlin__b5e34ac/com/hi/dhl/algorithms/offer/_13/kotlin/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class com.hi.dhl.algorithms.offer._13.kotlin.Solution {\n public com.hi.dhl.algorithms.offer._13.kotlin.Solution();\n Co... |
hi-dhl__Leetcode-Solutions-with-Java-And-Kotlin__b5e34ac/00-code(源代码)/src/com/hi/dhl/algorithms/offer/_17/kotlin/Solution.kt | package com.hi.dhl.algorithms.offer._17.kotlin
/**
* <pre>
* author: dhl
* date : 2020/8/5
* desc :
* </pre>
*/
class Solution {
// 方法一
fun printNumbers2(n: Int): IntArray {
var max = 1;
for (i in 1..n) {
max = max * 10;
}
val result = IntArray(... | [
{
"class_path": "hi-dhl__Leetcode-Solutions-with-Java-And-Kotlin__b5e34ac/com/hi/dhl/algorithms/offer/_17/kotlin/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class com.hi.dhl.algorithms.offer._17.kotlin.Solution {\n private final char[] defNum;\n\n private int index;\n\n public ... |
Petikoch__TicTacToe_FP_CTDD_Kotlin__f24fa2e/src/main/kotlin/ch/petikoch/examples/tictactoe_fp/TicTacToe.kt | package ch.petikoch.examples.tictactoe_fp
import ch.petikoch.examples.tictactoe_fp.Field.*
fun main() {
var gameState = GameState() // "store"
while (gameState.winner == null && !gameState.board.values.any { it == null }) {
println(gameState) // "view"
val ... | [
{
"class_path": "Petikoch__TicTacToe_FP_CTDD_Kotlin__f24fa2e/ch/petikoch/examples/tictactoe_fp/TicTacToeKt.class",
"javap": "Compiled from \"TicTacToe.kt\"\npublic final class ch.petikoch.examples.tictactoe_fp.TicTacToeKt {\n private static final java.util.List<kotlin.Triple<ch.petikoch.examples.tictactoe_... |
aquatir__code-samples__eac3328/code-sample-kotlin/algorithms/src/main/kotlin/com/codesample/algo/unions.kt | package com.codesample.algo
abstract class Union<T>() {
/** Make two elements point to same union */
abstract fun union(fst: T, snd: T)
/** Return true if two elements are connected or false otherwise. Same elements are always considered connected */
abstract fun connected(fst: T, snd: T): Boolean
}
... | [
{
"class_path": "aquatir__code-samples__eac3328/com/codesample/algo/UnionsKt.class",
"javap": "Compiled from \"unions.kt\"\npublic final class com.codesample.algo.UnionsKt {\n public static final void printConnected(com.codesample.algo.Union<java.lang.Integer>, int, int);\n Code:\n 0: aload_0\n ... |
CWKSC__MyLib_Kotlin__01c8453/MyLib_Kotlin/src/main/kotlin/algorithm/dp/LCS.kt | package algorithm.dp
sealed class LCS {
companion object {
private fun longestOne(A: String, B: String): String {
return if (A.length >= B.length) A else B
}
fun recursionTopDown(A: String, B: String): String {
if (A.isEmpty() || B.isEmpty()) return "";
... | [
{
"class_path": "CWKSC__MyLib_Kotlin__01c8453/algorithm/dp/LCS$Companion.class",
"javap": "Compiled from \"LCS.kt\"\npublic final class algorithm.dp.LCS$Companion {\n private algorithm.dp.LCS$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.... |
boti996__fish_dsl__dd0ac20/src/main/kotlin/boti996/dsl/proba/models/Bonus.kt | package boti996.dsl.proba.models
/**
* this defines bonus-effect ID-s
*/
enum class BonusEffect(val literal: String) {
REGENERATION("regeneration"),
STRENGTH("strength"),
DEFENSE("defense")
}
/**
* bonus type: this defines a set of [BonusEffect]-s
*/
enum class BonusType {
ANOXIA {
overrid... | [
{
"class_path": "boti996__fish_dsl__dd0ac20/boti996/dsl/proba/models/Bonus.class",
"javap": "Compiled from \"Bonus.kt\"\npublic final class boti996.dsl.proba.models.Bonus {\n private final boti996.dsl.proba.models.BonusType bonus;\n\n private float multiplier;\n\n public boti996.dsl.proba.models.Bonus(bo... |
ThijsBoehme__portfolio-design-patterns-udemy__9bdb5be/src/main/kotlin/behavioural_patterns/interpreter/Interpreter.kt | package behavioural_patterns.interpreter
import java.util.stream.Collectors
interface Element {
fun eval(): Int
}
class Integer(private val value: Int): Element {
override fun eval(): Int {
return value
}
}
class BinaryOperation: Element {
lateinit var type: Type
lateinit var left: Eleme... | [
{
"class_path": "ThijsBoehme__portfolio-design-patterns-udemy__9bdb5be/behavioural_patterns/interpreter/InterpreterKt$WhenMappings.class",
"javap": "Compiled from \"Interpreter.kt\"\npublic final class behavioural_patterns.interpreter.InterpreterKt$WhenMappings {\n public static final int[] $EnumSwitchMapp... |
manan025__DS-Algo-Zone__c185dce/Kotlin/binary_Search.kt | package com.company
fun main(args: Array<String>) {
// please pass sorted array in input always because binary search will always run in sorted array
val i = readLine()!!.trim().split(" ").map { it -> it.toInt() }.toIntArray()
val key = readLine()!!.trim().toInt()
val ans = binarySearch(i, key)
if... | [
{
"class_path": "manan025__DS-Algo-Zone__c185dce/com/company/Binary_SearchKt.class",
"javap": "Compiled from \"binary_Search.kt\"\npublic final class com.company.Binary_SearchKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
AoEiuV020__DataStructuresTraining__6161b96/lib/src/main/kotlin/aoeiuv020/DynamicProgramming.kt | package aoeiuv020
import java.util.*
typealias StringBuilder = java.lang.StringBuilder
/**
* 最长公共子序列，
* 输出所有子序列，
* Created by AoEiuV020 on 2017/05/14.
*/
object DynamicProgramming {
enum class Last {
XY, X, Y, E
}
fun longestCommonSubsequence(x: String, y: String): List<String> = longestCommo... | [
{
"class_path": "AoEiuV020__DataStructuresTraining__6161b96/aoeiuv020/DynamicProgramming$Last.class",
"javap": "Compiled from \"DynamicProgramming.kt\"\npublic final class aoeiuv020.DynamicProgramming$Last extends java.lang.Enum<aoeiuv020.DynamicProgramming$Last> {\n public static final aoeiuv020.DynamicPr... |
jerrycychen__algoexpert__c853c59/017. Find Three Largest Numbers/FindThreeLargestNumbers.kt | package com.algoexpert.program
fun findThreeLargestNumbers(array: List<Int>): List<Int> {
val threeLargest = mutableListOf(Int.MIN_VALUE, Int.MIN_VALUE, Int.MIN_VALUE)
for (num in array) {
updateLargest(threeLargest, num)
}
return threeLargest
}
fun updateLargest(threeLargest: MutableList<Int>... | [
{
"class_path": "jerrycychen__algoexpert__c853c59/com/algoexpert/program/FindThreeLargestNumbersKt.class",
"javap": "Compiled from \"FindThreeLargestNumbers.kt\"\npublic final class com.algoexpert.program.FindThreeLargestNumbersKt {\n public static final java.util.List<java.lang.Integer> findThreeLargestNu... |
SHvatov__bio-relatives-kt__f85c144/bio-common/src/main/kotlin/bio/relatives/common/utils/MathUtils.kt | package bio.relatives.common.utils
import kotlin.math.pow
import kotlin.math.roundToInt
import kotlin.math.sqrt
/**
* Based on the provided [values] calculates the median value.
* @author Created by <NAME> on 28.01.2021
*/
fun <T : Number> calculateMedianVale(values: List<T>): Double =
with(values.map { it.toD... | [
{
"class_path": "SHvatov__bio-relatives-kt__f85c144/bio/relatives/common/utils/MathUtilsKt.class",
"javap": "Compiled from \"MathUtils.kt\"\npublic final class bio.relatives.common.utils.MathUtilsKt {\n public static final <T extends java.lang.Number> double calculateMedianVale(java.util.List<? extends T>)... |
alexjlockwood__bees-and-bombs-compose__0d7a86b/app/src/main/java/com/alexjlockwood/beesandbombs/demos/utils/MathUtils.kt | package com.alexjlockwood.beesandbombs.demos.utils
import kotlin.math.pow
import kotlin.math.sqrt
const val PI = Math.PI.toFloat()
const val TWO_PI = 2 * PI
const val HALF_PI = PI / 2
/**
* Calculates the cartesian distance between two points.
*/
fun dist(x1: Float, y1: Float, x2: Float, y2: Float): Float {
re... | [
{
"class_path": "alexjlockwood__bees-and-bombs-compose__0d7a86b/com/alexjlockwood/beesandbombs/demos/utils/MathUtilsKt.class",
"javap": "Compiled from \"MathUtils.kt\"\npublic final class com.alexjlockwood.beesandbombs.demos.utils.MathUtilsKt {\n public static final float PI;\n\n public static final float... |
franmosteiro__advent-of-code__dad555d/2020/kotlin/src/main/kotlin/io/franmosteiro/aoc2020/Day08.kt | package io.franmosteiro.aoc2020
/**
* Advent of Code 2020 - Day 8: Handheld Halting -
* Problem Description: http://adventofcode.com/2020/day/8
*/
class Day08(input: List<String>) {
private val orders: List<Order> = input.map {
val (name, offset) = it.split("\\s".toRegex())
Order(name, offset.t... | [
{
"class_path": "franmosteiro__advent-of-code__dad555d/io/franmosteiro/aoc2020/Day08.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class io.franmosteiro.aoc2020.Day08 {\n private final java.util.List<io.franmosteiro.aoc2020.Day08$Order> orders;\n\n public io.franmosteiro.aoc2020.Day08(java.ut... |
franmosteiro__advent-of-code__dad555d/2020/kotlin/src/main/kotlin/io/franmosteiro/aoc2020/Day09.kt | package io.franmosteiro.aoc2020
/**
* Advent of Code 2020 - Day 9: Encoding Error -
* Problem Description: http://adventofcode.com/2020/day/9
*/
class Day09(input: List<String>) {
private val seriesOfNumbers = input.map{ it.toLong() }
private var invalidNumber = -1
private val requiredSum: Long = 13984... | [
{
"class_path": "franmosteiro__advent-of-code__dad555d/io/franmosteiro/aoc2020/Day09.class",
"javap": "Compiled from \"Day09.kt\"\npublic final class io.franmosteiro.aoc2020.Day09 {\n private final java.util.List<java.lang.Long> seriesOfNumbers;\n\n private int invalidNumber;\n\n private final long requi... |
franmosteiro__advent-of-code__dad555d/2020/kotlin/src/main/kotlin/io/franmosteiro/aoc2020/Day07.kt | package io.franmosteiro.aoc2020
/**
* Advent of Code 2020 - Day 7: Handy Haversacks -
* Problem Description: http://adventofcode.com/2020/day/7
*/
class Day07(input: List<String>) {
private val allBags: List<Bag>
private val MY_BAG = "shiny gold"
companion object {
private val bagPattern = """... | [
{
"class_path": "franmosteiro__advent-of-code__dad555d/io/franmosteiro/aoc2020/Day07.class",
"javap": "Compiled from \"Day07.kt\"\npublic final class io.franmosteiro.aoc2020.Day07 {\n public static final io.franmosteiro.aoc2020.Day07$Companion Companion;\n\n private final java.util.List<io.franmosteiro.ao... |
franmosteiro__advent-of-code__dad555d/2020/kotlin/src/main/kotlin/io/franmosteiro/aoc2020/Day04.kt | package io.franmosteiro.aoc2020
/**
* Advent of Code 2020 - Day 4: Passport Processing -
* Problem Description: http://adventofcode.com/2020/day/4
*/
class Day04(input: String) {
private val passports = input.split("\\n\\n".toRegex()).map { line ->
line.split("\\s".toRegex()).associate {
va... | [
{
"class_path": "franmosteiro__advent-of-code__dad555d/io/franmosteiro/aoc2020/Day04.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class io.franmosteiro.aoc2020.Day04 {\n private final java.util.List<java.util.Map<java.lang.String, java.lang.String>> passports;\n\n public io.franmosteiro.aoc2... |
reactivedevelopment__aoc-2022-2__dac4682/src/main/kotlin/com/adventofcode/Day.kt | package com.adventofcode
import com.adventofcode.Figure.*
import com.adventofcode.Game.game
import com.adventofcode.Game.rightScores
import com.adventofcode.Round.*
enum class Round(val scores: Long) {
Win(6),
Lose(0),
Draw(3),
}
enum class Figure(val scores: Long) {
Rock(1) {
override fun roundWith(oth... | [
{
"class_path": "reactivedevelopment__aoc-2022-2__dac4682/com/adventofcode/DayKt$main$2.class",
"javap": "Compiled from \"Day.kt\"\nfinal class com.adventofcode.DayKt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.lang.String, kotlin.Unit> {\n public... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/treesandgraphs/EvaluateDivision.kt | package treesandgraphs
private data class Vertex(val name: String, val edges: MutableList<Pair<Vertex, Double>>) {
var visited = false
}
class EvaluateDivision {
private val vertexes = mutableMapOf<String, Vertex>()
private fun dfs(v: Vertex, target: Vertex, value: Double): Pair<Boolean, Double> {
... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/treesandgraphs/EvaluateDivision.class",
"javap": "Compiled from \"EvaluateDivision.kt\"\npublic final class treesandgraphs.EvaluateDivision {\n private final java.util.Map<java.lang.String, treesandgraphs.Vertex> vertexes;\n\n public treesandgra... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/treesandgraphs/MostStonesRemovedWithSameRowOrColumn.kt | package treesandgraphs
private var xIndex = mapOf<Int, List<Int>>()
private var yIndex = mapOf<Int, List<Int>>()
private var visited = booleanArrayOf()
private fun dfs(stones: Array<IntArray>, index: Int): Int {
visited[index] = true
var sum = 0
for (i in xIndex[stones[index][0]]!!) {
if (!visited... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/treesandgraphs/MostStonesRemovedWithSameRowOrColumnKt.class",
"javap": "Compiled from \"MostStonesRemovedWithSameRowOrColumn.kt\"\npublic final class treesandgraphs.MostStonesRemovedWithSameRowOrColumnKt {\n private static java.util.Map<java.lang... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/treesandgraphs/LongestIncreasingPathInMatrix.kt | package treesandgraphs
private var memo: Array<IntArray>? = null
private fun dfs(matrix: Array<IntArray>, i: Int, j: Int): Int {
if (memo!![i][j] != -1) {
return memo!![i][j]
}
var maxLength = 0
if (i > 0 && matrix[i - 1][j] > matrix[i][j])
maxLength = maxOf(maxLength, dfs(matrix, i... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/treesandgraphs/LongestIncreasingPathInMatrixKt.class",
"javap": "Compiled from \"LongestIncreasingPathInMatrix.kt\"\npublic final class treesandgraphs.LongestIncreasingPathInMatrixKt {\n private static int[][] memo;\n\n private static final int ... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/design/SearchAutocompleteSystem.kt | package design
class AutocompleteSystem(sentences: Array<String>, times: IntArray) {
private class TrieNode {
var leafTimes = 0
val children = mutableMapOf<Char, TrieNode>()
}
private val trieRoot = TrieNode()
private var currentNode: TrieNode
private val prefix = StringBuilder()
... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/design/SearchAutocompleteSystemKt.class",
"javap": "Compiled from \"SearchAutocompleteSystem.kt\"\npublic final class design.SearchAutocompleteSystemKt {\n public static final void main();\n Code:\n 0: new #8 /... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/recursion/WordSearchII.kt | package recursion
class WordSearchII {
class TrieNode {
val children = HashMap<Char, TrieNode>()
var isLeaf = false
}
private val ret = mutableSetOf<String>()
private var board: Array<CharArray> = arrayOf<CharArray>()
private var m: Int = -1
private var n: Int = -1
private... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/recursion/WordSearchIIKt.class",
"javap": "Compiled from \"WordSearchII.kt\"\npublic final class recursion.WordSearchIIKt {\n public static final void main();\n Code:\n 0: new #8 // class recursion/WordSearchII... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/recursion/AndroidUnlockPatterns.kt | package recursion
private val visited = BooleanArray(9) {false}
fun valid(i: Int, j: Int, ni: Int, nj: Int): Boolean {
val di = Math.abs(i - ni)
val dj = Math.abs(j - nj)
return if ((di == 2 && dj == 2) || (di == 0 && dj == 2) || (di == 2 && dj == 0)) {
val mi = (i + ni) / 2
val mj = (j ... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/recursion/AndroidUnlockPatternsKt.class",
"javap": "Compiled from \"AndroidUnlockPatterns.kt\"\npublic final class recursion.AndroidUnlockPatternsKt {\n private static final boolean[] visited;\n\n public static final boolean valid(int, int, int,... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/recursion/WordSquares.kt | package recursion
val squares: MutableList<MutableList<String>> = mutableListOf()
data class TrieNode(val children: MutableMap<Char, TrieNode>)
val root = TrieNode(mutableMapOf())
fun traverse(square: MutableList<String>, cur: TrieNode, word: StringBuilder, words: Array<String>) {
if (word.length == words[0].len... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/recursion/WordSquaresKt.class",
"javap": "Compiled from \"WordSquares.kt\"\npublic final class recursion.WordSquaresKt {\n private static final java.util.List<java.util.List<java.lang.String>> squares;\n\n private static final recursion.TrieNode... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/sortingandsearching/MedianOfTwoSortedArrays.kt | package sortingandsearching
// O(log(min(m, n)))
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {
val a = if (nums1.size < nums2.size) nums1 else nums2
val b = if (nums1.size < nums2.size) nums2 else nums1
var l = 0
var r = a.size
var i: Int
var j: Int
var found: Bool... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/sortingandsearching/MedianOfTwoSortedArraysKt.class",
"javap": "Compiled from \"MedianOfTwoSortedArrays.kt\"\npublic final class sortingandsearching.MedianOfTwoSortedArraysKt {\n public static final double findMedianSortedArrays(int[], int[]);\n ... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/sortingandsearching/CountOfSmallerNumbersAfterSelf.kt | package sortingandsearching
private const val OFFSET = 10000
private const val SIZE = 2 * 10000 + 1
private val segmentTree = IntArray(4 * SIZE) { 0 }
private fun update(vertex: Int, left: Int, right: Int, pos: Int, value: Int) {
if (left == right) {
segmentTree[vertex] += value
return
}
... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/sortingandsearching/CountOfSmallerNumbersAfterSelfKt.class",
"javap": "Compiled from \"CountOfSmallerNumbersAfterSelf.kt\"\npublic final class sortingandsearching.CountOfSmallerNumbersAfterSelfKt {\n private static final int OFFSET;\n\n private ... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/dynamicprogramming/SplitArrayLargestSum.kt | package dynamicprogramming
private var memo = arrayOf<IntArray>()
fun dp(nums: IntArray, m: Int, index: Int): Int {
if (memo[m][index] != -1) {
return memo[m][index]
}
if (m == 1) {
var sum = 0
for (i in index .. nums.lastIndex) {
sum += nums[i]
}
memo[m... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/dynamicprogramming/SplitArrayLargestSumKt.class",
"javap": "Compiled from \"SplitArrayLargestSum.kt\"\npublic final class dynamicprogramming.SplitArrayLargestSumKt {\n private static int[][] memo;\n\n public static final int dp(int[], int, int);... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/dynamicprogramming/LongestPalindromicSubstring.kt | package dynamicprogramming
private var memo: Array<Array<Boolean?>>? = null
fun isPalindrome(s: String, i: Int, j: Int): Boolean {
if (memo!![i][j] != null) {
return memo!![i][j]!!
}
if (i == j) {
memo!![i][j] = true
return true
}
if (i == j - 1) {
memo!![i][j] = s[... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/dynamicprogramming/LongestPalindromicSubstringKt.class",
"javap": "Compiled from \"LongestPalindromicSubstring.kt\"\npublic final class dynamicprogramming.LongestPalindromicSubstringKt {\n private static java.lang.Boolean[][] memo;\n\n public st... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/dynamicprogramming/MaximumProductSubarray.kt | package dynamicprogramming
fun processSubarray(a: Int, b: Int, negatives: Int, nums: IntArray): Int {
if (a > b) {
return 0
}
if (a == b) {
return nums[a]
}
var i = a
var j = b
var leftProd = 1
var rightProd = 1
if (negatives % 2 == 1) {
while (nums[i] > 0)... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/dynamicprogramming/MaximumProductSubarrayKt.class",
"javap": "Compiled from \"MaximumProductSubarray.kt\"\npublic final class dynamicprogramming.MaximumProductSubarrayKt {\n public static final int processSubarray(int, int, int, int[]);\n Code... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/arraysandstrings/NextClosestTime.kt | package arraysandstrings
fun isValid(arr: IntArray): Boolean {
var hour = arr[0] * 10 + arr[1]
var minute = arr[2] * 10 + arr[3]
return hour < 24 && minute < 60
}
fun totalMinutes(arr: IntArray): Int {
var hour = arr[0] * 10 + arr[1]
var minute = arr[2] * 10 + arr[3]
return hour * 60 + minute... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/arraysandstrings/NextClosestTimeKt.class",
"javap": "Compiled from \"NextClosestTime.kt\"\npublic final class arraysandstrings.NextClosestTimeKt {\n private static int base;\n\n private static int[] baseArr;\n\n private static int minDiff;\n\n ... |
e-freiman__LeetcodeGoogleInterview__fab7f27/src/main/kotlin/arraysandstrings/MinimumCostToHireKWorkers.kt | package arraysandstrings
import java.util.PriorityQueue
fun mincostToHireWorkers(quality: IntArray, wage: IntArray, k: Int): Double {
val x = wage.indices.sortedWith {a, b ->
val ra = wage[a].toDouble() / quality[a].toDouble()
val rb = wage[b].toDouble() / quality[b].toDouble()
... | [
{
"class_path": "e-freiman__LeetcodeGoogleInterview__fab7f27/arraysandstrings/MinimumCostToHireKWorkersKt.class",
"javap": "Compiled from \"MinimumCostToHireKWorkers.kt\"\npublic final class arraysandstrings.MinimumCostToHireKWorkersKt {\n public static final double mincostToHireWorkers(int[], int[], int);... |
LostMekka__ray-marcher-kt__ee42321/src/main/kotlin/de/lostmekka/raymarcher/Point.kt | package de.lostmekka.raymarcher
import kotlin.math.abs
import kotlin.math.cos
import kotlin.math.sin
import kotlin.math.sqrt
data class Point(val x: Double, val y: Double, val z: Double) {
constructor(x: Number, y: Number, z: Number) : this(x.toDouble(), y.toDouble(), z.toDouble())
val length by lazy { sqrt(... | [
{
"class_path": "LostMekka__ray-marcher-kt__ee42321/de/lostmekka/raymarcher/PointKt.class",
"javap": "Compiled from \"Point.kt\"\npublic final class de.lostmekka.raymarcher.PointKt {\n public static final de.lostmekka.raymarcher.Point plus(de.lostmekka.raymarcher.Point, de.lostmekka.raymarcher.Point);\n ... |
rbrincke__nontransitive-dice__fc5aa03/src/main/kotlin/io/rbrincke/dice/core/Solver.kt | package io.rbrincke.dice.core
/**
* Sets up a solver that is able to find allocations of [labels] that lead to non-transitive
* elements. The number of resulting elements equals the size of [labelGroupSizes], and each
* element will contain precisely the number specified in [labelGroupSizes].
*
* @param labels la... | [
{
"class_path": "rbrincke__nontransitive-dice__fc5aa03/io/rbrincke/dice/core/Solver.class",
"javap": "Compiled from \"Solver.kt\"\npublic final class io.rbrincke.dice.core.Solver<S, T extends io.rbrincke.dice.core.Element<? super T>> {\n private final java.util.List<S> labels;\n\n private final java.util.... |
rbrincke__nontransitive-dice__fc5aa03/src/main/kotlin/io/rbrincke/dice/core/MultisetPermutationIterator.kt | package io.rbrincke.dice.core
/**
* Multiset permutation iterator. Not thread safe.
*
* See *"Loopless Generation of Multiset Permutations using a Constant Number
* of Variables by Prefix Shifts."*, <NAME>, 2009.
*/
class MultisetPermutationIterator<E : Comparable<E>>(input: Collection<E>) : Iterator<List<E>> {
... | [
{
"class_path": "rbrincke__nontransitive-dice__fc5aa03/io/rbrincke/dice/core/MultisetPermutationIterator.class",
"javap": "Compiled from \"MultisetPermutationIterator.kt\"\npublic final class io.rbrincke.dice.core.MultisetPermutationIterator<E extends java.lang.Comparable<? super E>> implements java.util.It... |
rbrincke__nontransitive-dice__fc5aa03/src/main/kotlin/io/rbrincke/dice/core/Combination.kt | package io.rbrincke.dice.core
class Combination<T : Element<T>>(private val elements: List<T>) {
init {
check(elements.isNotEmpty()) { "Elements may not be empty." }
}
/**
* Matches element 1 to 2, ..., N - 1 to N, N to 1.
*/
private val elementPairs = elements.mapIndexed { currentId... | [
{
"class_path": "rbrincke__nontransitive-dice__fc5aa03/io/rbrincke/dice/core/Combination.class",
"javap": "Compiled from \"Combination.kt\"\npublic final class io.rbrincke.dice.core.Combination<T extends io.rbrincke.dice.core.Element<? super T>> {\n private final java.util.List<T> elements;\n\n private fi... |
AkshayChordiya__advent-of-code-kotlin-2022__ad60a71/src/com/akshay/adventofcode/Day05.kt | package com.akshay.adventofcode
import java.io.File
data class Move(val quantity: Int, val source: Int, val target: Int) {
companion object {
fun of(line: String): Move {
return line
.split(" ")
.filterIndexed { index, _ -> index % 2 == 1 }
.map... | [
{
"class_path": "AkshayChordiya__advent-of-code-kotlin-2022__ad60a71/com/akshay/adventofcode/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class com.akshay.adventofcode.Day05Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io... |
why168__JavaProjects__c642d97/Kotlinlang/src/examples/longerExamples/Maze.kt | package examples.longerExamples
import java.util.*
/**
* Let's Walk Through a Maze.
*
* Imagine there is a maze whose walls are the big 'O' letters.
* Now, I stand where a big 'I' stands and some cool prize lies
* somewhere marked with a '$' sign. Like this:
*
* OOOOOOOOOOOOOOOOO
* O O
* ... | [
{
"class_path": "why168__JavaProjects__c642d97/examples/longerExamples/Maze.class",
"javap": "Compiled from \"Maze.kt\"\npublic final class examples.longerExamples.Maze {\n private final int width;\n\n private final int height;\n\n private final boolean[][] walls;\n\n private final examples.longerExampl... |
soniro__nonogram-solver__6cc0f04/src/main/kotlin/de/soniro/nonogramsolver/Nonogram.kt | package de.soniro.nonogramsolver
import de.soniro.nonogramsolver.Cell.*
enum class Cell(val char: Char) {
FILL('\u2588'),
EMPTY(' '),
NOT_FILLED('X'),
UNKNOWN('?');
override fun toString(): String = "$char"
}
class Nonogram(val rows: Array<IntArray>, val columns: Array<IntArray>) {
val grid... | [
{
"class_path": "soniro__nonogram-solver__6cc0f04/de/soniro/nonogramsolver/Nonogram.class",
"javap": "Compiled from \"Nonogram.kt\"\npublic final class de.soniro.nonogramsolver.Nonogram {\n private final int[][] rows;\n\n private final int[][] columns;\n\n private final java.lang.Object[][] grid;\n\n pr... |
MikeDepies__NeatKotlin__215f13f/neat-core/src/main/kotlin/neat/novelty/Levenshtein.kt | package neat.novelty
import kotlin.math.min
fun levenshtein(lhs: CharSequence, rhs: CharSequence): Int {
if (lhs == rhs) {
return 0
}
if (lhs.isEmpty()) {
return rhs.length
}
if (rhs.isEmpty()) {
return lhs.length
}
val lhsLength = lhs.length + 1
val rhsLength ... | [
{
"class_path": "MikeDepies__NeatKotlin__215f13f/neat/novelty/LevenshteinKt.class",
"javap": "Compiled from \"Levenshtein.kt\"\npublic final class neat.novelty.LevenshteinKt {\n public static final int levenshtein(java.lang.CharSequence, java.lang.CharSequence);\n Code:\n 0: aload_0\n 1: ldc... |
kristofersokk__Google-coding-competitions__3ebd59d/src/main/kotlin/roundC2021/smallerstrings.kt | package roundC2021
import kotlin.math.max
import kotlin.math.min
fun main() {
val cases = readLine()!!.toInt()
(1..cases).forEach { caseIndex ->
val (N, K) = readLine()!!.split(" ").map { it.toLong() }
val S = readLine()!!
if (N == 1L) {
val y = max(min((S[0].letterNr).cod... | [
{
"class_path": "kristofersokk__Google-coding-competitions__3ebd59d/roundC2021/SmallerstringsKt.class",
"javap": "Compiled from \"smallerstrings.kt\"\npublic final class roundC2021.SmallerstringsKt {\n public static final void main();\n Code:\n 0: invokestatic #12 // Method kotlin... |
jerome-fosse__kotlin-koans__e202925/src/iii_conventions/MyDate.kt | package iii_conventions
import iii_conventions.TimeInterval.*
data class MyDate(val year: Int, val month: Int, val dayOfMonth: Int) {
fun nextDay(): MyDate = this + DAY
operator fun compareTo(other: MyDate): Int {
if (this.year == other.year) {
if (this.month == other.month) {
... | [
{
"class_path": "jerome-fosse__kotlin-koans__e202925/iii_conventions/MyDate$WhenMappings.class",
"javap": "Compiled from \"MyDate.kt\"\npublic final class iii_conventions.MyDate$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 ... |
mopsalarm__Pr0__6e974f9/app/src/main/java/com/pr0gramm/app/services/Graph.kt | package com.pr0gramm.app.services
/**
* A simple graph of double values.
*/
data class Graph(val firstX: Double, val lastX: Double, val points: List<Graph.Point>) {
constructor(points: List<Graph.Point>) : this(points.first().x, points.last().x, points)
val range = firstX.rangeTo(lastX)
val first get... | [
{
"class_path": "mopsalarm__Pr0__6e974f9/com/pr0gramm/app/services/Graph$Point.class",
"javap": "Compiled from \"Graph.kt\"\npublic final class com.pr0gramm.app.services.Graph$Point {\n private final double x;\n\n private final double y;\n\n public com.pr0gramm.app.services.Graph$Point(double, double);\n... |
romanthekat__advent_of_code__f410f71/2019/task_13/src/main/kotlin/task_13/App.kt | package task_13
import java.io.File
import java.lang.RuntimeException
class App {
fun solveFirst(input: String): Int {
val tiles = HashMap<Point, Tile>()
val computer = IntcodeComputer(input)
while (!computer.isHalt) {
val x = computer.run()
val y = computer.run()... | [
{
"class_path": "romanthekat__advent_of_code__f410f71/task_13/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class task_13.AppKt {\n public static final void main();\n Code:\n 0: new #8 // class task_13/App\n 3: dup\n 4: invokespecial #11 ... |
romanthekat__advent_of_code__f410f71/2019/task_10/src/main/kotlin/task_10/App.kt | package task_10
import java.io.File
import java.lang.Integer.max
import java.lang.Integer.min
class App {
fun solveFirst(input: List<String>): Int {
val map = Map(input)
var (_, asteroids) = map.getBestLocation()
return asteroids.size
}
fun solveSecond(input: List<String>): Int {
... | [
{
"class_path": "romanthekat__advent_of_code__f410f71/task_10/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class task_10.AppKt {\n public static final void main();\n Code:\n 0: new #8 // class task_10/App\n 3: dup\n 4: invokespecial #11 ... |
ununhexium__samples__11aca6b/src/main/java/sudoku/Sudoku.kt | package sudoku
data class Grid(val given: List<List<Int>>)
data class Guess(val position: Pair<Int,Int>, val number:Int)
data class Proposal(val original:Sudoku, val proposition: List<Guess>)
fun main(args: Array<String>) {
// val grid1 = parse()
}
typealias Sudoku = List<List<Int>>
fun parse(text: List<String>)... | [
{
"class_path": "ununhexium__samples__11aca6b/sudoku/SudokuKt.class",
"javap": "Compiled from \"Sudoku.kt\"\npublic final class sudoku.SudokuKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokes... |
ununhexium__samples__11aca6b/src/main/java/strassenbahn/ThriftTicket.kt | package strassenbahn
import java.util.LinkedList
import kotlin.math.max
interface Ticket {
fun getPrice(area: Int): Float
val description: String
val adultCapacity: Int
val childrenCapacity: Int
val allowedTrips: Int
}
data class Wanted(
val area: Int,
val adults: Int = 0,
val childre... | [
{
"class_path": "ununhexium__samples__11aca6b/strassenbahn/ThriftTicketKt.class",
"javap": "Compiled from \"ThriftTicket.kt\"\npublic final class strassenbahn.ThriftTicketKt {\n public static final strassenbahn.Proposition cheapestPrice(strassenbahn.Wanted, java.util.List<? extends strassenbahn.Ticket>);\n... |
anurudhp__aoc2021__ed497f8/day16.kt | package quick.start
enum class Op(val i: Int) {
Sum(0),
Prod(1),
Min(2),
Max(3),
Lit(4),
Gt(5),
Lt(6),
Eq(7);
companion object {
fun fromInt(i: Int) = Op.values().first { it.i == i }
}
}
class Packet(version: Int, op: Op, lit: Long, children: List<Packet>) {
val version = version
val op = ... | [
{
"class_path": "anurudhp__aoc2021__ed497f8/quick/start/Day16Kt.class",
"javap": "Compiled from \"day16.kt\"\npublic final class quick.start.Day16Kt {\n public static final kotlin.Pair<java.lang.Long, java.lang.String> parseLit(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
tschulte__docToolchain-aoc-2019__afcaede/day14/kotlin/corneil/src/main/kotlin/solution.kt | package com.github.corneil.aoc2019.day14
import java.io.File
typealias ChemicalQty = Pair<Long, String>
data class ReactionFormula(val inputs: List<ChemicalQty>, val output: ChemicalQty)
fun readChemicalQty(it: String): ChemicalQty {
val tokens = it.trim().split(" ")
require(tokens.size == 2)
return Che... | [
{
"class_path": "tschulte__docToolchain-aoc-2019__afcaede/com/github/corneil/aoc2019/day14/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class com.github.corneil.aoc2019.day14.SolutionKt {\n public static final kotlin.Pair<java.lang.Long, java.lang.String> readChemicalQty(java.la... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/strings/special/SubstrCount.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.strings.special
import java.lang.Integer.max
import java.util.*
fun subStrCount(string: String): Long =
cntSubstringsWithSameChars(string) + cntSubstringsWithSameCharsExceptMiddle(string)
private fun cntSubstringsWithSameCharsExceptMiddle(string: ... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/strings/special/SubstrCountKt.class",
"javap": "Compiled from \"SubstrCount.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.strings.special.SubstrCountKt {\n pu... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/dynamic/candies/Candies.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.dynamic.candies
import java.util.*
import kotlin.math.max
import kotlin.math.min
fun candies(grades: Array<Int>): Long {
val size = grades.size
val gradeByIndex = saveGrading(grades)
val startIndicesWithDirections = buildStartIndicesWithD... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/dynamic/candies/CandiesKt$WhenMappings.class",
"javap": "Compiled from \"Candies.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.dynamic.candies.CandiesKt$WhenMa... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/hashmaps/triplets/CountTriplets.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.hashmaps.triplets
import java.util.*
fun countTriplets(array: LongArray, ratio: Long): Long {
fun modR(iv: IndexedValue<Long>) = iv.value % ratio == 0L
fun divR(iv: IndexedValue<Long>) = IndexedValue(iv.index, iv.value / ratio)
fun List<In... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/hashmaps/triplets/CountTripletsKt.class",
"javap": "Compiled from \"CountTriplets.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.hashmaps.triplets.CountTriplets... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/warmUpChallenges/clouds/JumpingOnClouds.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.warmUpChallenges.clouds
import java.util.*
private const val MAX_CLOUDS = 100
private const val MIN_CLOUDS = 2
fun jumpingOnClouds(clouds: Array<Int>): Int {
checkRequirement(clouds)
fun isThunder(cloud: Int) = cloud == 1
val (totalPenal... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/warmUpChallenges/clouds/JumpingOnCloudsKt.class",
"javap": "Compiled from \"JumpingOnClouds.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.warmUpChallenges.clou... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.