kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0063_UniquePathsII.kt | // https://leetcode.com/problems/unique-paths-ii
fun uniquePathsWithObstacles(obstacleGrid: Array<IntArray>): Int {
val lastRowIndex = obstacleGrid.lastIndex
val lastColIndex = obstacleGrid.first().lastIndex
val hasObstacle = obstacleGrid[lastRowIndex][lastColIndex] == 1
obstacleGrid[lastRowIndex][lastC... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0063_UniquePathsIIKt.class",
"javap": "Compiled from \"_0063_UniquePathsII.kt\"\npublic final class _0063_UniquePathsIIKt {\n public static final int uniquePathsWithObstacles(int[][]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0039_CombinationSum.kt | // https://leetcode.com/problems/combination-sum
fun combinationSum(candidates: IntArray, target: Int): List<List<Int>> {
return mutableListOf<List<Int>>().also {
buildCombinations(candidates, startIndex = 0, target = target, combination = mutableListOf(), combinations = it)
}
}
private fun buildCombin... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0039_CombinationSumKt.class",
"javap": "Compiled from \"_0039_CombinationSum.kt\"\npublic final class _0039_CombinationSumKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> combinationSum(int[], int);\n Code:\n 0: aloa... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0054_SpiralMatrix.kt | // https://leetcode.com/problems/spiral-matrix
fun spiralOrder(matrix: Array<IntArray>): List<Int> {
val numIndices = matrix.size * matrix.first().size
val spiral = mutableListOf<Int>()
val viewed = Array(matrix.size) { BooleanArray(matrix.first().size) }
var row = 0
var col = 0
var rowOffset = ... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0054_SpiralMatrixKt.class",
"javap": "Compiled from \"_0054_SpiralMatrix.kt\"\npublic final class _0054_SpiralMatrixKt {\n public static final java.util.List<java.lang.Integer> spiralOrder(int[][]);\n Code:\n 0: aload_0\n 1: ldc ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0017_LetterCombinationsOfAPhoneNumber.kt | import java.lang.StringBuilder
// https://leetcode.com/problems/letter-combinations-of-a-phone-number
fun letterCombinations(digits: String): List<String> {
val combinations = mutableListOf<String>()
val digitToChars = mapOf(
'2' to charArrayOf('a', 'b', 'c'),
'3' to charArrayOf('d', 'e', 'f'),... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0017_LetterCombinationsOfAPhoneNumberKt.class",
"javap": "Compiled from \"_0017_LetterCombinationsOfAPhoneNumber.kt\"\npublic final class _0017_LetterCombinationsOfAPhoneNumberKt {\n public static final java.util.List<java.lang.String> letterCombination... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0072_EditDistance.kt | // https://leetcode.com/problems/edit-distance
fun minDistance(word1: String, word2: String): Int {
return minDistance(word1, word2, 0, 0, Array(word1.length) { IntArray(word2.length) { -1 } })
}
private fun minDistance(word1: String, word2: String, index1: Int, index2: Int, memo: Array<IntArray>): Int {
if (w... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0072_EditDistanceKt.class",
"javap": "Compiled from \"_0072_EditDistance.kt\"\npublic final class _0072_EditDistanceKt {\n public static final int minDistance(java.lang.String, java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0040_CombinationSumII.kt | // https://leetcode.com/problems/combination-sum-ii
fun combinationSum2(candidates: IntArray, target: Int): List<List<Int>> {
candidates.sort()
return mutableSetOf<List<Int>>().also {
buildCombinations(candidates, startIndex = 0, target = target, combination = mutableListOf(), combinations = it)
}.t... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0040_CombinationSumIIKt.class",
"javap": "Compiled from \"_0040_CombinationSumII.kt\"\npublic final class _0040_CombinationSumIIKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> combinationSum2(int[], int);\n Code:\n ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0064_MinimumPathSum.kt | import kotlin.math.min
// https://leetcode.com/problems/minimum-path-sum
fun minPathSum(grid: Array<IntArray>): Int {
val lastRow = grid.lastIndex
val lastCol = grid.first().lastIndex
val memo = Array(lastRow + 1) { IntArray(lastCol + 1) }
memo[lastRow][lastCol] = grid[lastRow][lastCol]
for (row in... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0064_MinimumPathSumKt.class",
"javap": "Compiled from \"_0064_MinimumPathSum.kt\"\npublic final class _0064_MinimumPathSumKt {\n public static final int minPathSum(int[][]);\n Code:\n 0: aload_0\n 1: ldc #9 // S... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0079_WordSearch.kt | // https://leetcode.com/problems/word-search
fun exist(board: Array<CharArray>, word: String): Boolean {
val visited = Array(board.size) { BooleanArray(board.first().size) }
for (row in board.indices) {
for (col in board.first().indices) {
if (dfs(row = row, col = col, index = 0, word = word... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0079_WordSearchKt.class",
"javap": "Compiled from \"_0079_WordSearch.kt\"\npublic final class _0079_WordSearchKt {\n public static final boolean exist(char[][], java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0018_4Sum.kt | // https://leetcode.com/problems/4sum
fun fourSum(nums: IntArray, target: Int): List<List<Int>> {
val targetLong = target.toLong()
val quardruplets = mutableSetOf<Quardruplet>()
nums.sort()
for (first in 0..nums.lastIndex - 3) {
for (second in first + 1..nums.lastIndex - 2) {
var thi... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0018_4SumKt.class",
"javap": "Compiled from \"_0018_4Sum.kt\"\npublic final class _0018_4SumKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> fourSum(int[], int);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0047_PermutationsII.kt | // https://leetcode.com/problems/permutations-ii
fun permuteUnique(nums: IntArray): List<List<Int>> {
nums.sort()
return mutableListOf<List<Int>>().also {
buildPermutations(nums, 0, it)
}
}
private fun buildPermutations(nums: IntArray, startIndex: Int, permutations: MutableList<List<Int>>) {
if... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0047_PermutationsIIKt.class",
"javap": "Compiled from \"_0047_PermutationsII.kt\"\npublic final class _0047_PermutationsIIKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> permuteUnique(int[]);\n Code:\n 0: aload_0\n ... |
ryandyoon__leetcode-kotlin__7f75078/src/main/kotlin/_0046_Permutations.kt | // https://leetcode.com/problems/permutations
fun permute(nums: IntArray): List<List<Int>> {
return mutableListOf<List<Int>>().also {
buildPermutations(
nums = nums,
usedNums = BooleanArray(nums.size),
permutation = mutableListOf(),
permutations = it
)... | [
{
"class_path": "ryandyoon__leetcode-kotlin__7f75078/_0046_PermutationsKt.class",
"javap": "Compiled from \"_0046_Permutations.kt\"\npublic final class _0046_PermutationsKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> permute(int[]);\n Code:\n 0: aload_0\n 1: ldc... |
engividal__code-challenge__930a76a/q2/question2.kt | // 2. Check words with jumbled letters :
// Our brain can read texts even if letters are jumbled, like the following sentence: “Yuo
// cna porbalby raed tihs esaliy desptie teh msispeillgns.” Given two strings, write a
// method to decide if one is a partialpermutation of the other. Consider a
// partialpermutation o... | [
{
"class_path": "engividal__code-challenge__930a76a/Question2Kt.class",
"javap": "Compiled from \"question2.kt\"\npublic final class Question2Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invoke... |
engividal__code-challenge__930a76a/q3/question3.kt | // 3. Check words with typos:
// There are three types of typos that can be performed on strings: insert a character,
// remove a character, or replace a character. Given two strings, write a function to
// check if they are one typo (or zero typos) away.
// Examples:
// pale, ple > true
// pales, pale > true
// pale... | [
{
"class_path": "engividal__code-challenge__930a76a/Question3Kt.class",
"javap": "Compiled from \"question3.kt\"\npublic final class Question3Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invoke... |
eldarbogdanov__aoc-2022__bdac3ab/src/day9.kt | val di = listOf(-1, 0, 1, 0);
val dj = listOf(0, 1, 0, -1);
val dirMap: Map<String, Int> = mapOf("U" to 0, "R" to 1, "D" to 2, "L" to 3);
fun dist(a: Pair<Int, Int>, b: Pair<Int, Int>): Int {
return Math.max(Math.abs(a.first - b.first), Math.abs(a.second - b.second));
}
fun dist2(a: Pair<Int, Int>, b: Pair<Int, ... | [
{
"class_path": "eldarbogdanov__aoc-2022__bdac3ab/Day9Kt.class",
"javap": "Compiled from \"day9.kt\"\npublic final class Day9Kt {\n private static final java.util.List<java.lang.Integer> di;\n\n private static final java.util.List<java.lang.Integer> dj;\n\n private static final java.util.Map<java.lang.St... |
eldarbogdanov__aoc-2022__bdac3ab/src/day19.kt | import kotlin.math.max
fun main() {
data class State(
val oreRobots: Int, val clayRobots: Int, val obsidianRobots: Int, val geodeRobots: Int,
val clay: Int, val obsidian: Int, val geode: Int
) {
fun next(): State {
return State(
oreRobots, clayRobots, obsidia... | [
{
"class_path": "eldarbogdanov__aoc-2022__bdac3ab/Day19Kt$main$State.class",
"javap": "Compiled from \"day19.kt\"\npublic final class Day19Kt$main$State {\n private final int oreRobots;\n\n private final int clayRobots;\n\n private final int obsidianRobots;\n\n private final int geodeRobots;\n\n privat... |
eldarbogdanov__aoc-2022__bdac3ab/src/day7.kt | class Node(val name: String, val folders: MutableMap<String, Node>, val files: MutableMap<String, Long>);
val parents: MutableMap<Node, Node> = mutableMapOf<Node, Node>();
val folderSizes: MutableMap<Node, Long> = mutableMapOf();
fun sumFiles(cur: Node, limit: Long): Pair<Long, Long> {
var size: Long = cur.files.v... | [
{
"class_path": "eldarbogdanov__aoc-2022__bdac3ab/Day7Kt.class",
"javap": "Compiled from \"day7.kt\"\npublic final class Day7Kt {\n private static final java.util.Map<Node, Node> parents;\n\n private static final java.util.Map<Node, java.lang.Long> folderSizes;\n\n public static final java.util.Map<Node,... |
eldarbogdanov__aoc-2022__bdac3ab/src/day12.kt | fun main() {
val test = ""
val di = listOf(-1, 0, 1, 0);
val dj = listOf(0, 1, 0, -1);
val mat = test.split("\n");
val n = mat.size;
val m = mat[0].length;
val best = Array(n) {Array(m) {n * m} };
val next: MutableList<Pair<Int, Int>> = mutableListOf();
for((i, s) in mat.withIndex())... | [
{
"class_path": "eldarbogdanov__aoc-2022__bdac3ab/Day12Kt.class",
"javap": "Compiled from \"day12.kt\"\npublic final class Day12Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String\n 2: astore_0\n 3: iconst_4\n 4: anewarray #10 ... |
rajatenzyme__Coding-Journey__65a0570/Algo_Ds_Notes-master/Algo_Ds_Notes-master/Jhonson_Algoritm/Jhonson_Algorithm.kt | fun main()
{
var vert = 0
var edge = 0
var i = 0
var j = 0
var k = 0
var c = 0
var inf = 999999;
var cost = Array(10, {IntArray(10)})
var adj = Array(10, {IntArray(10)})
println("Enter no of vertices: ")
vert = readLine() !!.toInt()
println("Enter no of Edges: ");
ed... | [
{
"class_path": "rajatenzyme__Coding-Journey__65a0570/Jhonson_AlgorithmKt.class",
"javap": "Compiled from \"Jhonson_Algorithm.kt\"\npublic final class Jhonson_AlgorithmKt {\n public static final void main();\n Code:\n 0: iconst_0\n 1: istore_0\n 2: iconst_0\n 3: istore_1\n ... |
rajatenzyme__Coding-Journey__65a0570/Algo_Ds_Notes-master/Algo_Ds_Notes-master/Knuth_Morris_Pratt_Algorithm/KMP.kt | /*
<NAME> String Searching Algorithm
Given a text txt[0..n-1] and a pattern pat[0..m-1], the algo will find all occurrences of pat[] in txt[]
*/
import java.util.*
internal class KMP {
fun kmpSearch(pat: String, txt: String) {
val m = pat.length
val n = txt.length
// longest_prefix_suffix ... | [
{
"class_path": "rajatenzyme__Coding-Journey__65a0570/KMP.class",
"javap": "Compiled from \"KMP.kt\"\npublic final class KMP {\n public static final KMP$Companion Companion;\n\n public KMP();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":(... |
rajatenzyme__Coding-Journey__65a0570/Algo_Ds_Notes-master/Algo_Ds_Notes-master/Quick_Sort/Quick_Sort.kt | /* QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array
around the picked pivot.It's Best case complexity is n*log(n) & Worst case complexity is n^2. */
//partition array
fun quick_sort(A: Array<Int>, p: Int, r: Int) {
if (p < r) {
var q: Int = partition... | [
{
"class_path": "rajatenzyme__Coding-Journey__65a0570/Quick_SortKt.class",
"javap": "Compiled from \"Quick_Sort.kt\"\npublic final class Quick_SortKt {\n public static final void quick_sort(java.lang.Integer[], int, int);\n Code:\n 0: aload_0\n 1: ldc #9 // String ... |
rajatenzyme__Coding-Journey__65a0570/Algo_Ds_Notes-master/Algo_Ds_Notes-master/Floyd_Warshall_Algorithm/Floyd_Warshall_Algorithm.kt | // version 1.1
object FloydWarshall {
fun doCalcs(weights: Array<IntArray>, nVertices: Int) {
val dist = Array(nVertices) { DoubleArray(nVertices) { Double.POSITIVE_INFINITY } }
for (w in weights) dist[w[0] - 1][w[1] - 1] = w[2].toDouble()
val next = Array(nVertices) { IntArray(nVertices) ... | [
{
"class_path": "rajatenzyme__Coding-Journey__65a0570/Floyd_Warshall_AlgorithmKt.class",
"javap": "Compiled from \"Floyd_Warshall_Algorithm.kt\"\npublic final class Floyd_Warshall_AlgorithmKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
rajatenzyme__Coding-Journey__65a0570/Algo_Ds_Notes-master/Algo_Ds_Notes-master/Fenwick_Tree/Fenwick_Tree.kt | /*Fenwick Tree is used when there is a problem of range sum query with update
i.e. RMQ. Suppose you have an array and you have been asked to find sum in
range. It can be done in linear time with static array method. If will be
difficult for one to do it in linear time when you have point updates. In this
update operati... | [
{
"class_path": "rajatenzyme__Coding-Journey__65a0570/Fenwick_TreeKt.class",
"javap": "Compiled from \"Fenwick_Tree.kt\"\npublic final class Fenwick_TreeKt {\n public static final int sum(java.lang.Integer[], int);\n Code:\n 0: aload_0\n 1: ldc #9 // String ft\n ... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day9.kt | import Direction.D
import Direction.L
import Direction.R
import Direction.U
import java.io.File
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.sign
fun main() {
val result = File("inputs/day_9.txt").useLines { tailPositions(it, 9) }
println(result)
}
fun tailPositions(lines: Sequence<String>, ta... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day9Kt.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class Day9Kt {\n public static final void main();\n Code:\n 0: new #10 // class java/io/File\n 3: dup\n 4: ldc #12 // Stri... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day8.kt | import java.io.File
import java.lang.Integer.max
fun main() {
val result = File("inputs/day_8.txt").useLines { findScenicScore(it) }
println(result)
}
fun findVisible(lines: Sequence<String>) =
Grid(lines.map { line -> line.map { it.digitToInt()} }.toList())
.toVisbile()
fun findScenicScore(lines: Sequence... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day8Kt.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class Day8Kt {\n public static final void main();\n Code:\n 0: new #10 // class java/io/File\n 3: dup\n 4: ldc #12 // Stri... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day2.kt | import RPS.PAPER
import RPS.ROCK
import RPS.SCISSORS
import java.io.File
import kotlin.IllegalArgumentException
fun main() {
val result = File("inputs/day_2.txt").useLines { computeScorePart2(it) }
println(result)
}
// Part 1
fun computeScorePart1(lines: Sequence<String>) =
lines.map { it.split(" ") }
.map ... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class Day2Kt {\n public static final void main();\n Code:\n 0: new #10 // class java/io/File\n 3: dup\n 4: ldc #12 // Stri... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day7.kt | import java.nio.file.Path
fun fileSizeToDelete(lines: Sequence<String>) = directorySizes(lines).smallestFileToDelete()
fun fileSize(lines: Sequence<String>) =
directorySizes(lines).directorySizes.values
.filter { it <=100000 }
.sum()
private fun directorySizes(lines: Sequence<String>) =
lines.fold(Direct... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day7Kt.class",
"javap": "Compiled from \"Day7.kt\"\npublic final class Day7Kt {\n public static final int fileSizeToDelete(kotlin.sequences.Sequence<java.lang.String>);\n Code:\n 0: aload_0\n 1: ldc #10 // String lines\... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day11.kt | import java.io.File
fun main() {
val result = File("inputs/day_11_1.txt").useLines { totalBusiness(monkeys(it), 10000, 1) }
println(result)
}
fun totalBusiness(startState: Map<Int, Monkey>, times: Int = 20, divideBy: Int = 3) =
(1..times)
.fold(startState) { acc, _ -> simulateThrows(acc, divideBy, startStat... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day11Kt$parseOp$1.class",
"javap": "Compiled from \"Day11.kt\"\nfinal class Day11Kt$parseOp$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function2<java.lang.Long, java.lang.Long, java.lang.Long> {\n public static final Da... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day4.kt | import java.io.File
fun main() {
val result = File("inputs/day_4.txt").useLines { computeOverlaps(it) }
println(result)
}
fun computeFullOverlaps(lines: Sequence<String>) =
lines.map { toPairs(it) }
.count { it.first.contains(it.second) || it.second.contains(it.first)}
fun computeOverlaps(lines: Sequence<S... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day4Kt.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class Day4Kt {\n public static final void main();\n Code:\n 0: new #10 // class java/io/File\n 3: dup\n 4: ldc #12 // Stri... |
amitdev__advent_2022__b2cb4ec/src/main/kotlin/Day5.kt | fun solve(lines: Sequence<String>, part1: Boolean) =
lines.fold(Input()) { acc, line -> acc.merge(acc.parse(line)) }
.arrangeCrates()
.rearrange(part1)
.top()
data class Input(
val crates: Map<Int, List<String>> = mapOf(),
val instructions: List<Instruction> = listOf(),
private val parsedCrates: B... | [
{
"class_path": "amitdev__advent_2022__b2cb4ec/Day5Kt.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class Day5Kt {\n public static final java.lang.String solve(kotlin.sequences.Sequence<java.lang.String>, boolean);\n Code:\n 0: aload_0\n 1: ldc #10 // St... |
jorgensta__AdventOfCode2021__5e296aa/day3/src/main/kotlin/main.kt | import java.io.File
fun parseFileAndGetInput(): List<String> {
val filepath = "/Users/jorgenstamnes/Documents/own/AdventOfCode2021/day3/src/main/kotlin/input.txt"
return File(filepath).readLines(Charsets.UTF_8).toList()
}
fun first() {
val inputs = parseFileAndGetInput()
val one = '1'
val zero = ... | [
{
"class_path": "jorgensta__AdventOfCode2021__5e296aa/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class MainKt {\n public static final java.util.List<java.lang.String> parseFileAndGetInput();\n Code:\n 0: ldc #10 // String /Users/jorgenstamnes/Documen... |
mattfrsn__kotlinAdvent2022__f179410/src/Day04.kt | import java.io.File
fun main() {
fun part1(input: List<String>): Int {
val ranges = input.map { elfAssignments ->
elfAssignments.asRanges()
}
return ranges.count { it.first.fullyOverlaps(it.second) || it.second.fullyOverlaps(it.first) }
}
fun part2(input: List<String>):... | [
{
"class_path": "mattfrsn__kotlinAdvent2022__f179410/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
mattfrsn__kotlinAdvent2022__f179410/src/Day02.kt | import java.io.File
fun main() {
val values = mapOf<String, Int>(
"X" to 1, // pt1 Rock / 2 lose
"Y" to 2, // pt1 Paper / 2 draw
"Z" to 3 // pt1 Sissors / 2 win
)
fun determineGameResult(theirs: String, mine: String): Int {
return when(theirs.single() to mine.single()) {
... | [
{
"class_path": "mattfrsn__kotlinAdvent2022__f179410/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: anewarray #8 // class kotlin/Pair\n 4: astore_1\n 5: aload_1\... |
mustajab-ikram__Kotlin_Tutorial__f3293e9/src/main/kotlin/CollectionFunctions.kt | fun main() {
// #Remove Duplicate Strings
// There are many ways to remove duplicate strings from an array:
// Maintain the original order of items
val devs = arrayOf("Amit", "Ali", "Amit", "Sumit", "Sumit", "Himanshu")
println(devs.distinct()) // [Amit, Ali, Sumit, Himanshu]
// Maintain the original ... | [
{
"class_path": "mustajab-ikram__Kotlin_Tutorial__f3293e9/CollectionFunctionsKt$main$User.class",
"javap": "Compiled from \"CollectionFunctions.kt\"\npublic final class CollectionFunctionsKt$main$User {\n private final int id;\n\n private final java.lang.String name;\n\n private final boolean isFootballL... |
winger__team-competitions__df24b92/hashcode/y2018/qual/Main.kt | import java.io.File
import java.io.PrintWriter
import java.util.*
//val filename = "a_example"
//val filename = "b_should_be_easy"
//val filename = "c_no_hurry"
val filename = "d_metropolis"
//val filename = "e_high_bonus"
fun main(args: Array<String>) {
val sc = Scanner(File("data/$filename.in"))
val (_, _,... | [
{
"class_path": "winger__team-competitions__df24b92/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n private static final java.lang.String filename;\n\n private static int B;\n\n public static final java.lang.String getFilename();\n Code:\n 0: getstatic #11 ... |
getnahid__programing-problem-solves-kotlin__589c392/OddOccurrencesInArray.kt | /*
OddOccurrencesInArray
Find value that occurs in odd number of elements.
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 ex... | [
{
"class_path": "getnahid__programing-problem-solves-kotlin__589c392/OddOccurrencesInArrayKt.class",
"javap": "Compiled from \"OddOccurrencesInArray.kt\"\npublic final class OddOccurrencesInArrayKt {\n public static final int solution(int[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
getnahid__programing-problem-solves-kotlin__589c392/CyclicRotation.kt | /*
CyclicRotation
Rotate an array to the right by a given number of steps.
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 ... | [
{
"class_path": "getnahid__programing-problem-solves-kotlin__589c392/CyclicRotationKt.class",
"javap": "Compiled from \"CyclicRotation.kt\"\npublic final class CyclicRotationKt {\n public static final int[] solution(int[], int);\n Code:\n 0: aload_0\n 1: ldc #9 // ... |
getnahid__programing-problem-solves-kotlin__589c392/BinaryGap.kt | /*
BinaryGap
Find longest sequence of zeros in binary representation of an integer.
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, number 9 has binary representation 1001 and contains a binary... | [
{
"class_path": "getnahid__programing-problem-solves-kotlin__589c392/BinaryGapKt.class",
"javap": "Compiled from \"BinaryGap.kt\"\npublic final class BinaryGapKt {\n public static final int solution(int);\n Code:\n 0: iload_0\n 1: invokestatic #12 // Method java/lang/Integer... |
BioniCosmos__neko-programming-class__5d6a15f/lesson-3_dynamic-programming/0-1-knapsack-problem/memoization/main.kt | import kotlin.math.max
fun main() {
var tmp = readLine()!!.split(' ')
val n = tmp[0].toInt()
val balance = tmp[1].toInt()
val values = Array(n) { 0 }
val like = Array(n) { 0 }
val rec = Array(n) { Array(balance + 1) { 0 } }
for (i in 0 until n) {
tmp = readLine()!!.split(' ')
... | [
{
"class_path": "BioniCosmos__neko-programming-class__5d6a15f/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class MainKt {\n public static final void main();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readLine:()Ljava/lang/String;\n 3: dup... |
darwineee__adventOfCode2022__f4354b8/src/main/kotlin/Puzzle5.kt | import java.io.File
private val numberRegex = "\\d+".toRegex()
/**
* With this puzzle we do not use stack data structure in part 1, even though it is maybe easier.
* Because I want to keep most common logic from both part of the puzzle.
*/
fun puzzle5(args: Array<String>, isOnWrongShip: Boolean) {
val graphSta... | [
{
"class_path": "darwineee__adventOfCode2022__f4354b8/Puzzle5Kt.class",
"javap": "Compiled from \"Puzzle5.kt\"\npublic final class Puzzle5Kt {\n private static final kotlin.text.Regex numberRegex;\n\n public static final void puzzle5(java.lang.String[], boolean);\n Code:\n 0: aload_0\n 1: l... |
darwineee__adventOfCode2022__f4354b8/src/main/kotlin/Puzzle3.kt | import java.io.File
fun puzzle3Part1(args: Array<String>) {
var sum = 0
File(args[0])
.readLines()
.forEach {
val commonItem = it.toCharArray().getCommonItem()
if (commonItem != null) {
sum += commonItem.toPriorityPoint()
}
}
print... | [
{
"class_path": "darwineee__adventOfCode2022__f4354b8/Puzzle3Kt.class",
"javap": "Compiled from \"Puzzle3.kt\"\npublic final class Puzzle3Kt {\n public static final void puzzle3Part1(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: in... |
HarshCasper__NeoAlgo__4f1e5bd/Kotlin/Maths/HappyNumber.kt | /*
A number is called happy if it leads to 1 after a sequence of steps
wherein each step number is replaced by the sum of squares of its digit
that is if we start with Happy Number and keep replacing it with digits square sum, we reach 1.
Examples of Happy numbers are:- 1, 7, 10, 13, 19, 23, 28, 31, 32, 44, 49, 68, 70... | [
{
"class_path": "HarshCasper__NeoAlgo__4f1e5bd/HappyNumberKt.class",
"javap": "Compiled from \"HappyNumber.kt\"\npublic final class HappyNumberKt {\n public static final int squaredSum(int);\n Code:\n 0: iconst_0\n 1: istore_1\n 2: iload_0\n 3: istore_2\n 4: iload_2\n ... |
HarshCasper__NeoAlgo__4f1e5bd/Kotlin/sort/MergeSort/src/MergeSort.kt | fun mergeSort(list : MutableList<Int>) : MutableList<Int>{
// check if the given list has more than 1 elements
if (list.size > 1){
// a list to store sorted list
val sortedList = MutableList(list.size) { 0 }
// taking note of middle element of the list
val middle = list.size / 2
... | [
{
"class_path": "HarshCasper__NeoAlgo__4f1e5bd/MergeSortKt.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class MergeSortKt {\n public static final java.util.List<java.lang.Integer> mergeSort(java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
HarshCasper__NeoAlgo__4f1e5bd/Kotlin/search/TernarySearch.kt | //Kotlin program to implement ternary search using recursive approach
import java.util.*
// A function to declare ternary search
fun ternarySearch(left:Int, right:Int, key:Int, array: ArrayList<Int>): Int{
if (right >= left) {
// Finding the midterms
val mid1 = left + (right - left) / 3
v... | [
{
"class_path": "HarshCasper__NeoAlgo__4f1e5bd/TernarySearchKt.class",
"javap": "Compiled from \"TernarySearch.kt\"\npublic final class TernarySearchKt {\n public static final int ternarySearch(int, int, int, java.util.ArrayList<java.lang.Integer>);\n Code:\n 0: aload_3\n 1: ldc #1... |
HarshCasper__NeoAlgo__4f1e5bd/Kotlin/sort/RadixSort/src/RadixSort.kt | // Function to Implement Radix Sort
// The radix sorting algorithm is an integer sorting algorithm,
// that sorts by grouping numbers by their individual digits (or by their radix).
// It uses each radix/digit as a key, and implements counting sort or
// bucket sort under the hood in order to do the work of sorting.
... | [
{
"class_path": "HarshCasper__NeoAlgo__4f1e5bd/RadixSortKt.class",
"javap": "Compiled from \"RadixSort.kt\"\npublic final class RadixSortKt {\n public static final int[] radixSort(int[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String original\n 3: invokestatic ... |
HarshCasper__NeoAlgo__4f1e5bd/Kotlin/sort/QuickSort/src/QuickSort.kt | /*
QuickSort Algortihm works on Divide and Conquer Algorithm. It creates two empty arrays to hold elements less than the pivot value and
elements greater than the pivot value, and then recursively sort the sub arrays. There are two basic operations in the algorithm,
swapping items in place and partitioning a section o... | [
{
"class_path": "HarshCasper__NeoAlgo__4f1e5bd/QuickSortKt.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class QuickSortKt {\n public static final java.util.List<java.lang.Integer> quicksort(java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
mboos__advent-of-code__4477bb3/2020/day/21/allergens.kt | /**
* Solution to https://adventofcode.com/2020/day/21
*/
import java.io.File
fun main(args: Array<String>) {
var input: String = args[0]
var potentialAllergens = mutableMapOf<String, MutableSet<String>>()
var allIngredients = mutableListOf<String>()
var pattern: Regex = Regex("((\\w+ )+)\\(contains (\\w+(,... | [
{
"class_path": "mboos__advent-of-code__4477bb3/AllergensKt.class",
"javap": "Compiled from \"allergens.kt\"\npublic final class AllergensKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestat... |
mboos__advent-of-code__4477bb3/2020/day/13/bus.kt | /**
* Solution to https://adventofcode.com/2020/day/13
*/
import java.io.File
fun gcf(a: Long, b: Long): Long {
var tmp: Long
var aa = a
var bb = b
while (bb != 0L) {
tmp = aa % bb
aa = bb
bb = tmp
}
return aa
}
fun lcm(vals: List<Long>): Long {
return vals.reduce{a, b -> a*b/gcf(a,b)}
}
... | [
{
"class_path": "mboos__advent-of-code__4477bb3/BusKt.class",
"javap": "Compiled from \"bus.kt\"\npublic final class BusKt {\n public static final long gcf(long, long);\n Code:\n 0: lconst_0\n 1: lstore 4\n 3: lload_0\n 4: lstore 6\n 6: lload_2\n 7: lsto... |
kgw78__kotlin-design-patterns__24b8993/Strategy.kt | // Strategy Pattern Example
// ソートアルゴリズムのStrategyインターフェース
interface SortStrategy {
fun sort(numbers: IntArray): IntArray
}
// バブルソートアルゴリズム
class BubbleSortStrategy : SortStrategy {
override fun sort(numbers: IntArray): IntArray {
val sortedArray = numbers.clone()
val n = sortedArray.size
... | [
{
"class_path": "kgw78__kotlin-design-patterns__24b8993/StrategyKt.class",
"javap": "Compiled from \"Strategy.kt\"\npublic final class StrategyKt {\n public static final void main();\n Code:\n 0: iconst_5\n 1: newarray int\n 3: astore_1\n 4: aload_1\n 5: iconst_0\n ... |
Road-of-CODEr__stupid-week-2021__cae1df8/2021/03/07/jjeda/Sorting.kt |
// https://app.codility.com/programmers/lessons/6-sorting/distinct/
fun distinct(A: IntArray): Int {
return A.toSet().size
}
// https://app.codility.com/programmers/lessons/6-sorting/max_product_of_three/
fun maxProductOfThree(A: IntArray): Int {
val indexWithA = A.withIndex().sortedBy { it.value }
val length =... | [
{
"class_path": "Road-of-CODEr__stupid-week-2021__cae1df8/SortingKt$maxProductOfThree$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class SortingKt$maxProductOfThree$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public SortingKt$maxProductOfThree$$inlined... |
Road-of-CODEr__stupid-week-2021__cae1df8/2021/02/28/jjeda/PrefixSums.kt | // https://app.codility.com/programmers/lessons/5-prefix_sums/count_div
fun countDiv(A: Int, B: Int, K: Int): Int {
val startNumber = (A..B).firstOrNull {
it % K ==0
} ?: return 0
return (B - startNumber) / K + 1
}
// https://app.codility.com/programmers/lessons/5-prefix_sums/genomic_range_query
/*
// O(N *... | [
{
"class_path": "Road-of-CODEr__stupid-week-2021__cae1df8/PrefixSumsKt.class",
"javap": "Compiled from \"PrefixSums.kt\"\npublic final class PrefixSumsKt {\n public static final int countDiv(int, int, int);\n Code:\n 0: new #8 // class kotlin/ranges/IntRange\n 3: d... |
rogerkeays__vimcash__f6a1c67/vimcash.kt | //usr/bin/env [ $0 -nt $0.jar ] && kotlinc -d $0.jar $0; [ $0.jar -nt $0 ] && kotlin -cp $0.jar VimcashKt $@; exit 0
import java.io.File
fun String.parseAmount(account: String): Double {
return substring(22, 34).toDouble() * if (indexOf(" $account ") > 34) -1 else 1
}
fun File.calculateBalance(account: String, c... | [
{
"class_path": "rogerkeays__vimcash__f6a1c67/VimcashKt.class",
"javap": "Compiled from \"vimcash.kt\"\npublic final class VimcashKt {\n private static final kotlin.text.Regex allCapsRegex;\n\n public static final double parseAmount(java.lang.String, java.lang.String);\n Code:\n 0: aload_0\n ... |
GitProger__Alferov-Lyceum-PTHS__cb1cd6d/client/logistics.kt | import java.io.InputStreamReader
import java.net.URL
import java.util.*
import kotlin.math.absoluteValue
import java.io.File
data class Kettle(val id: Int, val room: String, var boilTime: Long, var ml: Int)
var room = "1"
var ml = 200
private const val MILLIES_IN_DAY = 86_400_000
private val start = "http://192.168.... | [
{
"class_path": "GitProger__Alferov-Lyceum-PTHS__cb1cd6d/LogisticsKt$nearKettles$$inlined$thenBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class LogisticsKt$nearKettles$$inlined$thenBy$1<T> implements java.util.Comparator {\n final java.util.Comparator $this_thenBy;\n\n final java... |
Flight552__codewars__b9fb937/src/main/kotlin/PrimeSteps.kt | //The prime numbers are not regularly spaced.
// For example from 2 to 3 the step is 1. From 3 to 5
// the step is 2. From 7 to 11 it is 4.
// Between 2 and 50 we have the following pairs of 2-steps primes:
//
//3, 5 - 5, 7, - 11, 13, - 17, 19, - 29, 31, - 41, 43
//
//We will write a function step with parameters:
//
/... | [
{
"class_path": "Flight552__codewars__b9fb937/PrimeStepsKt.class",
"javap": "Compiled from \"PrimeSteps.kt\"\npublic final class PrimeStepsKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokesta... |
Flight552__codewars__b9fb937/src/main/kotlin/RangeExtraction.kt | //A format for expressing an ordered list of
//integers is to use a comma separated list of either
//
//individual integers
//or a range of integers denoted by the
//starting integer separated from the end integer in
//the range by a dash, '-'. The range includes all
//integers in the interval including both endpoints.... | [
{
"class_path": "Flight552__codewars__b9fb937/RangeExtraction.class",
"javap": "Compiled from \"RangeExtraction.kt\"\npublic final class RangeExtraction {\n public static final RangeExtraction INSTANCE;\n\n private RangeExtraction();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
ivan-moto__30-seconds-of-kotlin__772896c/src/main/List.kt | import java.util.Objects
import kotlin.math.max
fun <T> all(list: List<T>, predicate: (T) -> Boolean): Boolean =
list.all(predicate)
fun <T> allEqual(list: List<T>): Boolean =
if (list.isEmpty()) false else list.all { it == list[0] }
fun <T> any(list: List<T>, predicate: (T) -> Boolean): Boolean =
list.a... | [
{
"class_path": "ivan-moto__30-seconds-of-kotlin__772896c/ListKt$zipAll$1.class",
"javap": "Compiled from \"List.kt\"\npublic final class ListKt$zipAll$1 implements java.util.Iterator<kotlin.Pair<? extends T, ? extends U>>, kotlin.jvm.internal.markers.KMappedMarker {\n final java.util.Iterator<T> $firstIt;... |
Prozen__AdventOfCode2018__b0e830f/day03/src/main/kotlin/Main.kt | import java.io.File
fun main() {
val strings = File(ClassLoader.getSystemResource("input.txt").file).readLines()
val field = Array(1000) { Array(1000) { 0 } }
strings.forEach {
val words = it.split(" ")
val start = words[2].dropLast(1).split(",").map { it.toInt() }
val size = words[... | [
{
"class_path": "Prozen__AdventOfCode2018__b0e830f/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 // ... |
lasp91__DigitsRecognizer_using_Kotlin__4907cbb/src/DigitsRecognizer.kt | import java.io.File
import java.util.stream.IntStream
import java.util.concurrent.atomic.AtomicInteger
data class Observation (val label: String , val Pixels: IntArray)
typealias Distance = (IntArray, IntArray) -> Int
typealias Classifier = (IntArray) -> String
typealias Observations = Array<Observation>
fun observ... | [
{
"class_path": "lasp91__DigitsRecognizer_using_Kotlin__4907cbb/DigitsRecognizerKt.class",
"javap": "Compiled from \"DigitsRecognizer.kt\"\npublic final class DigitsRecognizerKt {\n private static final kotlin.jvm.functions.Function2<int[], int[], java.lang.Integer> manhattanDistance;\n\n private static f... |
Trilgon__LearningKotlin__8273ff6/src/main/kotlin/Main.kt | import java.util.*
fun main(args: Array<String>) {
val input: StringBuilder = StringBuilder("10.3 + -2")
val queueNumbers: Queue<Double> = LinkedList<Double>()
val queueActions: Queue<Char> = LinkedList<Char>()
println('\"' + input.toString() + '\"')
prepareIn(input, queueNumbers, queueActions)
... | [
{
"class_path": "Trilgon__LearningKotlin__8273ff6/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
sukritishah15__DS-Algo-Point__1b6040f/Kotlin/DiameterBinaryTree.kt | /**
* Algorithm: Diameter of Binary Tree
* Language: Kotlin
* Input:
* Sample Binary Tree
* Output:
* Diameter of Binary Tree
* Time Complexity: O(n) as we are visiting every node once.
* Space Complexity: O(d) where d is the depth of the binary tree
*
* Sample Input:
* 8
* ... | [
{
"class_path": "sukritishah15__DS-Algo-Point__1b6040f/DiameterBinaryTreeKt.class",
"javap": "Compiled from \"DiameterBinaryTree.kt\"\npublic final class DiameterBinaryTreeKt {\n public static final void main();\n Code:\n 0: new #8 // class BinaryTree\n 3: dup\n ... |
sukritishah15__DS-Algo-Point__1b6040f/Kotlin/LongestCommonSubSequence.kt | /**
* Algorithm: Longest Common Sub-Sequence using Dynamic Programming
* Language: Kotlin
* Input:
* String1 and String2 -> Two Strings
* Output:
* Integer -> The longest common sub-sequence of String1 and String2
* Time Complexity: O(nStr1*nStr2)
* Space Complexity: O(nStr1*nStr2)
*
* Sample... | [
{
"class_path": "sukritishah15__DS-Algo-Point__1b6040f/LongestCommonSubSequence.class",
"javap": "Compiled from \"LongestCommonSubSequence.kt\"\npublic final class LongestCommonSubSequence {\n public LongestCommonSubSequence();\n Code:\n 0: aload_0\n 1: invokespecial #8 // M... |
sukritishah15__DS-Algo-Point__1b6040f/Kotlin/MergeSort.kt | /**
* Algorithm: Merge Sorting
* Language: Kotlin
* Input:
* a) n: Size of Array
* b) arr: Integer Array of size n
* Output:
* a) Array before applying Merge Sorting
* b) Array after applying Merge Sorting
* Time Complexity: O(n * log n)
* Space Complexity: O(n)
*
* Sample Input:
* Enter th... | [
{
"class_path": "sukritishah15__DS-Algo-Point__1b6040f/MergeSort$Companion.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class MergeSort$Companion {\n private MergeSort$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<ini... |
dlew__kotlin-riddler__55e9d2f/src/binary.kt | /**
* Proof for the Riddler problem from March 18, 2016
*
* http://fivethirtyeight.com/features/can-you-best-the-mysterious-man-in-the-trench-coat/
*/
fun main(args: Array<String>) {
findBestOutcome(1, 1000, 9)
}
fun findBestOutcome(lowerBound: Int, upperBound: Int, maxGuesses: Int, verbose: Boolean = false) {
... | [
{
"class_path": "dlew__kotlin-riddler__55e9d2f/BinaryKt.class",
"javap": "Compiled from \"binary.kt\"\npublic final class BinaryKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
algorithm-archivists__algorithm-archive__38c40e0/contents/thomas_algorithm/code/kotlin/thomas.kt | private fun thomas(a: DoubleArray, b: DoubleArray, c: DoubleArray, d: DoubleArray): DoubleArray {
val cPrime = c.clone()
val x = d.clone()
val size = a.size
cPrime[0] /= b[0]
x[0] /= b[0]
for (i in 1 until size) {
val scale = 1.0 / (b[i] - cPrime[i - 1] * a[i])
cPrime[i] *= scale... | [
{
"class_path": "algorithm-archivists__algorithm-archive__38c40e0/ThomasKt.class",
"javap": "Compiled from \"thomas.kt\"\npublic final class ThomasKt {\n private static final double[] thomas(double[], double[], double[], double[]);\n Code:\n 0: aload_2\n 1: invokevirtual #10 ... |
victorYghor__Kotlin-Problems__0d30e37/Create-an-euphonious-word/src/main/kotlin/Main.kt | val vowels: List<Char> = listOf('a', 'e', 'i', 'o', 'u', 'y')
val consonants: List<Char> = listOf('b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'z')
fun fixClusterVowels(cluster: String): String {
val listOfVowels: MutableList<Char> = cluster.toMutableList()
va... | [
{
"class_path": "victorYghor__Kotlin-Problems__0d30e37/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n private static final java.util.List<java.lang.Character> vowels;\n\n private static final java.util.List<java.lang.Character> consonants;\n\n public static final java.u... |
joshpierce__advent-of-code-22__fd5414c/src/Day07.kt | import java.io.File
// I'm not proud of this, but it works.
fun main() {
var lines: List<String> = File("Day07.txt").readLines()
var fileSystem: MutableList<Obj> = mutableListOf()
fileSystem.add(Obj("/", ObjectType.Directory, 0))
var currentObj: Obj = fileSystem[0]
for (i in 0..line... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day07Kt$main$$inlined$sortBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class Day07Kt$main$$inlined$sortBy$1<T> implements java.util.Comparator {\n public Day07Kt$main$$inlined$sortBy$1();\n Code:\n 0: aload_0\n ... |
joshpierce__advent-of-code-22__fd5414c/src/Day15.kt | import java.io.File
import kotlin.collections.fill
import java.math.BigInteger
// So... this returned a couple possible solutions for part 2, the first one that came out ended up being correct
// and it's 01:28a so I'm going to bed. Hopefully I'll find time tomorrow to come back to this to clean it up.
fun main() { ... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day15Kt.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class Day15Kt {\n public static final void main();\n Code:\n 0: iconst_0\n 1: istore_0\n 2: ldc #7 // int 4000000\n 4: istore_1\n ... |
joshpierce__advent-of-code-22__fd5414c/src/Day13.kt | import java.io.File
fun main() {
var directions: List<String> = File("Day13.txt").readLines()
var pairs = directions.chunked(3).map { Pair(it[0], it[1])}
var validIndexes: MutableList<Int> = mutableListOf()
var allPackets: MutableList<Any> = mutableListOf()
pairs.forEachIndexed { i... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day13Kt.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class Day13Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
joshpierce__advent-of-code-22__fd5414c/src/Day03.kt | import java.io.File
fun main() {
// read the lines from the file
var lines: List<String> = File("Day03.txt").readLines()
// sum up the total of all priorities
var total: Int = lines.map {
// Find the priority by intersecting the two lists of items to get the common item
//... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: aconst_null\n 1: astore_0\n 2: new #8 // class java/io/File\n 5: d... |
joshpierce__advent-of-code-22__fd5414c/src/Day02.kt | import java.io.File
fun main() {
// read the lines from the file
var lines: List<String> = File("Day02.txt").readLines()
// setup a new list of Games so we can calculate the outcome of each
var games: MutableList<Game> = lines.map {
var parts = it.split(" ")
return@map Game(par... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
joshpierce__advent-of-code-22__fd5414c/src/Day08.kt | import java.io.File
fun main() {
var lines: List<String> = File("Day08.txt").readLines()
// Setup our Forest List of Lists
var forest = lines.map { it.chunked(1) }
// Variable for Tracking Tree Score in Part Two
var maxTreeScore = 0
// Prints out your forest for you to see
/... | [
{
"class_path": "joshpierce__advent-of-code-22__fd5414c/Day08Kt.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class Day08Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
ArtyomKopan__Formal_Languages__7aa1075/Практика 1/Coding/src/main/kotlin/Main.kt | import java.nio.file.Files
import java.nio.file.Path
fun coding(grammar: List<String>): Map<String, Int> {
val codes = mutableMapOf(
":" to 1,
"(" to 2,
")" to 3,
"." to 4,
"*" to 5,
";" to 6,
"," to 7,
"#" to 8,
"[" to 9,
"]" to 10,
... | [
{
"class_path": "ArtyomKopan__Formal_Languages__7aa1075/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final java.util.Map<java.lang.String, java.lang.Integer> coding(java.util.List<java.lang.String>);\n Code:\n 0: aload_0\n 1: ldc #... |
alexaugustobr__kotlin-exercises__c70e56d/src/main/kotlin/exs/FunWithVowels.kt |
val vowelList = listOf<Char>('a', 'e', 'i', 'o', 'u')
fun main(args: Array<String>) {
val vowel = readLine()!!
//val vowel = "aeiouaeiouaeiouaaeeiioouu"
println(longestSubsequence(vowel))
}
fun longestSubsequence(searchVowel: String): Int {
val chars = searchVowel.toCharArray()
val lastIndex = chars.size
v... | [
{
"class_path": "alexaugustobr__kotlin-exercises__c70e56d/FunWithVowelsKt.class",
"javap": "Compiled from \"FunWithVowels.kt\"\npublic final class FunWithVowelsKt {\n private static final java.util.List<java.lang.Character> vowelList;\n\n public static final java.util.List<java.lang.Character> getVowelLis... |
Scholar17__aoc-2022-in-kotlin__d3d79fb/src/Day04.kt | import java.io.File
fun main() {
fun parseInputCommaAndNewLine(input: String): List<String> {
return input.split(",", "\r\n")
}
fun parseInputDash(input: String): List<Int> {
return input.split("-").map { str ->
str.toInt()
}
}
val fileName =
"src/Day0... | [
{
"class_path": "Scholar17__aoc-2022-in-kotlin__d3d79fb/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/Day04_sample.txt\n 2: astore_0\n 3: new #... |
Scholar17__aoc-2022-in-kotlin__d3d79fb/src/Day03_2021.kt | import java.io.File
fun main() {
fun parseInput(input: String): List<List<Int>> {
return input.split("\n").map { bit ->
bit.map {
it.digitToIntOrNull() ?: 0
}
}
}
val filename =
"src/Day03_sample_2021.txt"
// "src/Day03_quiz_2021.txt"... | [
{
"class_path": "Scholar17__aoc-2022-in-kotlin__d3d79fb/Day03_2021Kt$main$minCounter$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class Day03_2021Kt$main$minCounter$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Integer, java.lang.Integer> {... |
Scholar17__aoc-2022-in-kotlin__d3d79fb/src/Day03.kt | import java.io.File
import kotlin.math.absoluteValue
fun main() {
fun parseInput(input: String): List<String> {
return input.split("\r\n").map { value ->
value
}
}
val fileName =
// "src/Day03_sample.txt"
"src/Day03_quiz.txt"
val inputText = File(fileName).readT... | [
{
"class_path": "Scholar17__aoc-2022-in-kotlin__d3d79fb/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/Day03_quiz.txt\n 2: astore_0\n 3: new #10... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day15.kt | import kotlin.String
import kotlin.collections.List
object Day15 {
fun part1(input: List<String>): String {
val steps = input[0].split(",").map { it.trim() }
return steps.sumOf { hash(it) }.toString()
}
private fun hash(it: String): Int {
return it.toCharArray().fold(0) { acc, c -... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day15.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class Day15 {\n public static final Day15 INSTANCE;\n\n private Day15();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day1.kt | import kotlin.String
import kotlin.collections.List
object Day1 {
fun part1(input: List<String>): String = input.sumOf(::findFirstAndLastDigit).toString()
private fun findFirstAndLastDigit(i: String): Int {
val digits = i.filter { it.isDigit() }
return (digits.take(1) + digits.takeLast(1)).toI... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day1.class",
"javap": "Compiled from \"Day1.kt\"\npublic final class Day1 {\n public static final Day1 INSTANCE;\n\n private Day1();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day20.kt | object Day20 {
enum class ModuleType {
BROADCASTER,
CONJUNCTION,
FLIP_FLOP
}
enum class PulseType {
HIGH,
LOW
}
data class Pulse(val type: PulseType, val sender: String)
data class Module(
val id: String,
val type: ModuleType,
va... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day20$Module.class",
"javap": "Compiled from \"Day20.kt\"\npublic final class Day20$Module {\n public static final Day20$Module$Companion Companion;\n\n private final java.lang.String id;\n\n private final Day20$ModuleType type;\n\n private final ja... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day3.kt | import kotlin.String
import kotlin.collections.List
object Day3 {
data class NumberPosition(
val number: Int,
val start: Int,
val end: Int,
val row: Int
)
data class Symbol(val symbol: Char, val coordinate: Coordinate)
data class Coordinate(val x: Int, val y: Int)
... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day3$Coordinate.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class Day3$Coordinate {\n private final int x;\n\n private final int y;\n\n public Day3$Coordinate(int, int);\n Code:\n 0: aload_0\n 1: invokespecial #9 ... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day10.kt | import kotlin.String
import kotlin.collections.List
object Day10 {
data class Coordinate(val x: Int, val y: Int)
data class Node(val coordinate: Coordinate, val pipe: String, val connections: List<Coordinate>)
fun part1(input: List<String>): String {
val graph = parse(input)
val nodesInLo... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day10$Node.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class Day10$Node {\n private final Day10$Coordinate coordinate;\n\n private final java.lang.String pipe;\n\n private final java.util.List<Day10$Coordinate> connections;\n\n public... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day17.kt | import java.util.*
import kotlin.String
import kotlin.collections.List
import kotlin.math.min
object Day17 {
enum class Direction {
UP,
DOWN,
LEFT,
RIGHT
}
data class CurrentStepInformation(
val currentCoordinate: Coordinate,
val currentDirection: Direction,... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day17.class",
"javap": "Compiled from \"Day17.kt\"\npublic final class Day17 {\n public static final Day17 INSTANCE;\n\n private Day17();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day19.kt | import kotlin.String
import kotlin.collections.List
object Day19 {
private const val MIN_STATES = 1L
private const val MAX_STATES = 4000L
private const val ACCEPTED_STATE = "A"
private const val REJECTED_STATE = "R"
private const val START_STATE = "in"
data class Part(val ratings: Map<String, ... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day19$Workflow.class",
"javap": "Compiled from \"Day19.kt\"\npublic final class Day19$Workflow {\n private final java.util.Map<java.lang.String, Day19$Job> jobs;\n\n public Day19$Workflow(java.util.Map<java.lang.String, Day19$Job>);\n Code:\n ... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day7.kt | import kotlin.String
import kotlin.collections.List
object Day7 {
interface CardHand : Comparable<CardHand> {
val maxSimilarCards: Int
val bid: Long
val secondMaxSimilarCards: Int
val cards: CharArray
val cardValues: Map<Char, Int>
fun score(rank: Int): Long {
... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day7$CardHand$DefaultImpls$compareTo$$inlined$thenBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class Day7$CardHand$DefaultImpls$compareTo$$inlined$thenBy$1<T> implements java.util.Comparator {\n final java.util.Comparator $this... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day13.kt | import kotlin.String
import kotlin.collections.List
object Day13 {
private const val NORMAL_MULTIPLIER = 100
private const val TRANSPOSED_MULTIPLIER = 1
fun part1(input: List<String>): String {
val grids = parseGrids(input)
return grids.sumOf { grid ->
// Transposed is actuall... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day13.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class Day13 {\n public static final Day13 INSTANCE;\n\n private static final int NORMAL_MULTIPLIER;\n\n private static final int TRANSPOSED_MULTIPLIER;\n\n private Day13();\n Code:\... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day23.kt | import kotlin.String
import kotlin.collections.List
import Day17.Coordinate
import java.util.*
import kotlin.math.max
object Day23 {
/**
* A more compact representation of a path than a list of coordinates.
*/
data class Segment(val steps: Int, val start: Coordinate, val end: Coordinate)
fun pa... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day23$StepInformation.class",
"javap": "Compiled from \"Day23.kt\"\npublic final class Day23$StepInformation {\n private final Day23$Segment node;\n\n private final java.util.Set<Day23$Segment> visited;\n\n private final int steps;\n\n public Day23$... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day8.kt | import kotlin.String
import kotlin.collections.List
object Day8 {
data class Node(var left: Node?, var right: Node?, val key: String)
data class DesertMap(val directions: CharArray, val root: Node?) {
companion object {
fun parse(input: List<String>): DesertMap {
val directi... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day8$DesertMap$Companion.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class Day8$DesertMap$Companion {\n private Day8$DesertMap$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Obj... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day2.kt | import kotlin.String
import kotlin.collections.List
object Day2 {
data class Cube(
val color: String,
val count: Int
)
data class Game(
val id: Int,
val cubePulls: List<List<Cube>>
) {
companion object {
fun parseGame(s: String): Game {
... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day2$Game.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class Day2$Game {\n public static final Day2$Game$Companion Companion;\n\n private final int id;\n\n private final java.util.List<java.util.List<Day2$Cube>> cubePulls;\n\n public Da... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day5.kt | import java.lang.Long.min
import kotlin.String
import kotlin.collections.List
object Day5 {
data class Range(val start: Long, val end: Long)
data class RangeMapping(val destinationRangeStart: Long, val sourceRangeStart: Long, val rangeLength: Long) {
fun next(id: Long): Long {
return if (so... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day5.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class Day5 {\n public static final Day5 INSTANCE;\n\n private Day5();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day16.kt | import kotlin.String
import kotlin.collections.List
public object Day16 {
enum class Direction {
UP,
DOWN,
LEFT,
RIGHT
}
public fun part1(input: List<String>): String {
val startCoordinate = Day10.Coordinate(0, 0)
val startDirection = Direction.RIGHT
... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day16$Direction.class",
"javap": "Compiled from \"Day16.kt\"\npublic final class Day16$Direction extends java.lang.Enum<Day16$Direction> {\n public static final Day16$Direction UP;\n\n public static final Day16$Direction DOWN;\n\n public static final... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day11.kt | import kotlin.String
import kotlin.collections.List
object Day11 {
fun part1(input: List<String>): String {
val pairs = generatePairs(input)
val emptyRows = generateEmptyRows(input)
val emptyColumns = generateEmptyColumns(input)
return pairs.sumOf { (a, b) ->
manhattanD... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day11.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class Day11 {\n public static final Day11 INSTANCE;\n\n private Day11();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day18.kt | import java.util.*
import kotlin.String
import kotlin.collections.List
object Day18 {
data class Segment(val coordinates: Set<Day17.Coordinate>) {
val minX = coordinates.minOf { it.x }
val maxX = coordinates.maxOf { it.x }
val minY = coordinates.minOf { it.y }
val maxY = coordinates... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day18$Direction.class",
"javap": "Compiled from \"Day18.kt\"\npublic final class Day18$Direction extends java.lang.Enum<Day18$Direction> {\n public static final Day18$Direction UP;\n\n public static final Day18$Direction DOWN;\n\n public static final... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day4.kt | import kotlin.String
import kotlin.collections.List
import kotlin.math.pow
object Day4 {
data class CardData(val cardIndex: Int, val winningNumberCount: Int) {
companion object {
fun parseCardData(input: String): CardData {
val (cardInformation, numberInformation) = input.split(... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day4$CardData$Companion.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class Day4$CardData$Companion {\n private Day4$CardData$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day14.kt | import Day13.transpose
import kotlin.String
import kotlin.collections.List
object Day14 {
private const val ROUNDED = 'O'
fun part1(input: List<String>): String {
val transposedDish = transpose(input)
return transposedDish.sumOf { row ->
val rolled = roll(row)
rolled.rev... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day14.class",
"javap": "Compiled from \"Day14.kt\"\npublic final class Day14 {\n public static final Day14 INSTANCE;\n\n private static final char ROUNDED;\n\n private Day14();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day6.kt | import kotlin.String
import kotlin.collections.List
import kotlin.math.*
object Day6 {
fun part1(input: List<String>): String {
val parseNumbers: (String, String) -> List<Int> = { str: String, prefix: String ->
str.replace(prefix, "")
.trim()
.split("\\s+".toRege... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day6.class",
"javap": "Compiled from \"Day6.kt\"\npublic final class Day6 {\n public static final Day6 INSTANCE;\n\n private Day6();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n... |
cbrentharris__kotlin-kringle__f689f8b/src/main/kotlin/Day9.kt | import kotlin.String
import kotlin.collections.List
object Day9 {
fun part1(input: List<String>): String {
return parse(input)
.sumOf { extrapolate(it) { deltas, ret -> deltas.last() + ret } }.toString()
}
fun part2(input: List<String>): String {
return parse(input)
... | [
{
"class_path": "cbrentharris__kotlin-kringle__f689f8b/Day9.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class Day9 {\n public static final Day9 INSTANCE;\n\n private Day9();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n... |
skarlman__AdventOfCode2022_kotlin__ef15752/src/Day03.kt | import java.io.File
// Problem:
// https://adventofcode.com/2022/day/3
// More solutions:
// https://www.competitivecoders.com/ProgrammingCompetitions/advent-of-code/advent-of-code/2022/day-3/
fun main() {
fun part1(input: List<String>): Int {
return input.map { row ->
val parts = row.chun... | [
{
"class_path": "skarlman__AdventOfCode2022_kotlin__ef15752/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day03\n 2: invokestatic #12 // Method re... |
skarlman__AdventOfCode2022_kotlin__ef15752/src/Day02.kt | import java.io.File
// Problem:
// https://adventofcode.com/2022/day/2
// More solutions:
// https://www.competitivecoders.com/ProgrammingCompetitions/advent-of-code/advent-of-code/2022/day-2/
fun main() {
fun part1(input: List<String>): Int {
val scores = mapOf(
Pair("A", "X") to 1 + 3,
... | [
{
"class_path": "skarlman__AdventOfCode2022_kotlin__ef15752/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day02\n 2: invokestatic #12 // Method re... |
wenvelope__OnlineJudge__4a5b258/src/main/kotlin/QuickSort.kt | import java.util.*
fun main() {
val mutableList = arrayListOf(3,23,5435,2323,43,32,43)
println(mutableList)
println( mutableList.quickSort().let { mutableList })
}
/**
*快排
* 思想：分治
* 1.从大到小每一层都一分为二 分到不能再分为止
* 2.对于每一个小部分 都选定一个和标志位 使得标志位的左边都小于右边
*/
fun MutableList<Int>.quickSort() {
if (this.isEm... | [
{
"class_path": "wenvelope__OnlineJudge__4a5b258/QuickSortKt.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class QuickSortKt {\n public static final void main();\n Code:\n 0: bipush 7\n 2: anewarray #8 // class java/lang/Integer\n 5: astore_... |
20Koen02__AdventOfCode__e260249/2021/08-kt/main.kt | import java.io.File
import kotlin.collections.listOf
typealias Entry = List<List<String>>
val DIGS =
listOf("abcdeg", "ab", "acdfg", "abcdf", "abef", "bcdef", "bcdefg", "abd", "abcdefg", "abcdef")
fun readLines(): List<Entry> {
return File("in.txt").bufferedReader().readLines().map { l ->
l.split(" | ").ma... | [
{
"class_path": "20Koen02__AdventOfCode__e260249/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class MainKt {\n private static final java.util.List<java.lang.String> DIGS;\n\n public static final java.util.List<java.lang.String> getDIGS();\n Code:\n 0: getstatic #12 ... |
ummen-sherry__adventofcode2023__c91c1b6/src/main/kotlin/Day1.kt | import java.io.File
private val numberRegex = Regex("""(\d|one|two|three|four|five|six|seven|eight|nine)""")
private val numberReverseRegex = Regex("""(\d|enin|thgie|neves|xis|evif|ruof|eerht|owt|eno)""")
private val validNumbers = mapOf(
"1" to 1,
"2" to 2,
"3" to 3,
"4" to 4,
"5" to 5,
"6" t... | [
{
"class_path": "ummen-sherry__adventofcode2023__c91c1b6/Day1Kt.class",
"javap": "Compiled from \"Day1.kt\"\npublic final class Day1Kt {\n private static final kotlin.text.Regex numberRegex;\n\n private static final kotlin.text.Regex numberReverseRegex;\n\n private static final java.util.Map<java.lang.St... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.