kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
Laomedeia__Java8InAction__0dcd843/src/main/java/leetcode/a167_twoSumInputSortArray_SIMPLE/Solution.kt | package leetcode.a167_twoSumInputSortArray_SIMPLE
/**
* 两数之和 II - 输入有序数组
*
给定一个已按照升序排列 的有序数组，找到两个数使得它们相加之和等于目标数。
函数应该返回这两个下标值 index1 和 index2，其中 index1 必须小于 index2。
说明:
返回的下标值（index1 和 index2）不是从零开始的。
你可以假设每个输入只对应唯一的答案，而且你不可以重复使用相同的元素。
示例:
输入: numbers = [2, 7, 11, 15], target = 9
输出: [1,2]
解释: 2 与 7 之和等于目标数 9 。因此... | [
{
"class_path": "Laomedeia__Java8InAction__0dcd843/leetcode/a167_twoSumInputSortArray_SIMPLE/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class leetcode.a167_twoSumInputSortArray_SIMPLE.Solution {\n public leetcode.a167_twoSumInputSortArray_SIMPLE.Solution();\n Code:\n 0:... |
Laomedeia__Java8InAction__0dcd843/src/main/java/leetcode/a392_isSubSequence_HARD/Solution.kt | package leetcode.a392_isSubSequence_HARD
/**
* 判断子序列
*
* 给定字符串 s 和 t ，判断 s 是否为 t 的子序列。
* 你可以认为 s 和 t 中仅包含英文小写字母。字符串 t 可能会很长（长度 ~= 500,000），而 s 是个短字符串（长度 <=100）。
*
* 字符串的一个子序列是原始字符串删除一些（也可以不删除）字符而不改变剩余字符相对位置形成的新字符串。（例如，"ace"是"abcde"的一个子序列，而"aec"不是）。
*
* 示例 1:
* s = "abc", t = "ahbgdc"
* 返回 true.
*
* 示例 2:
... | [
{
"class_path": "Laomedeia__Java8InAction__0dcd843/leetcode/a392_isSubSequence_HARD/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class leetcode.a392_isSubSequence_HARD.Solution {\n public leetcode.a392_isSubSequence_HARD.Solution();\n Code:\n 0: aload_0\n 1: invokes... |
scp504677840__JavaKotlin__36f9b85/Collection/List/part06.kt | package part06
import java.util.TreeSet
fun main(args: Array<String>) {
/*val treeSet = TreeSet<String>()
treeSet.add("adbbcc")
treeSet.add("abbabc")
treeSet.add("acbcc")
treeSet.add("abbc")
treeSet.add("abcc")
val iterator = treeSet.iterator()
while (iterator.hasNext()) {
p... | [
{
"class_path": "scp504677840__JavaKotlin__36f9b85/part06/Part06Kt.class",
"javap": "Compiled from \"part06.kt\"\npublic final class part06.Part06Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: in... |
jaypandya__dsa__5f94df9/src/main/java/org/example/BiPartiteGraph.kt | package org.example
class Solution {
enum class Color {
Red, Blue, None;
}
fun isBipartite(graph: Array<IntArray>): Boolean {
val queue = ArrayDeque<Int>()
val colorArray = Array(graph.size) { Color.None }
for (index in colorArray.indices) {
if (colorArray[index... | [
{
"class_path": "jaypandya__dsa__5f94df9/org/example/BiPartiteGraphKt.class",
"javap": "Compiled from \"BiPartiteGraph.kt\"\npublic final class org.example.BiPartiteGraphKt {\n public static final int[][] parseGraph(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
regen-network__regen-kotlin-sdk__ea05372/ceres-base/src/main/kotlin/ceres/geo/Selection.kt | package ceres.geo
import kotlin.math.*
// Floyd-Rivest selection algorithm from https://github.com/mourner/quickselect
fun quickselect(
arr: Array<Double>,
k: Int,
left: Int = 0,
right: Int = arr.size - 1,
compare: Comparator<Double> = defaultCompare
) {
quickselectStep(arr, k, left, right, c... | [
{
"class_path": "regen-network__regen-kotlin-sdk__ea05372/ceres/geo/SelectionKt$defaultCompare$1.class",
"javap": "Compiled from \"Selection.kt\"\npublic final class ceres.geo.SelectionKt$defaultCompare$1 implements java.util.Comparator<java.lang.Double> {\n ceres.geo.SelectionKt$defaultCompare$1();\n C... |
iluu__algs-progfun__a89b0d3/src/main/kotlin/com/hackerrank/FormingAMagicSquare.kt | package com.hackerrank
import java.util.*
val magicSquares = arrayOf(
intArrayOf(8, 1, 6, 3, 5, 7, 4, 9, 2),
intArrayOf(4, 3, 8, 9, 5, 1, 2, 7, 6),
intArrayOf(2, 9, 4, 7, 5, 3, 6, 1, 8),
intArrayOf(6, 7, 2, 1, 5, 9, 8, 3, 4),
intArrayOf(6, 1, 8, 7, 5, 3, 2, 9, 4),
intAr... | [
{
"class_path": "iluu__algs-progfun__a89b0d3/com/hackerrank/FormingAMagicSquareKt.class",
"javap": "Compiled from \"FormingAMagicSquare.kt\"\npublic final class com.hackerrank.FormingAMagicSquareKt {\n private static final int[][] magicSquares;\n\n public static final int[][] getMagicSquares();\n Code:... |
iluu__algs-progfun__a89b0d3/src/main/kotlin/com/hackerrank/ConnectedCellsInAGrid.kt | package com.hackerrank
import java.util.*
fun main(args: Array<String>) {
val scan = Scanner(System.`in`)
val n = scan.nextInt()
val m = scan.nextInt()
val arr = Array(n, { Array(m, { scan.nextInt() }) })
println(sizeOfMaxRegion(Board(arr, n, m)))
}
fun sizeOfMaxRegion(board: Board): Int {
... | [
{
"class_path": "iluu__algs-progfun__a89b0d3/com/hackerrank/ConnectedCellsInAGridKt.class",
"javap": "Compiled from \"ConnectedCellsInAGrid.kt\"\npublic final class com.hackerrank.ConnectedCellsInAGridKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc ... |
booknara__playground__04dcf50/src/main/java/com/booknara/problem/graph/EvaluateDivisionKt.kt | package com.booknara.problem.graph
/**
* 399. Evaluate Division (Medium)
* https://leetcode.com/problems/evaluate-division/
*/
class EvaluateDivisionKt {
// T:O(v+e), S:O(v+e)
fun calcEquation(equations: List<List<String>>, values: DoubleArray, queries: List<List<String>>): DoubleArray {
// build a graph fo... | [
{
"class_path": "booknara__playground__04dcf50/com/booknara/problem/graph/EvaluateDivisionKtKt.class",
"javap": "Compiled from \"EvaluateDivisionKt.kt\"\npublic final class com.booknara.problem.graph.EvaluateDivisionKtKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n... |
booknara__playground__04dcf50/src/main/java/com/booknara/problem/math/ValidSquare.kt | package com.booknara.problem.math
/**
* 593. Valid Square (Medium)
* https://leetcode.com/problems/valid-square/
*/
class ValidSquare {
// T:O(1), S:O(1)
fun validSquare(p1: IntArray, p2: IntArray, p3: IntArray, p4: IntArray): Boolean {
// input check, there are four points
val points = arra... | [
{
"class_path": "booknara__playground__04dcf50/com/booknara/problem/math/ValidSquareKt.class",
"javap": "Compiled from \"ValidSquare.kt\"\npublic final class com.booknara.problem.math.ValidSquareKt {\n public static final void main();\n Code:\n 0: new #8 // class com/boo... |
booknara__playground__04dcf50/src/main/java/com/booknara/practice/kotlin/higherorderfunction/Groceries.kt | package com.booknara.practice.kotlin.higherorderfunction
data class Grocery(
val name: String,
val category: String,
val unit: String,
val unitPrice: Double,
val quantity: Int)
fun main(args: Array<String>) {
val groceries = listOf<Grocery>(
Grocery("Tomatoes", ... | [
{
"class_path": "booknara__playground__04dcf50/com/booknara/practice/kotlin/higherorderfunction/GroceriesKt.class",
"javap": "Compiled from \"Groceries.kt\"\npublic final class com.booknara.practice.kotlin.higherorderfunction.GroceriesKt {\n public static final void main(java.lang.String[]);\n Code:\n ... |
h-j-k__advent16__5ffa381/src/main/kotlin/com/advent/of/code/hjk/Day22.kt | package com.advent.of.code.hjk
import kotlin.math.abs
object Day22 {
private fun parse(line: String): Node? =
"/dev/grid/node-x(?<x>\\d+)-y(?<y>\\d+)\\s+(?<size>\\d+)T\\s+(?<used>\\d+)T.+".toRegex()
.matchEntire(line)?.destructured
?.let { (x, y, size, used) -> Node(x.toInt(), y.t... | [
{
"class_path": "h-j-k__advent16__5ffa381/com/advent/of/code/hjk/Day22$Node.class",
"javap": "Compiled from \"Day22.kt\"\npublic final class com.advent.of.code.hjk.Day22$Node {\n private final int x;\n\n private final int y;\n\n private final int size;\n\n private final int used;\n\n private final int ... |
h-j-k__advent16__5ffa381/src/main/kotlin/com/advent/of/code/hjk/Day24.kt | package com.advent.of.code.hjk
import java.util.ArrayDeque
object Day24 {
private fun parse(input: List<String>): List<List<Position>> = input.indices.map { y ->
input[0].indices.map { x -> Position(x = x, y = y, value = input[y][x].toString()) }
}
private fun Position.from(other: Position, boar... | [
{
"class_path": "h-j-k__advent16__5ffa381/com/advent/of/code/hjk/Day24$Position.class",
"javap": "Compiled from \"Day24.kt\"\nfinal class com.advent.of.code.hjk.Day24$Position {\n private final int x;\n\n private final int y;\n\n private final java.lang.String value;\n\n private final boolean isValid;\n... |
h-j-k__advent16__5ffa381/src/main/kotlin/com/advent/of/code/hjk/Day23.kt | package com.advent.of.code.hjk
object Day23 {
private fun process(input: List<String>, initial: Map<String, Int>): Int {
val copy = input.toMutableList()
val registers = initial.toMutableMap()
var i = 0
while (i < copy.size) {
val values = copy[i].split(" ")
... | [
{
"class_path": "h-j-k__advent16__5ffa381/com/advent/of/code/hjk/Day23.class",
"javap": "Compiled from \"Day23.kt\"\npublic final class com.advent.of.code.hjk.Day23 {\n public static final com.advent.of.code.hjk.Day23 INSTANCE;\n\n private com.advent.of.code.hjk.Day23();\n Code:\n 0: aload_0\n ... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day16.kt | package cz.wrent.advent
import java.lang.Integer.max
import java.util.Deque
import java.util.LinkedList
fun main() {
// println(partOne(test))
// val result = partOne(input)
// println("16a: $result")
println(partTwo(test))
println("16b: ${partTwo(input)}")
}
private fun partOne(input: String): Int {
val valves =... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day16Kt$recursiveSolutionWithElephant$$inlined$sortedByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class cz.wrent.advent.Day16Kt$recursiveSolutionWithElephant$$inlined$sortedByDescending$1<T> implements ja... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day9.kt | package cz.wrent.advent
fun main() {
println(partOne(test))
val result = partOne(input)
println("9a: $result")
println(partTwo(test))
println(partTwo(test2))
val resultTwo = partTwo(input)
println("9b: $resultTwo")
}
private fun partOne(input: String): Long {
val commands = input.split("\n")
.map { it.spl... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day9Kt.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class cz.wrent.advent.Day9Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String test2;\n\n private static final java.lang.String inp... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day14.kt | package cz.wrent.advent
fun main() {
println(partOne(test))
val result = partOne(input)
println("14a: $result")
println(partTwo(test))
println("14b: ${partTwo(input)}")
}
private fun partOne(input: String): Int {
return simulate(input, withFloor = false)
}
private fun simulate(input: String, withFloor: Boolean... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day14Kt.class",
"javap": "Compiled from \"Day14.kt\"\npublic final class cz.wrent.advent.Day14Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n ... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day8.kt | package cz.wrent.advent
fun main() {
println(partOne(test))
val result = partOne(input)
println("8a: $result")
println(partTwo(test))
val resultTwo = partTwo(input)
println("8b: $resultTwo")
}
private fun partOne(input: String): Long {
val map = input.parse()
val visible = mutableSetOf<Pair<Int, Int>>()
p... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day8Kt.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class cz.wrent.advent.Day8Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n Cod... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day15.kt | package cz.wrent.advent
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
fun main() {
println(partOne(test, 10))
val result = partOne(input, 2000000)
println("15a: $result")
println(partTwo(test, 20))
println("15b: ${partTwo(input, 4000000)}")
}
private fun partOne(input: String, row: Int): ... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day15Kt.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class cz.wrent.advent.Day15Kt {\n private static final int BEACON;\n\n private static final int CLEAR;\n\n private static final java.lang.String test;\n\n private stati... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day7.kt | package cz.wrent.advent
fun main() {
println(partOne(test))
val result = partOne(input)
println("7a: $result")
println(partTwo(test))
val resultTwo = partTwo(input)
println("7b: $resultTwo")
}
private fun partOne(input: String): Long {
val nodes = input.parseTree()
return nodes.values.filterIsInstance<Dir>(... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day7Kt.class",
"javap": "Compiled from \"Day7.kt\"\npublic final class cz.wrent.advent.Day7Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n Cod... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day13.kt | package cz.wrent.advent
import java.util.Deque
import java.util.LinkedList
fun main() {
println(partOne(test))
val result = partOne(input)
println("13a: $result")
println(partTwo(test))
println("13b: ${partTwo(input)}")
}
private fun partOne(input: String): Int {
val pairs = input.split("\n\n")
val packetPair... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day13Kt.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class cz.wrent.advent.Day13Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n ... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day12.kt | package cz.wrent.advent
fun main() {
println(partOne(test))
val result = partOne(input)
println("12a: $result")
println(partTwo(test))
println("12b: ${partTwo(input)}")
}
private fun partOne(input: String): Int {
val map = input.parse()
val start = map.entries.find { it.value.specialArea == SpecialArea.START }... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day12Kt.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class cz.wrent.advent.Day12Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n ... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day11.kt | package cz.wrent.advent
fun main() {
val result = partOne(input, 20, 3)
println("10a: $result")
println(result == 51075L)
println("10b: ${partOne(input, 10000, 1)}")
}
private fun partOne(input: String, rounds: Int, divisor: Long): Long {
val monkeys = input.split("\n\n").map { it.parseMonkey() }
val allMod = m... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day11Kt$partOne$$inlined$sortedByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class cz.wrent.advent.Day11Kt$partOne$$inlined$sortedByDescending$1<T> implements java.util.Comparator {\n public cz.wrent.adve... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day18.kt | package cz.wrent.advent
import java.util.*
fun main() {
println(partOne(test))
val result = partOne(input)
println("18a: $result")
println(partTwo(test))
val resultTwo = partTwo(input)
println("18b: $resultTwo")
}
private fun partOne(input: String): Int {
val cubes = input.split("\n")
.map { it.parseCube(... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day18Kt.class",
"javap": "Compiled from \"Day18.kt\"\npublic final class cz.wrent.advent.Day18Kt {\n private static final java.lang.String test;\n\n private static final java.lang.String input;\n\n public static final void main();\n ... |
Wrent__advent-of-code-2022__8230fce/cz.wrent.advent/Day5.kt | package cz.wrent.advent
import java.util.*
fun main() {
val result = partOne(input)
println("5a: $result")
val resultTwo = partTwo(input)
println("5b: $resultTwo")
}
private fun partOne(input: String): String {
return moveCrates(input) { x, y, z -> moveCrates9000(x, y, z) }
}
private fun partTwo(input: String)... | [
{
"class_path": "Wrent__advent-of-code-2022__8230fce/cz/wrent/advent/Day5Kt.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class cz.wrent.advent.Day5Kt {\n private static final java.lang.String input;\n\n public static final void main();\n Code:\n 0: ldc #8 /... |
warmthdawn__LeetCode__40dc158/lc004/src/main/kotlin/misc/Solution.kt | package misc;
import kotlin.math.max
import kotlin.system.measureTimeMillis
import kotlin.time.ExperimentalTime
import kotlin.time.measureTime
data class State(
val rank: Int,
val star: Int,
val continuousWin: Int,
val preserveStars: Int
)
class Solution {
fun calc(starPerRank: Int, winPerPrese... | [
{
"class_path": "warmthdawn__LeetCode__40dc158/misc/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class misc.Solution {\n public misc.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n... |
emmabritton__advent-of-code__c041d14/kotlin/src/commonMain/kotlin/y2015/Day2.kt | package y2015
fun runY2015D2(input: String): Pair<String, String> {
val result = input.lines()
.map { parse(it) }
.map { calc(it) }
.reduce { acc, pair -> Pair(acc.first + pair.first, acc.second + pair.second) }
return Pair(result.first.toString(), result.second.toString())
}
private f... | [
{
"class_path": "emmabritton__advent-of-code__c041d14/y2015/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class y2015.Day2Kt {\n public static final kotlin.Pair<java.lang.String, java.lang.String> runY2015D2(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
emmabritton__advent-of-code__c041d14/kotlin/src/commonMain/kotlin/y2016/Day1.kt | package y2016
import kotlin.math.abs
fun runY2016D1(input: String): Pair<String, String> {
val steps = input.split(",")
.map { parse(it.trim()) }
val (distance, firstRepeat) = travel(steps)
return Pair(distance.toString(), firstRepeat.toString())
}
fun parse(input: String): Move {
if (input... | [
{
"class_path": "emmabritton__advent-of-code__c041d14/y2016/Day1Kt.class",
"javap": "Compiled from \"Day1.kt\"\npublic final class y2016.Day1Kt {\n public static final kotlin.Pair<java.lang.String, java.lang.String> runY2016D1(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
vorpal-research__kotlin-wheels__389f9c2/src/commonMain/kotlin/ru/spbstu/wheels/Comparables.kt | package ru.spbstu.wheels
inline class ComparatorScope<T>(val comparator: Comparator<T>) {
operator fun T.compareTo(that: T) = comparator.compare(this, that)
fun Iterable<T>.maxOrNull() = maxWithOrNull(comparator)
fun Iterable<T>.minOrNull() = minWithOrNull(comparator)
fun Collection<T>.sorted() = sort... | [
{
"class_path": "vorpal-research__kotlin-wheels__389f9c2/ru/spbstu/wheels/ComparablesKt.class",
"javap": "Compiled from \"Comparables.kt\"\npublic final class ru.spbstu.wheels.ComparablesKt {\n public static final <T, R> R use(java.util.Comparator<T>, kotlin.jvm.functions.Function1<? super ru.spbstu.wheels... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0126/WordLadder2.kt | package leetcode.problem0126
class WordLadder2 {
fun findLadders(beginWord: String, endWord: String, wordList: List<String>): List<List<String>> {
if (endWord !in wordList) return emptyList()
val wordSet = setOf(beginWord) + wordList.toSet()
val adjacentWordMap: HashMap<String, List<String... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0126/WordLadder2.class",
"javap": "Compiled from \"WordLadder2.kt\"\npublic final class leetcode.problem0126.WordLadder2 {\n public leetcode.problem0126.WordLadder2();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0120/Triangle.kt | package leetcode.problem0120
import kotlin.math.min
class Triangle {
fun minimumTotal(triangle: List<List<Int>>): Int =
when (triangle.size) {
1 -> triangle[0][0]
else -> {
val array = Array(triangle.size) { intArrayOf() }
array[0] = intArrayOf(trian... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0120/Triangle.class",
"javap": "Compiled from \"Triangle.kt\"\npublic final class leetcode.problem0120.Triangle {\n public leetcode.problem0120.Triangle();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Me... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0052/NQueens2.kt | package leetcode.problem0052
class NQueens2 {
fun totalNQueens(n: Int): Int {
val board = Array(n) { BooleanArray(n) { false } }
return solve(board, 0)
}
private fun solve(board: Array<BooleanArray>, row: Int): Int {
if (row == board.size) {
return 1
}
... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0052/NQueens2.class",
"javap": "Compiled from \"NQueens2.kt\"\npublic final class leetcode.problem0052.NQueens2 {\n public leetcode.problem0052.NQueens2();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Me... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0047/Permutations2.kt | package leetcode.problem0047
class Permutations2 {
fun permuteUnique(nums: IntArray): List<List<Int>> {
val hashMap = hashMapOf<Int, Int>()
nums.forEach {
hashMap[it] = if (hashMap.containsKey(it)) {
requireNotNull(hashMap[it]) + 1
} else {
1
... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0047/Permutations2.class",
"javap": "Compiled from \"Permutations2.kt\"\npublic final class leetcode.problem0047.Permutations2 {\n public leetcode.problem0047.Permutations2();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0040/CombinationSumSecond.kt | package leetcode.problem0040
class CombinationSumSecond {
fun combinationSum2(candidates: IntArray, target: Int): List<List<Int>> {
if (candidates.all { it > target }) {
return emptyList()
}
val countMap = hashMapOf<Int, Int>()
candidates.forEach {
countMap[... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0040/CombinationSumSecond.class",
"javap": "Compiled from \"CombinationSumSecond.kt\"\npublic final class leetcode.problem0040.CombinationSumSecond {\n public leetcode.problem0040.CombinationSumSecond();\n Code:\n 0: aload_0\n ... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0085/MaximalRectangle.kt | package leetcode.problem0085
import java.util.Stack
import kotlin.math.max
class MaximalRectangle {
fun maximalRectangle(matrix: Array<CharArray>): Int {
val heights = Array(matrix.size) { IntArray(matrix[0].size) { 0 } }
matrix.forEachIndexed { row, chars ->
chars.indices.forEach { c... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0085/MaximalRectangle.class",
"javap": "Compiled from \"MaximalRectangle.kt\"\npublic final class leetcode.problem0085.MaximalRectangle {\n public leetcode.problem0085.MaximalRectangle();\n Code:\n 0: aload_0\n 1: invokes... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0015/ThreeSum.kt | package leetcode.problem0015
class ThreeSum {
fun threeSum(nums: IntArray): List<List<Int>> {
if (nums.isEmpty()) {
return emptyList()
}
val answerMap = HashMap<Int, Int>()
val answerSet = mutableSetOf<List<Int>>()
nums.forEachIndexed { index, num ->
... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0015/ThreeSum.class",
"javap": "Compiled from \"ThreeSum.kt\"\npublic final class leetcode.problem0015.ThreeSum {\n public leetcode.problem0015.ThreeSum();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Me... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0123/BestTimeToBuyAndSellStock3.kt | package leetcode.problem0123
import java.lang.IllegalArgumentException
import kotlin.math.max
class BestTimeToBuyAndSellStock3 {
fun maxProfit(prices: IntArray): Int {
val dp: Map<Boolean, Array<IntArray>> =
mapOf(
true to Array(prices.size) { IntArray(MAX_PURCHASE_COUNT) { -1 ... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0123/BestTimeToBuyAndSellStock3$Companion.class",
"javap": "Compiled from \"BestTimeToBuyAndSellStock3.kt\"\npublic final class leetcode.problem0123.BestTimeToBuyAndSellStock3$Companion {\n private leetcode.problem0123.BestTimeToBuyAndS... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0051/NQueens.kt | package leetcode.problem0051
class NQueens {
fun solveNQueens(n: Int): List<List<String>> {
val answer = arrayListOf<List<String>>()
val board = Array(n) { CharArray(n) { '.' } }
solve(board, 0, answer)
return answer
}
private fun solve(board: Array<CharArray>, row: Int,... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0051/NQueens.class",
"javap": "Compiled from \"NQueens.kt\"\npublic final class leetcode.problem0051.NQueens {\n public leetcode.problem0051.NQueens();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0005/LongestPalindromicSubstring.kt | package leetcode.problem0005
import kotlin.math.max
class LongestPalindromicSubstring {
fun longestPalindrome(s: String): String {
if (s.isEmpty()) {
return ""
}
var startIndex = 0
var endIndex = 0
for (index in 0..s.length) {
val temp1 = findPalind... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0005/LongestPalindromicSubstring.class",
"javap": "Compiled from \"LongestPalindromicSubstring.kt\"\npublic final class leetcode.problem0005.LongestPalindromicSubstring {\n public leetcode.problem0005.LongestPalindromicSubstring();\n ... |
ayukatawago__leetcode-kotlin__f9602f2/src/main/kotlin/leetcode/problem0018/FourSum.kt | package leetcode.problem0018
class FourSum {
fun fourSum(nums: IntArray, target: Int): List<List<Int>> {
val sortedNums = nums.sorted()
return kSum(sortedNums, target, 4)
}
private fun kSum(sortedNums: List<Int>, target: Int, k: Int): List<List<Int>> {
if (sortedNums.isEmpty()) {
... | [
{
"class_path": "ayukatawago__leetcode-kotlin__f9602f2/leetcode/problem0018/FourSum.class",
"javap": "Compiled from \"FourSum.kt\"\npublic final class leetcode.problem0018.FourSum {\n public leetcode.problem0018.FourSum();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method... |
catalintira__aquamarine__a55bb2a/aqua/app/src/main/java/com/garmin/android/aquamarine/Basic.kt | package com.garmin.android.aquamarine
// Exercise 1
open class Account(var balance: Float) {
open fun withdraw(sumToWithdraw: Float) {
balance -= sumToWithdraw
}
fun deposit(sumToDeposit: Float) {
balance += sumToDeposit
}
}
class SavingAccount(balance: Float) : Account(balance) {
... | [
{
"class_path": "catalintira__aquamarine__a55bb2a/com/garmin/android/aquamarine/BasicKt$solveExercise6$$inlined$sortedBy$2.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class com.garmin.android.aquamarine.BasicKt$solveExercise6$$inlined$sortedBy$2<T> implements java.util.Comparator {\n p... |
pkleimann__livingdoc2__b81fe45/livingdoc-engine/src/main/kotlin/org/livingdoc/engine/algo/DamerauLevenshtein.kt | package org.livingdoc.engine.algo
import java.lang.Math.min
/**
* Calculates the Damerau-Levenshtein distance, a string similarity metric used e.g. by spell checkers.
*
* By default, the algorithm calculates the minimum number of four different editing operations
* required to turn one string into another. The fo... | [
{
"class_path": "pkleimann__livingdoc2__b81fe45/org/livingdoc/engine/algo/DamerauLevenshtein.class",
"javap": "Compiled from \"DamerauLevenshtein.kt\"\npublic final class org.livingdoc.engine.algo.DamerauLevenshtein {\n private final int cutoffDistance;\n\n private final int weightInsertion;\n\n private ... |
olegthelilfix__MyKata__bf17d2f/src/main/java/me/olegthelilfix/leetcoding/old/LongestPalindrome.kt | package me.olegthelilfix.leetcoding.old
//Given a string s, return the longest palindromic substring in s.
fun isPalindrome(s: String): Boolean {
if (s.isEmpty()) {
return false
}
for (i in 0 .. s.length/2) {
if(s[i] != s[s.length-i-1]) {
return false
}
}
retur... | [
{
"class_path": "olegthelilfix__MyKata__bf17d2f/me/olegthelilfix/leetcoding/old/LongestPalindromeKt.class",
"javap": "Compiled from \"LongestPalindrome.kt\"\npublic final class me.olegthelilfix.leetcoding.old.LongestPalindromeKt {\n public static final boolean isPalindrome(java.lang.String);\n Code:\n ... |
olegthelilfix__MyKata__bf17d2f/src/main/java/me/olegthelilfix/leetcoding/old/FindMedianSortedArrays.kt | package me.olegthelilfix.leetcoding.old
/**
* Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
* The overall run time complexity should be O(log (m+n)).
*/
class FindMedianSortedArrays {
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray)... | [
{
"class_path": "olegthelilfix__MyKata__bf17d2f/me/olegthelilfix/leetcoding/old/FindMedianSortedArrays.class",
"javap": "Compiled from \"FindMedianSortedArrays.kt\"\npublic final class me.olegthelilfix.leetcoding.old.FindMedianSortedArrays {\n public me.olegthelilfix.leetcoding.old.FindMedianSortedArrays()... |
olegthelilfix__MyKata__bf17d2f/src/main/java/me/olegthelilfix/leetcoding/old/IntegerToRoman.kt | package me.olegthelilfix.leetcoding.old
data class RomanNumber(val letter: String, val value: Int)
val numberOrder : List<RomanNumber> = listOf(
RomanNumber("M", 1000),
RomanNumber("CM", 900),
RomanNumber("D", 500),
RomanNumber("CD", 400),
RomanNumber("C", 100),
RomanNu... | [
{
"class_path": "olegthelilfix__MyKata__bf17d2f/me/olegthelilfix/leetcoding/old/IntegerToRomanKt.class",
"javap": "Compiled from \"IntegerToRoman.kt\"\npublic final class me.olegthelilfix.leetcoding.old.IntegerToRomanKt {\n private static final java.util.List<me.olegthelilfix.leetcoding.old.RomanNumber> nu... |
jwgibanez__kotlin-number-base-converter__ea76a3c/Number Base Converter/task/src/converter/Main.kt | package converter
import java.math.BigDecimal
import java.math.BigInteger
import java.util.*
import kotlin.math.pow
fun main() {
val scanner = Scanner(System.`in`)
while (true) {
print("Enter two numbers in format: {source base} {target base} (To quit type /exit) ")
when (val input1 = scanner.... | [
{
"class_path": "jwgibanez__kotlin-number-base-converter__ea76a3c/converter/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class converter.MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/util/Scanner\n 3: dup\n ... |
ilyawaisman__distribute-amount-between-slots__aa5c75b/src/main/kotlin/xyz/prpht/distributeamountbetweenslots/Distributor.kt | package xyz.prpht.distributeamountbetweenslots
import kotlin.math.floor
import kotlin.random.Random
fun main() {
repeat(0x10) {
println(distribute(100, 5, 1, Random).joinToString(" ") { "%2d".format(it) })
}
}
fun distribute(amount: Int, slots: Int, rollsNum: Int, random: Random): List<Int> {
va... | [
{
"class_path": "ilyawaisman__distribute-amount-between-slots__aa5c75b/xyz/prpht/distributeamountbetweenslots/DistributorKt.class",
"javap": "Compiled from \"Distributor.kt\"\npublic final class xyz.prpht.distributeamountbetweenslots.DistributorKt {\n public static final void main();\n Code:\n 0: ... |
mtresnik__intel__46f23b3/src/main/kotlin/com/resnik/intel/similarity/Extensions.kt | package com.resnik.intel.similarity
import java.util.*
fun String.lcs(other: String): String {
val numArray = Array(this.length + 1) { IntArray(other.length + 1) { 0 } }
for (i in 1 until this.length + 1) {
val c1 = this[i - 1]
for (j in 1 until other.length + 1) {
val c2 = other[j... | [
{
"class_path": "mtresnik__intel__46f23b3/com/resnik/intel/similarity/ExtensionsKt.class",
"javap": "Compiled from \"Extensions.kt\"\npublic final class com.resnik.intel.similarity.ExtensionsKt {\n public static final java.lang.String lcs(java.lang.String, java.lang.String);\n Code:\n 0: aload_0\n... |
tomaszobac__aoc2023__e0ce68f/src/main/kotlin/day4/Day4.kt | package day4
import java.io.File
fun part1(file: File): List<Int> {
val pilePoints: MutableList<Int> = mutableListOf()
val part2AmountOfNumbers: MutableList<Int> = mutableListOf()
var index = 0
file.bufferedReader().useLines { readLines -> readLines.forEach { line ->
val sets = (line.split(Re... | [
{
"class_path": "tomaszobac__aoc2023__e0ce68f/day4/Day4Kt.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class day4.Day4Kt {\n public static final java.util.List<java.lang.Integer> part1(java.io.File);\n Code:\n 0: aload_0\n 1: ldc #12 // String file\n ... |
tomaszobac__aoc2023__e0ce68f/src/main/kotlin/day2/Day2.kt | package day2
import java.io.File
fun part1(file: File) {
var correctGames: Array<Int> = arrayOf()
lineLoop@
for ((currentGame, line) in file.readLines().withIndex()) {
val sets = (line.split(": ")[1]).split("; ")
for (set in sets) {
val cubes = set.split(", ")
fo... | [
{
"class_path": "tomaszobac__aoc2023__e0ce68f/day2/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class day2.Day2Kt {\n public static final void part1(java.io.File);\n Code:\n 0: aload_0\n 1: ldc #9 // String file\n 3: invokestatic #15 ... |
tomaszobac__aoc2023__e0ce68f/src/main/kotlin/day1/Day1.kt | package day1
import java.io.File
fun part1(file: File) {
var numbers: Array<Int> = arrayOf()
for (line in file.readLines()) {
val firstNum = line.indexOfFirst { it.isDigit() }
val lastNum = line.indexOfLast { it.isDigit() }
val number = "${line[firstNum]}${line[lastNum]}"
num... | [
{
"class_path": "tomaszobac__aoc2023__e0ce68f/day1/Day1Kt.class",
"javap": "Compiled from \"Day1.kt\"\npublic final class day1.Day1Kt {\n public static final void part1(java.io.File);\n Code:\n 0: aload_0\n 1: ldc #9 // String file\n 3: invokestatic #15 ... |
DaveTCode__aoc2021__2e31324/day9/src/Program.kt | package org.davetcode.aoc2021.day9
import java.io.File
fun main() {
val testData = processFile("c:\\code\\home\\aoc2021day9\\test.txt")
val inputData = processFile("c:\\code\\home\\aoc2021day9\\input.txt")
println(part1(testData))
println(part1(inputData))
println(part2(testData))
println(part... | [
{
"class_path": "DaveTCode__aoc2021__2e31324/org/davetcode/aoc2021/day9/ProgramKt.class",
"javap": "Compiled from \"Program.kt\"\npublic final class org.davetcode.aoc2021.day9.ProgramKt {\n public static final void main();\n Code:\n 0: ldc #8 // String c:\\\\code\\\\home... |
youness-1__AlgoView__f420e99/app/src/main/java/com/example/algoview/ui/algoview/Graph.kt | package com.example.algoview.ui.algoview
import java.util.*
import kotlin.math.abs
import kotlin.math.sqrt
class Edge(var destination: Vertex, var weight: Double)
class Vertex(
var id: Int,
var i: Int, var j: Int
) : Comparable<Vertex> {
var parent: Vertex? = null
var distance = Double.POSITIVE_INFINI... | [
{
"class_path": "youness-1__AlgoView__f420e99/com/example/algoview/ui/algoview/Graph.class",
"javap": "Compiled from \"Graph.kt\"\npublic final class com.example.algoview.ui.algoview.Graph {\n private com.example.algoview.ui.algoview.Heuristic heuristicType;\n\n private java.util.ArrayList<com.example.alg... |
TomPlum__advent-of-code-libs__c026ab7/library/src/main/kotlin/io/github/tomplum/libs/algorithm/DijkstrasAlgorithm.kt | package io.github.tomplum.libs.algorithm
import java.util.*
/**
* A single node in a graph traversed by Dijkstra's algorithm.
*
* @param value The value of the node. Usually contains cartesian positional information.
* @param distance The distance to this node from the starting point.
*/
data class Node<T>(val v... | [
{
"class_path": "TomPlum__advent-of-code-libs__c026ab7/io/github/tomplum/libs/algorithm/DijkstrasAlgorithmKt.class",
"javap": "Compiled from \"DijkstrasAlgorithm.kt\"\npublic final class io.github.tomplum.libs.algorithm.DijkstrasAlgorithmKt {\n public static final <N> int dijkstraShortestPath(java.util.Col... |
TomPlum__advent-of-code-libs__c026ab7/library/src/main/kotlin/io/github/tomplum/libs/extensions/CollectionExtensions.kt | package io.github.tomplum.libs.extensions
import kotlin.math.pow
/**
* Returns the product of all the integers in the given list.
*/
fun List<Int>.product(): Int = if (isNotEmpty()) reduce { product, next -> product * next } else 0
fun List<Long>.product(): Long = if (isNotEmpty()) reduce { product, next -> product... | [
{
"class_path": "TomPlum__advent-of-code-libs__c026ab7/io/github/tomplum/libs/extensions/CollectionExtensionsKt.class",
"javap": "Compiled from \"CollectionExtensions.kt\"\npublic final class io.github.tomplum.libs.extensions.CollectionExtensionsKt {\n public static final int product(java.util.List<java.la... |
TomPlum__advent-of-code-2020__73b3eac/implementation/common/src/main/kotlin/io/github/tomplum/aoc/extensions/CollectionExtensions.kt | package io.github.tomplum.aoc.extensions
import kotlin.math.pow
/**
* Returns the product of all of the integers in the given list.
*/
fun List<Int>.product(): Int = if (isNotEmpty()) reduce { product, next -> product * next } else 0
fun List<Long>.product(): Long = if (isNotEmpty()) reduce { product, next -> produ... | [
{
"class_path": "TomPlum__advent-of-code-2020__73b3eac/io/github/tomplum/aoc/extensions/CollectionExtensionsKt.class",
"javap": "Compiled from \"CollectionExtensions.kt\"\npublic final class io.github.tomplum.aoc.extensions.CollectionExtensionsKt {\n public static final int product(java.util.List<java.lang... |
TomPlum__advent-of-code-2020__73b3eac/implementation/src/main/kotlin/io/github/tomplum/aoc/ferry/docking/program/BitMask.kt | package io.github.tomplum.aoc.ferry.docking.program
/**
* A bit-mask consisting of either 0, 1 or X.
*
* An X indicates a 'Floating Bit' that is in a state of super-position and is therefore
* simultaneously a 0 and a 1. This means that every [mask] with a floating-bit has
* 2^N permutations wheres N is the numbe... | [
{
"class_path": "TomPlum__advent-of-code-2020__73b3eac/io/github/tomplum/aoc/ferry/docking/program/BitMask.class",
"javap": "Compiled from \"BitMask.kt\"\npublic final class io.github.tomplum.aoc.ferry.docking.program.BitMask {\n private final java.lang.String mask;\n\n public io.github.tomplum.aoc.ferry.... |
DPNT-Sourcecode__CHK-edzx01__b1947b8/src/main/kotlin/solutions/CHK/CheckoutSolution.kt | package solutions.CHK
import kotlin.jvm.internal.Intrinsics.Kotlin
object CheckoutSolution {
fun checkout(skus: String): Int {
var total = 0
val counts = mutableMapOf<Char, Int>()
val groupDiscountItems = listOf('S', 'T', 'X', 'Y', 'Z')
val individualPrices = mapOf('S' to 20, 'T' ... | [
{
"class_path": "DPNT-Sourcecode__CHK-edzx01__b1947b8/solutions/CHK/CheckoutSolution.class",
"javap": "Compiled from \"CheckoutSolution.kt\"\npublic final class solutions.CHK.CheckoutSolution {\n public static final solutions.CHK.CheckoutSolution INSTANCE;\n\n private solutions.CHK.CheckoutSolution();\n ... |
TimCastelijns__aoc2017__656f2a4/src/day3/p2.kt | package day3
enum class Direction { RIGHT, UP, LEFT, DOWN }
var n = 100
val grid = Array(n) { Array(n, { "" }) }
fun surroundingsSum(x: Int, y: Int): Int {
var sum = 0
if (y > 0 && x > 0) {
if (grid[y - 1][x - 1] != "") {
val add = grid[y - 1][x - 1].trim().toInt()
sum += add... | [
{
"class_path": "TimCastelijns__aoc2017__656f2a4/day3/P2Kt$WhenMappings.class",
"javap": "Compiled from \"p2.kt\"\npublic final class day3.P2Kt$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 // Method day3/Direction.v... |
TimCastelijns__aoc2017__656f2a4/src/day7/day7.kt | package day7
import java.io.File
fun main(args: Array<String>) {
p1(File("src/day7/input"))
p2(File("src/day7/input"))
}
fun p1(file: File) {
val programs = mutableListOf<String>()
val subPrograms = mutableListOf<String>()
file.forEachLine { line ->
val parts = line.split(" ")
v... | [
{
"class_path": "TimCastelijns__aoc2017__656f2a4/day7/Day7Kt.class",
"javap": "Compiled from \"day7.kt\"\npublic final class day7.Day7Kt {\n private static final java.util.Map<java.lang.String, java.lang.Integer> programWeights;\n\n private static final java.util.Map<java.lang.String, java.util.List<java.... |
TimCastelijns__aoc2017__656f2a4/src/day8/day8.kt | package day8
import java.io.File
fun main(args: Array<String>) {
val lines = File("src/day8/input").readLines()
p1(lines)
p2(lines)
}
fun p1(lines: List<String>) {
val values = mutableMapOf<String, Int>()
for (line in lines) {
values.put(line.split(" ")[0], 0)
}
for (line in lin... | [
{
"class_path": "TimCastelijns__aoc2017__656f2a4/day8/Day8Kt.class",
"javap": "Compiled from \"day8.kt\"\npublic final class day8.Day8Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic ... |
ykrytsyn__leetcode-in-kotlin__0acf2a6/src/main/kotlin/leetcode/TwoSum.kt | package leetcode
/**
* # 1. Two Sum
* [https://leetcode.com/problems/two-sum/](https://leetcode.com/problems/two-sum/)
*
* ### Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
* ### You may assume that each input would have exactly one solu... | [
{
"class_path": "ykrytsyn__leetcode-in-kotlin__0acf2a6/leetcode/TwoSum.class",
"javap": "Compiled from \"TwoSum.kt\"\npublic final class leetcode.TwoSum {\n public leetcode.TwoSum();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
ykrytsyn__leetcode-in-kotlin__0acf2a6/src/main/kotlin/leetcode/UniquePaths.kt | package leetcode
/**
* # 62. Unique Paths
* [https://leetcode.com/problems/unique-paths/](https://leetcode.com/problems/unique-paths/)
*
* ### A robot is located at the top-left corner of 'm x n' grid (marked 'Start' in the diagram below).
* ### The robot can only move either down or right at any point in time.
... | [
{
"class_path": "ykrytsyn__leetcode-in-kotlin__0acf2a6/leetcode/UniquePaths.class",
"javap": "Compiled from \"UniquePaths.kt\"\npublic final class leetcode.UniquePaths {\n public leetcode.UniquePaths();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"... |
ykrytsyn__leetcode-in-kotlin__0acf2a6/src/main/kotlin/leetcode/ArrangingCoins.kt | package leetcode
/**
* # 441. Arranging Coins
* [https://leetcode.com/problems/arranging-coins/](https://leetcode.com/problems/arranging-coins/)
*
* ### You have n coins and you want to build a staircase with these coins.
* ### The staircase consists of k rows where the ith row has exactly i coins.
* ### The las... | [
{
"class_path": "ykrytsyn__leetcode-in-kotlin__0acf2a6/leetcode/ArrangingCoins.class",
"javap": "Compiled from \"ArrangingCoins.kt\"\npublic final class leetcode.ArrangingCoins {\n public leetcode.ArrangingCoins();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/la... |
SanderSmee__adventofcode-2018__e5fc4ae/src/main/kotlin/adventofcode/day2/Day2.kt | package adventofcode.day2
import java.io.File
/**
*
*/
fun main(args: Array<String>) {
val input = File(ClassLoader.getSystemResource("day-02-input.txt").file).readLines()
// part 1
val (twos, threes, checksum) = calculateChecksum(input)
println("$twos x $threes = $checksum")
// part 2
val... | [
{
"class_path": "SanderSmee__adventofcode-2018__e5fc4ae/adventofcode/day2/Day2Kt$toLetterCount$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class adventofcode.day2.Day2Kt$toLetterCount$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Character... |
fwcd__kotlin-language-server__eee8afa/shared/src/main/kotlin/org/javacs/kt/util/StringUtils.kt | package org.javacs.kt.util
/**
* Computes a string distance using a slightly modified
* variant of the SIFT4 algorithm in linear time.
* Note that the function is asymmetric with respect to
* its two input strings and thus is not a metric in the
* mathematical sense.
*
* Based on the JavaScript implementation f... | [
{
"class_path": "fwcd__kotlin-language-server__eee8afa/org/javacs/kt/util/StringUtilsKt.class",
"javap": "Compiled from \"StringUtils.kt\"\npublic final class org.javacs.kt.util.StringUtilsKt {\n public static final int stringDistance(java.lang.CharSequence, java.lang.CharSequence, int);\n Code:\n ... |
poblish__BabyNamesKotlin__2935612/src/org/hiatusuk/BabyNamesBoys.kt | package org.hiatusuk
fun main(args: Array<String>) {
val foreNames = arrayOf("Rohan","Nathaniel","Anthony","Chris","Jonathan","Lemur","Harry","Percy","Peregrine","James","Jamie","Sidney","Gabriel","Leyton","Curtley","Jarvis");
val middleNames = arrayOf("Rohan","Nathaniel","Tony","Chris","Jonathan","Lemur","Har... | [
{
"class_path": "poblish__BabyNamesKotlin__2935612/org/hiatusuk/BabyNamesBoysKt.class",
"javap": "Compiled from \"BabyNamesBoys.kt\"\npublic final class org.hiatusuk.BabyNamesBoysKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
MBM1607__matrix-calculator__9619a1b/Main.kt | package processor
import java.util.Scanner
import kotlin.math.min
import kotlin.math.pow
val scanner = Scanner(System.`in`)
fun readMatrix(messageInfix: String = ""): Array<DoubleArray> {
print("Enter size of ${messageInfix}matrix: ")
val row = scanner.nextInt()
val col = scanner.nextInt()
val matrix... | [
{
"class_path": "MBM1607__matrix-calculator__9619a1b/processor/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class processor.MainKt {\n private static final java.util.Scanner scanner;\n\n public static final java.util.Scanner getScanner();\n Code:\n 0: getstatic #11 ... |
henopied__road-runner__19d7799/core/src/main/kotlin/com/acmerobotics/roadrunner/util/MathUtil.kt | package com.acmerobotics.roadrunner.util
import kotlin.math.*
/**
* Various math utilities.
*/
object MathUtil {
/**
* Returns the real solutions to the quadratic [a]x^2 + [b]x + [c] = 0.
*/
@JvmStatic
fun solveQuadratic(a: Double, b: Double, c: Double): DoubleArray {
if (a epsilonEqu... | [
{
"class_path": "henopied__road-runner__19d7799/com/acmerobotics/roadrunner/util/MathUtil.class",
"javap": "Compiled from \"MathUtil.kt\"\npublic final class com.acmerobotics.roadrunner.util.MathUtil {\n public static final com.acmerobotics.roadrunner.util.MathUtil INSTANCE;\n\n private com.acmerobotics.r... |
binkley__kotlin-dice__072d4cb/src/main/kotlin/hm/binkley/dice/rolling/KeepCount.kt | package hm.binkley.dice.rolling
import java.util.Objects.hash
sealed class KeepCount(protected val value: Int) {
override fun toString() = "${this::class.simpleName}($value)"
override fun equals(other: Any?) = this === other ||
other is KeepCount &&
javaClass == other.javaClass &&
val... | [
{
"class_path": "binkley__kotlin-dice__072d4cb/hm/binkley/dice/rolling/KeepCountKt.class",
"javap": "Compiled from \"KeepCount.kt\"\npublic final class hm.binkley.dice.rolling.KeepCountKt {\n private static final <T> java.util.List<T> withoutIndex(java.util.List<? extends kotlin.collections.IndexedValue<? ... |
ansonxing23__mt-metrics__2f5a970/src/main/kotlin/com/newtranx/eval/utils/func.kt | package com.newtranx.eval.utils
import kotlin.math.ln
import kotlin.math.min
/**
* @Author: anson
* @Date: 2022/1/29 11:41 PM
*/
inline fun <T> zip(vararg lists: List<T>): List<List<T>> {
return zip(*lists, transform = { it })
}
inline fun <T, V> zip(vararg lists: List<T>, transform: (List<T>) -> V): List<V> ... | [
{
"class_path": "ansonxing23__mt-metrics__2f5a970/com/newtranx/eval/utils/FuncKt.class",
"javap": "Compiled from \"func.kt\"\npublic final class com.newtranx.eval.utils.FuncKt {\n public static final <T> java.util.List<java.util.List<T>> zip(java.util.List<? extends T>...);\n Code:\n 0: aload_0\n ... |
vengateshm__Android-Kotlin-Jetpack-Compose-Practice__40d2c85/kotlin_practice/src/main/java/dev/vengateshm/kotlin_practice/programs/AnagramSubStringSearchHashMapImpl.kt | package dev.vengateshm.kotlin_practice.programs
fun main() {
// println(findAnagramsPatternsStartIndicesInString("", "abc").toString())
// println(findAnagramsPatternsStartIndicesInString("abc", "abca").toString())
println(findAnagramsPatternsStartIndicesInString("abczzbcabcadeb", "abc").toString())
// pr... | [
{
"class_path": "vengateshm__Android-Kotlin-Jetpack-Compose-Practice__40d2c85/dev/vengateshm/kotlin_practice/programs/AnagramSubStringSearchHashMapImplKt.class",
"javap": "Compiled from \"AnagramSubStringSearchHashMapImpl.kt\"\npublic final class dev.vengateshm.kotlin_practice.programs.AnagramSubStringSearc... |
bsautner__Advent-of-Code-2022__5f53cb1/AOC2022/src/main/kotlin/AOC9.kt | package com.yp.day9
import java.io.File
import kotlin.math.abs
class AOC9 {
fun process() {
val input = File("/home/ben/aoc/input-9.txt")
val instructions = input.useLines { it.toList() }
val p1 = (0..1).map { Pair(0, 0) }.toMutableList()
val p2 = (0..9).map { Pair(0, 0) }.to... | [
{
"class_path": "bsautner__Advent-of-Code-2022__5f53cb1/com/yp/day9/AOC9.class",
"javap": "Compiled from \"AOC9.kt\"\npublic final class com.yp.day9.AOC9 {\n public com.yp.day9.AOC9();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
Chopinsky__-Exercises--Kotlin_with_Java__2274ef8/src/com/company/AStar.kt | package com.company
import java.util.*
import kotlin.collections.ArrayList
val D1 = 1.0
val D2 = Math.sqrt(2.0)
val p = 1/1000
fun aStarSearch(start: Pair<Int, Int>, goal: Pair<Int, Int>, map: HashMap<Pair<Int, Int>, Int>): ArrayList<Pair<Int, Int>> {
val failure = ArrayList<Pair<Int, Int>>()
// set of node... | [
{
"class_path": "Chopinsky__-Exercises--Kotlin_with_Java__2274ef8/com/company/AStarKt.class",
"javap": "Compiled from \"AStar.kt\"\npublic final class com.company.AStarKt {\n private static final double D1;\n\n private static final double D2;\n\n private static final int p;\n\n public static final doubl... |
Lysoun__advent-of-code-2023__96ecbce/day3/src/main/kotlin/part2.kt | package day3
import java.io.File
fun computeGearRatio(maybeGearPosition: Pair<Int, Int>, numbers: MutableMap<Pair<Int, Int>, Int>): Int {
val neighbourNumbers = listOf(
maybeGearPosition.first to maybeGearPosition.second -1,
maybeGearPosition.first + 1 to maybeGearPosition.second -1,
maybe... | [
{
"class_path": "Lysoun__advent-of-code-2023__96ecbce/day3/Part2Kt.class",
"javap": "Compiled from \"part2.kt\"\npublic final class day3.Part2Kt {\n public static final int computeGearRatio(kotlin.Pair<java.lang.Integer, java.lang.Integer>, java.util.Map<kotlin.Pair<java.lang.Integer, java.lang.Integer>, j... |
Lysoun__advent-of-code-2023__96ecbce/day3/src/main/kotlin/part1.kt | package day3
import java.io.File
fun isSymbol(char: Char): Boolean = !char.isDigit() && char != '.'
fun isNextToASymbol(position: Pair<Int, Int>, engineSchematic: Map<Pair<Int, Int>, Char>): Boolean {
val neighbourPositions = listOf(
position.first to position.second -1,
position.first + 1 to pos... | [
{
"class_path": "Lysoun__advent-of-code-2023__96ecbce/day3/Part1Kt.class",
"javap": "Compiled from \"part1.kt\"\npublic final class day3.Part1Kt {\n public static final boolean isSymbol(char);\n Code:\n 0: iload_0\n 1: invokestatic #11 // Method java/lang/Character.isDigit:(... |
nickperov__Algorithms__6696f5d/combinatorics/src/main/kotlin/com/nickperov/stud/combinatorics/CombinatorialUtils.kt | package com.nickperov.stud.combinatorics
import java.math.BigInteger
object CombinatorialUtils {
/**
* Number of ordered samples of size m, without replacement, from n objects.
*/
fun calculateNumberOfVariationsInt(n: Int, m: Int): Int {
val number = calculateNumberOfVariations(n, m)
... | [
{
"class_path": "nickperov__Algorithms__6696f5d/com/nickperov/stud/combinatorics/CombinatorialUtils$CombinationsInvariant.class",
"javap": "Compiled from \"CombinatorialUtils.kt\"\npublic final class com.nickperov.stud.combinatorics.CombinatorialUtils$CombinationsInvariant<T> {\n private final java.util.Li... |
nickperov__Algorithms__6696f5d/knapsack/src/main/kotlin/com/nickperov/stud/algorithms/knapsack/KnapSackProblem.kt | package com.nickperov.stud.algorithms.knapsack
import kotlin.random.Random
data class KnapSack(val weightLimit: Int)
data class Item(val weight: Int, val price: Int)
data class ProblemParameters(val knapSackSize: Int, val itemListSize: Int, val itemWeightLimit: Int, val itemPriceLimit: Int)
data class Problem(val ... | [
{
"class_path": "nickperov__Algorithms__6696f5d/com/nickperov/stud/algorithms/knapsack/KnapSackProblemKt.class",
"javap": "Compiled from \"KnapSackProblem.kt\"\npublic final class com.nickperov.stud.algorithms.knapsack.KnapSackProblemKt {\n public static final int knapsackDefaultSize;\n\n public static fi... |
nickperov__Algorithms__6696f5d/monty-hall/src/main/kotlin/com/nickperov/stud/algorithms/montyhall/MontyHallSimulator.kt | package com.nickperov.stud.algorithms.montyhall
import kotlin.random.Random
enum class Prize {
GOAT, CAR
}
enum class Strategy {
KEEP, CHANGE, GUESS
}
object MontyHallApp {
@JvmStatic
fun main(args: Array<String>) {
println("Simulate monty hall game with different strategies")
val ro... | [
{
"class_path": "nickperov__Algorithms__6696f5d/com/nickperov/stud/algorithms/montyhall/MontyHallSimulatorKt$WhenMappings.class",
"javap": "Compiled from \"MontyHallSimulator.kt\"\npublic final class com.nickperov.stud.algorithms.montyhall.MontyHallSimulatorKt$WhenMappings {\n public static final int[] $En... |
nickperov__Algorithms__6696f5d/fibonacci/src/main/kotlin/com/nickperov/stud/algorithms/fibonacci/FibonacciLargeGenerator.kt | package com.nickperov.stud.algorithms.fibonacci
import java.math.BigInteger
fun main() {
println("Hello, large Fibonacci numbers")
println(FibonacciLargeTailRecursiveOptimisedGenerator().calculate(1000000))
/*for (number in 93..150) {
println("====================>$number<==================")
... | [
{
"class_path": "nickperov__Algorithms__6696f5d/com/nickperov/stud/algorithms/fibonacci/FibonacciLargeGeneratorKt.class",
"javap": "Compiled from \"FibonacciLargeGenerator.kt\"\npublic final class com.nickperov.stud.algorithms.fibonacci.FibonacciLargeGeneratorKt {\n public static final void main();\n Co... |
nickperov__Algorithms__6696f5d/combinatorics/src/main/kotlin/com/nickperov/stud/combinatorics/experiment/PermutationsCalculatorExperiment.kt | package com.nickperov.stud.combinatorics.experiment
import com.nickperov.stud.combinatorics.CombinatorialUtils
import java.util.*
/**
* Test sample to try different approaches to calculate permutations
*/
object PermutationsCalculatorExperiment {
/**
* Provides all permutations of the elements in the given... | [
{
"class_path": "nickperov__Algorithms__6696f5d/com/nickperov/stud/combinatorics/experiment/PermutationsCalculatorExperiment.class",
"javap": "Compiled from \"PermutationsCalculatorExperiment.kt\"\npublic final class com.nickperov.stud.combinatorics.experiment.PermutationsCalculatorExperiment {\n public st... |
Feng-12138__LooSchedule__f8db57b/backend/src/main/kotlin/services/utilities/RequirementsParser.kt | package services.utilities
import java.util.concurrent.ConcurrentHashMap
class RequirementsParser {
// requirementsData example:
// ["1:CS 115,CS 135,CS 145;1:CS 136,CS 146;1:MATH 127,MATH 137,MATH 147;1:MATH 128,MATH 138,MATH 148;1:MATH 135,MATH 145;1:MATH 136,MATH 146;1:MATH 239,MATH 249;1:STAT 230,STAT ... | [
{
"class_path": "Feng-12138__LooSchedule__f8db57b/services/utilities/RequirementsParser$finalizeRequirements$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class services.utilities.RequirementsParser$finalizeRequirements$$inlined$sortedBy$1<T> implements java.util.Compa... |
d-costa__acacia__35aa2f3/src/commonMain/kotlin/com/github/d_costa/acacia/BinaryTree.kt | package com.github.d_costa.acacia
data class BNode<T>(
val value: T,
val left: BNode<T>? = null,
val right: BNode<T>? = null
)
/**
* A Binary Tree
*
* Supports insertion, deletion, and iteration
*/
class BinaryTree<T : Comparable<T>>: Iterable<T> {
var root: BNode<T>? = null
fun insert(value... | [
{
"class_path": "d-costa__acacia__35aa2f3/com/github/d_costa/acacia/BinaryTree.class",
"javap": "Compiled from \"BinaryTree.kt\"\npublic final class com.github.d_costa.acacia.BinaryTree<T extends java.lang.Comparable<? super T>> implements java.lang.Iterable<T>, kotlin.jvm.internal.markers.KMappedMarker {\n... |
Devastus__aoc-2021__69f6c22/day10/app/src/main/kotlin/day10/App.kt | package day10
import java.io.File
import java.util.ArrayDeque
val INPUT = "input.txt"
fun old() {
val scoreMap = mapOf(')' to 3, ']' to 57, '}' to 1197, '>' to 25137)
val chars: CharSequence = "([{<)]}>"
val charMap = mapOf('(' to 0, ')' to 4,
'[' to 1, ']' to 5,
... | [
{
"class_path": "Devastus__aoc-2021__69f6c22/day10/AppKt.class",
"javap": "Compiled from \"App.kt\"\npublic final class day10.AppKt {\n private static final java.lang.String INPUT;\n\n public static final java.lang.String getINPUT();\n Code:\n 0: getstatic #11 // Field INPUT:L... |
gouthamhusky__leetcode-journey__a0e158c/neetcode/src/main/java/org/linkedlist/LinkedList.kt | package org.linkedlist
class ListNode(var `val`: Int) {
var next: ListNode? = null
}
fun deleteDuplicates(head: ListNode?): ListNode? {
var node = head ?: return null
while (node!!.next != null){
if(node.`val` == node.next!!.`val`)
node.next = node.next!!.next
else
... | [
{
"class_path": "gouthamhusky__leetcode-journey__a0e158c/org/linkedlist/LinkedListKt.class",
"javap": "Compiled from \"LinkedList.kt\"\npublic final class org.linkedlist.LinkedListKt {\n public static final org.linkedlist.ListNode deleteDuplicates(org.linkedlist.ListNode);\n Code:\n 0: aload_0\n ... |
gouthamhusky__leetcode-journey__a0e158c/neetcode/src/main/java/org/slidingwindow/SlidingWindowNeet.kt | package org.slidingwindow
import kotlin.math.abs
// https://leetcode.com/problems/minimum-size-subarray-sum/
fun minSubArrayLen(target: Int, nums: IntArray): Int {
var i = 0; var j = 0; var sum = 0; var min = Int.MAX_VALUE
while (j < nums.size){
sum += nums[j]
if (sum >= target){
... | [
{
"class_path": "gouthamhusky__leetcode-journey__a0e158c/org/slidingwindow/SlidingWindowNeetKt.class",
"javap": "Compiled from \"SlidingWindowNeet.kt\"\npublic final class org.slidingwindow.SlidingWindowNeetKt {\n public static final int minSubArrayLen(int, int[]);\n Code:\n 0: aload_1\n 1: ... |
toddharrison__tdcreator__269b3f2/src/main/kotlin/com/eharrison/game/tdcreator/AStar.kt | package com.eharrison.game.tdcreator
import java.util.PriorityQueue
import java.util.ArrayList
typealias Neighbors<Node> = (Node) -> List<Node>
typealias Cost<Node> = (Node, Node) -> Double
typealias Exclude<Node> = (Node) -> Boolean
typealias Heuristic<Node> = (Node, Node) -> Double
fun <Node> aStar(
start: Nod... | [
{
"class_path": "toddharrison__tdcreator__269b3f2/com/eharrison/game/tdcreator/AStarKt.class",
"javap": "Compiled from \"AStar.kt\"\npublic final class com.eharrison.game.tdcreator.AStarKt {\n public static final <Node> java.util.List<Node> aStar(Node, Node, kotlin.jvm.functions.Function1<? super Node, ? e... |
tohuwabohu-io__librefit__031d34c/librefit-service/src/main/kotlin/io/tohuwabohu/calc/Tdee.kt | package io.tohuwabohu.calc
import kotlin.math.pow
import kotlin.math.round
/**
* Calculation of basic metabolic rate (BMR) and total daily energy expenditure (TDEE) based on the Harris-Benedict
* formula.
*/
data class Tdee(
val age: Number,
val sex: CalculationSex,
val weight: Number,
val height: ... | [
{
"class_path": "tohuwabohu-io__librefit__031d34c/io/tohuwabohu/calc/Tdee$WhenMappings.class",
"javap": "Compiled from \"Tdee.kt\"\npublic final class io.tohuwabohu.calc.Tdee$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n public static final int[] $EnumSwitchMapping$1;\n\n static {}... |
AZenhom__Problem-Solving__a2ea0dd/CF_892_2_B/CF_892_2_B.kt | package com.ahmedzenhom.problem_solving.cf_892_2_b
var input =
mutableListOf<String>( // Not to be included in your submitting
"3",
"2",
"2",
"1 2",
"2",
"4 3",
"1",
"3",
... | [
{
"class_path": "AZenhom__Problem-Solving__a2ea0dd/com/ahmedzenhom/problem_solving/cf_892_2_b/CF_892_2_BKt.class",
"javap": "Compiled from \"CF_892_2_B.kt\"\npublic final class com.ahmedzenhom.problem_solving.cf_892_2_b.CF_892_2_BKt {\n private static java.util.List<java.lang.String> input;\n\n public sta... |
mhiew__translation-tool__8261d9e/src/main/kotlin/com/minhiew/translation/Analyzer.kt | package com.minhiew.translation
object Analyzer {
fun compare(androidStrings: Map<String, String>, iosStrings: Map<String, String>): LocalizationReport {
return LocalizationReport(
uniqueAndroidStrings = androidStrings.filterForKeysNotPresentIn(iosStrings),
uniqueIosStrings = iosStr... | [
{
"class_path": "mhiew__translation-tool__8261d9e/com/minhiew/translation/Analyzer.class",
"javap": "Compiled from \"Analyzer.kt\"\npublic final class com.minhiew.translation.Analyzer {\n public static final com.minhiew.translation.Analyzer INSTANCE;\n\n private com.minhiew.translation.Analyzer();\n Co... |
parmeshtoyou__DSAPlaybook__aea9c82/src/main/kotlin/sorting/MergeSort.kt | package sorting
//sort the left half
//sort the right half
//merge both the half
fun main() {
val input = intArrayOf(23, 47, 81, -1, 95, 7, 14, 39, 55, 63, 74)
val temp = IntArray(input.size) { -1 }
println("before sorting")
for (i in input) {
println(i)
}
mergeSort(input, temp)
... | [
{
"class_path": "parmeshtoyou__DSAPlaybook__aea9c82/sorting/MergeSortKt.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class sorting.MergeSortKt {\n public static final void main();\n Code:\n 0: bipush 11\n 2: newarray int\n 4: astore_1\n 5: aload_1\n... |
stangls__krangl__dfa3a6c/src/main/kotlin/krangl/util/Util.kt | package krangl.util
//
// Functional Helpers (missing in kotlin-stdlib)
//
// todo should they go into separate artifact?
// adopted from https://stackoverflow.com/questions/44429419/what-is-basic-difference-between-fold-and-reduce-in-kotlin-when-to-use-which
// desc from https://stackoverflow.com/questions/17408880... | [
{
"class_path": "stangls__krangl__dfa3a6c/krangl/util/UtilKt.class",
"javap": "Compiled from \"Util.kt\"\npublic final class krangl.util.UtilKt {\n public static final <T, R> java.util.List<R> scanLeft(kotlin.sequences.Sequence<? extends T>, R, kotlin.jvm.functions.Function2<? super R, ? super T, ? extends... |
RobinGoussey__advent_of_code23__b1421c0/src/main/kotlin/org/rgoussey/aoc2023/day3/Main.kt | package org.rgoussey.aoc2023.day3
import java.io.File
import kotlin.math.max
import kotlin.math.min
fun main() {
val lines = File({}.javaClass.getResource("/day3/input.txt")!!.toURI()).readLines();
process(lines);
}
fun process(lines: List<String>) {
val characters = mutableListOf<MutableList<Char>>()
... | [
{
"class_path": "RobinGoussey__advent_of_code23__b1421c0/org/rgoussey/aoc2023/day3/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class org.rgoussey.aoc2023.day3.MainKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n ... |
brunogabriel__algorithms__050a709/algorithms-kotlin/src/main/kotlin/io/github/brunogabriel/math/MatrixOperations.kt | package io.github.brunogabriel.math
fun matrixMultiplication(
matrixA: List<List<Long>>,
matrixB: List<List<Long>>
): List<List<Long>> {
if (matrixA.first().size != matrixB.size) {
return emptyList()
}
val result = Array(matrixA.size) { Array(matrixB.first().size) { 0L } }
for (i in ... | [
{
"class_path": "brunogabriel__algorithms__050a709/io/github/brunogabriel/math/MatrixOperationsKt.class",
"javap": "Compiled from \"MatrixOperations.kt\"\npublic final class io.github.brunogabriel.math.MatrixOperationsKt {\n public static final java.util.List<java.util.List<java.lang.Long>> matrixMultiplic... |
vihangpatil__kotlin-tricks__d1f3da3/src/main/kotlin/io/github/vihangpatil/kotlintricks/range/RangeExtensions.kt | package io.github.vihangpatil.kotlintricks.range
/**
* @param[other] [ClosedRange]<[T]>
* @return [Boolean] if this [Comparable]<[T]> overlaps with [other]
*/
private fun <T : Comparable<T>> ClosedRange<T>.overlapsWith(
other: ClosedRange<T>
): Boolean {
return (other.start in start..endInclusive || oth... | [
{
"class_path": "vihangpatil__kotlin-tricks__d1f3da3/io/github/vihangpatil/kotlintricks/range/RangeExtensionsKt$mergeBy$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class io.github.vihangpatil.kotlintricks.range.RangeExtensionsKt$mergeBy$$inlined$sortedBy$1<T> impleme... |
boti996__lileto_tests__190fbe5/src/test/kotlin/boti996/lileto/tests/helpers/DataHelpers.kt | package boti996.lileto.tests.helpers
// Lileto null value
internal const val liletoNullValue = "-"
/**
* Alias for simple testcases.
* [Pair]'s first element is a [String] in Lileto language.
* [Pair]'s second element is the expected result [String].
*/
internal typealias testcase = Pair<String, String>
internal ... | [
{
"class_path": "boti996__lileto_tests__190fbe5/boti996/lileto/tests/helpers/DataHelpersKt.class",
"javap": "Compiled from \"DataHelpers.kt\"\npublic final class boti996.lileto.tests.helpers.DataHelpersKt {\n public static final java.lang.String liletoNullValue;\n\n public static final kotlin.reflect.KCla... |
nehemiaharchives__cpsd__055a7ba/src/main/kotlin/org/gnit/cpsd/GeoCalculation.kt | package org.gnit.cpsd
import kotlin.math.*
/**
* [Reference](https://stackoverflow.com/questions/3694380/calculating-distance-between-two-points-using-latitude-longitude)
*
* Calculate distance between two points in latitude and longitude taking
* into account height difference. If you are not interested in heigh... | [
{
"class_path": "nehemiaharchives__cpsd__055a7ba/org/gnit/cpsd/GeoCalculationKt.class",
"javap": "Compiled from \"GeoCalculation.kt\"\npublic final class org.gnit.cpsd.GeoCalculationKt {\n public static final double distanceOf(double, double, double, double, double, double);\n Code:\n 0: sipush ... |
EduanPrinsloo__RoverKata__5ee857f/src/main/kotlin/com/thedevadventure/roverkata/RoverKata.kt | package com.thedevadventure.roverkata
import java.util.*
fun main() {
val scanner = Scanner(System.`in`)
// Get and validate the plateau
println("Please enter the dimensions of your plateau starting with the size of X?")
val plateauDimensionsX = scanner.nextInt()
println("And the size of Y?")
v... | [
{
"class_path": "EduanPrinsloo__RoverKata__5ee857f/com/thedevadventure/roverkata/RoverKataKt.class",
"javap": "Compiled from \"RoverKata.kt\"\npublic final class com.thedevadventure.roverkata.RoverKataKt {\n public static final void main();\n Code:\n 0: new #8 // class j... |
kodeflap__Algo_Guide__c4a7ddb/app/src/main/java/com/dlight/algoguide/dsa/dynamic_programming/Longest_Common_Subsequence/lcs.kt | package com.dlight.algoguide.dsa.dynamic_programming.Longest_Common_Subsequence
import java.util.*
object lcs {
@JvmStatic
fun main(args: Array<String>) {
val s1 = "abcde"
val s2 = "ace"
println("The Length of Longest Common Subsequence is " + longestCommonSubsequence(s1, s2))
}
... | [
{
"class_path": "kodeflap__Algo_Guide__c4a7ddb/com/dlight/algoguide/dsa/dynamic_programming/Longest_Common_Subsequence/lcs.class",
"javap": "Compiled from \"lcs.kt\"\npublic final class com.dlight.algoguide.dsa.dynamic_programming.Longest_Common_Subsequence.lcs {\n public static final com.dlight.algoguide.... |
kodeflap__Algo_Guide__c4a7ddb/app/src/main/java/com/dlight/algoguide/dsa/sorting/quick_sort/QuickSort.kt | package com.dlight.algoguide.dsa.sorting.quick_sort
/**
* Quick sort
*
* @constructor Create empty Quick sort
*/
class QuickSort {
suspend fun quickSort(
arr: IntArray, left: Int, right: Int) {
/*First finding the partioning index using thepartion function */
val index = partition (... | [
{
"class_path": "kodeflap__Algo_Guide__c4a7ddb/com/dlight/algoguide/dsa/sorting/quick_sort/QuickSort$quickSort$1.class",
"javap": "Compiled from \"QuickSort.kt\"\nfinal class com.dlight.algoguide.dsa.sorting.quick_sort.QuickSort$quickSort$1 extends kotlin.coroutines.jvm.internal.ContinuationImpl {\n java.l... |
abdurakhmonoff__data-structures-and-algorithms-kotlin__cd9746d/src/algorithms/sorting/merge_sort/MergeSort.kt | package algorithms.sorting.merge_sort
/**
* Implementation of the merge sort algorithm for sorting a list of integers in ascending order.
*/
class MergeSort {
/**
* Recursively sorts the given list by dividing it into halves and merging them.
*
* @param array the list to sort
* @return the s... | [
{
"class_path": "abdurakhmonoff__data-structures-and-algorithms-kotlin__cd9746d/algorithms/sorting/merge_sort/MergeSortKt.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class algorithms.sorting.merge_sort.MergeSortKt {\n public static final void main();\n Code:\n 0: new #... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.