kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
hahaslav__Kotlin-Basics__5ca7234/Cinema.kt | package cinema
const val SEATSLIMIT = 60
const val VIPRICE = 10
const val POORPRICE = 8
fun inputRoom(): String {
println("Enter the number of rows:")
val r = readLine()!!
println("Enter the number of seats in each row:")
val s = readLine()!!
return "$r $s"
}
fun scheme(cinema: MutableList<Mutabl... | [
{
"class_path": "hahaslav__Kotlin-Basics__5ca7234/cinema/CinemaKt.class",
"javap": "Compiled from \"Cinema.kt\"\npublic final class cinema.CinemaKt {\n public static final int SEATSLIMIT;\n\n public static final int VIPRICE;\n\n public static final int POORPRICE;\n\n public static final java.lang.String... |
ahuamana__KotlinCorutinesExpert__931ce88/app/src/main/java/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/PalindromicNew.kt | package com.lukaslechner.coroutineusecasesonandroid.playground.challenges
//Have the function StringChallenge(str) take the str parameter being passed and determine if it is possible to create a palindromic string of minimum length 3 characters by removing 1 or 2 characters
//For example: if str is "abjchba" then you ... | [
{
"class_path": "ahuamana__KotlinCorutinesExpert__931ce88/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/PalindromicNewKt.class",
"javap": "Compiled from \"PalindromicNew.kt\"\npublic final class com.lukaslechner.coroutineusecasesonandroid.playground.challenges.PalindromicNewKt {\n priva... |
ahuamana__KotlinCorutinesExpert__931ce88/app/src/main/java/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/SearchingChallenge.kt | package com.lukaslechner.coroutineusecasesonandroid.playground.challenges
//find the longest substring that contains k unique characters
//The input string str must have at least length 2.
//The first character of str must be a digit between 1 and 6 (inclusive), representing the number of unique characters in the long... | [
{
"class_path": "ahuamana__KotlinCorutinesExpert__931ce88/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/SearchingChallengeKt.class",
"javap": "Compiled from \"SearchingChallenge.kt\"\npublic final class com.lukaslechner.coroutineusecasesonandroid.playground.challenges.SearchingChallengeK... |
ahuamana__KotlinCorutinesExpert__931ce88/app/src/main/java/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/MathChallenge.kt | package com.lukaslechner.coroutineusecasesonandroid.playground.challenges
// Challenge
// Have the function MathChallenge(str) take the str parameter, which will be a simple mathematical formula with three numbers, a single operator (+, -, *, or /) and an equal sign (=) and return the digit that completes the equation... | [
{
"class_path": "ahuamana__KotlinCorutinesExpert__931ce88/com/lukaslechner/coroutineusecasesonandroid/playground/challenges/MathChallengeKt.class",
"javap": "Compiled from \"MathChallenge.kt\"\npublic final class com.lukaslechner.coroutineusecasesonandroid.playground.challenges.MathChallengeKt {\n private ... |
jksolbakken__aoc_2020__4c5e7a4/src/main/kotlin/day2/Day2.kt | package day2
import java.io.File
fun main() {
val input = File(object {}.javaClass.getResource("/day2/input.txt").toURI()).readLines()
println("char count: ${matchingNrOfChars(input)}")
println("char position: ${matchingPosition(input)}")
}
fun matchingNrOfChars(lines: List<String>) = prepare(lines)
.map... | [
{
"class_path": "jksolbakken__aoc_2020__4c5e7a4/day2/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class day2.Day2Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: new #10 ... |
tieren1__LeetCodePractice__427fa28/app/src/test/java/com/terencepeh/leetcodepractice/IntersectionArrays.kt | package com.terencepeh.leetcodepractice
fun intersection(nums1: IntArray, nums2: IntArray): IntArray {
return nums1.intersect(nums2.toHashSet()).toIntArray()
}
fun intersection2(nums1: IntArray, nums2: IntArray): IntArray {
val set1 = nums1.toHashSet()
val set2 = nums2.toHashSet()
return if (set1.siz... | [
{
"class_path": "tieren1__LeetCodePractice__427fa28/com/terencepeh/leetcodepractice/IntersectionArraysKt.class",
"javap": "Compiled from \"IntersectionArrays.kt\"\npublic final class com.terencepeh.leetcodepractice.IntersectionArraysKt {\n public static final int[] intersection(int[], int[]);\n Code:\n ... |
tieren1__LeetCodePractice__427fa28/app/src/test/java/com/terencepeh/leetcodepractice/LowestCommonAncestorBST.kt | package com.terencepeh.leetcodepractice
/**
* Created by <NAME> on 26/10/22.
*/
/**
* Definition for a binary tree node.
* class TreeNode(var `val`: Int = 0) {
* var left: TreeNode? = null
* var right: TreeNode? = null
* }
*/
class TreeNode(var `val`: Int = 0) {
var left: TreeNode? = null
var ... | [
{
"class_path": "tieren1__LeetCodePractice__427fa28/com/terencepeh/leetcodepractice/LowestCommonAncestorBSTKt.class",
"javap": "Compiled from \"LowestCommonAncestorBST.kt\"\npublic final class com.terencepeh.leetcodepractice.LowestCommonAncestorBSTKt {\n public static final com.terencepeh.leetcodepractice.... |
tieren1__LeetCodePractice__427fa28/app/src/test/java/com/terencepeh/leetcodepractice/RecursiveSum.kt | package com.terencepeh.leetcodepractice
fun sum(arr: IntArray): Int {
println("Size = ${arr.size}")
return when {
arr.isEmpty() -> 0
else -> arr[0] + sum(arr.copyOfRange(1, arr.size))
}
}
fun count(list: List<Any>): Int {
return when {
list.isEmpty() -> 0
else -> 1 + co... | [
{
"class_path": "tieren1__LeetCodePractice__427fa28/com/terencepeh/leetcodepractice/RecursiveSumKt.class",
"javap": "Compiled from \"RecursiveSum.kt\"\npublic final class com.terencepeh.leetcodepractice.RecursiveSumKt {\n public static final int sum(int[]);\n Code:\n 0: aload_0\n 1: ldc ... |
tieren1__LeetCodePractice__427fa28/app/src/test/java/com/terencepeh/leetcodepractice/GroupAnagrams.kt | package com.terencepeh.leetcodepractice
// O(NKlogK)
// O(NK)
fun groupAnagrams(strs: Array<String>): List<List<String>> {
if (strs.isEmpty()) {
return emptyList()
}
val hashMap = hashMapOf<String, MutableList<String>>()
for (s in strs) {
val ca = s.toCharArray()
ca.sort()
... | [
{
"class_path": "tieren1__LeetCodePractice__427fa28/com/terencepeh/leetcodepractice/GroupAnagramsKt.class",
"javap": "Compiled from \"GroupAnagrams.kt\"\npublic final class com.terencepeh.leetcodepractice.GroupAnagramsKt {\n public static final java.util.List<java.util.List<java.lang.String>> groupAnagrams... |
tieren1__LeetCodePractice__427fa28/app/src/test/java/com/terencepeh/leetcodepractice/BestTimeToBuyAndSellStock.kt | package com.terencepeh.leetcodepractice
/**
* Created by <NAME> on 7/9/22.
*/
// o(n2)
fun maxProfitBruteForce(prices: IntArray): Int {
var maxProfit = 0
for (i in 0 until prices.size - 1) {
for (j in i until prices.size) {
val profit = prices[j] - prices[i]
if (profit > maxP... | [
{
"class_path": "tieren1__LeetCodePractice__427fa28/com/terencepeh/leetcodepractice/BestTimeToBuyAndSellStockKt.class",
"javap": "Compiled from \"BestTimeToBuyAndSellStock.kt\"\npublic final class com.terencepeh.leetcodepractice.BestTimeToBuyAndSellStockKt {\n public static final int maxProfitBruteForce(in... |
dokerplp__abit-vt-bot__b3c530a/src/main/kotlin/dokerplp/bot/utli/StrignSimilarity.kt | package dokerplp.bot.utli
import java.util.*
/*
Code was taken from
https://stackoverflow.com/questions/955110/similarity-string-comparison-in-java
*/
/**
* Calculates the similarity (a number within 0 and 1) between two strings.
*/
fun stringSimilarity(s1: String, s2: String): Double {
var longer = s1
var sh... | [
{
"class_path": "dokerplp__abit-vt-bot__b3c530a/dokerplp/bot/utli/StrignSimilarityKt.class",
"javap": "Compiled from \"StrignSimilarity.kt\"\npublic final class dokerplp.bot.utli.StrignSimilarityKt {\n public static final double stringSimilarity(java.lang.String, java.lang.String);\n Code:\n 0: al... |
willowtreeapps__assertk__5ff8a09/assertk/src/commonMain/kotlin/assertk/assertions/support/ListDiffer.kt | package assertk.assertions.support
/**
* List diffing using the Myers diff algorithm.
*/
internal object ListDiffer {
fun diff(a: List<*>, b: List<*>): List<Edit> {
val diff = mutableListOf<Edit>()
backtrack(a, b) { prevX, prevY, x, y ->
diff.add(
0, when {
... | [
{
"class_path": "willowtreeapps__assertk__5ff8a09/assertk/assertions/support/ListDiffer.class",
"javap": "Compiled from \"ListDiffer.kt\"\npublic final class assertk.assertions.support.ListDiffer {\n public static final assertk.assertions.support.ListDiffer INSTANCE;\n\n private assertk.assertions.support... |
tiksem__KotlinSpirit__8c2001f/src/main/java/com/kotlinspirit/ext/RangeExtensions.kt | package com.kotlinspirit.ext
import java.util.StringJoiner
internal operator fun CharRange.minus(range: CharRange): List<CharRange> {
if (range.first <= this.first && range.last >= this.last) {
return emptyList()
}
return if (range.first > this.first && range.last < this.last) {
listOf(
... | [
{
"class_path": "tiksem__KotlinSpirit__8c2001f/com/kotlinspirit/ext/RangeExtensionsKt.class",
"javap": "Compiled from \"RangeExtensions.kt\"\npublic final class com.kotlinspirit.ext.RangeExtensionsKt {\n public static final java.util.List<kotlin.ranges.CharRange> minus(kotlin.ranges.CharRange, kotlin.range... |
JonasKellerer__motivsearch__7d57ab6/src/main/kotlin/org/motivesearch/csma/MotiveGenerator.kt | package org.motivesearch.csma
data class MotiveUnit(val name: String)
data class MotivePosition(val position: Int, val length: Int)
data class Motive(val positions: List<MotivePosition>, val frequency: Int, val sequence: List<MotiveUnit>) {
companion object {
fun fromPositions(positions: List<MotivePosit... | [
{
"class_path": "JonasKellerer__motivsearch__7d57ab6/org/motivesearch/csma/MotiveGenerator.class",
"javap": "Compiled from \"MotiveGenerator.kt\"\npublic final class org.motivesearch.csma.MotiveGenerator {\n public org.motivesearch.csma.MotiveGenerator();\n Code:\n 0: aload_0\n 1: invokespec... |
WeiLianYang__AlgorithmAnalysis__0b2defc/src/com/weiliange/algorithm/AddTwoNumbers.kt | package com.weiliange.algorithm
import kotlin.math.pow
/**
* @author : WilliamYang
* @date : 2022/3/8 11:36
* @description : <a href="https://leetcode-cn.com/problems/add-two-numbers">两数相加</a>
*
* 给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。
* 请你将两个数相加，并以相同形式返回一个表示和的链表。
* 你可以假设除了数字 0 之外，这两个数都不会... | [
{
"class_path": "WeiLianYang__AlgorithmAnalysis__0b2defc/com/weiliange/algorithm/AddTwoNumbersKt.class",
"javap": "Compiled from \"AddTwoNumbers.kt\"\npublic final class com.weiliange.algorithm.AddTwoNumbersKt {\n public static final com.weiliange.algorithm.ListNode addTwoNumbers1(com.weiliange.algorithm.L... |
jihedamine__kotlin_coursera__61e7156/src/rationals/Rational.kt | package rationals
import java.lang.IllegalArgumentException
import java.lang.NumberFormatException
import java.math.BigInteger
class Rational {
private val numerator: BigInteger
private val denominator: BigInteger
constructor(numerator: BigInteger) : this(numerator, BigInteger.ONE)
constructor(numer... | [
{
"class_path": "jihedamine__kotlin_coursera__61e7156/rationals/Rational$RationalRange.class",
"javap": "Compiled from \"Rational.kt\"\npublic final class rationals.Rational$RationalRange {\n private final rationals.Rational startRational;\n\n private final rationals.Rational endRational;\n\n public rati... |
E3FxGaming__ExtendedCYK-Algorithm__292026d/src/main/kotlin/org/example/e3fxgaming/wortproblem/ExtendedCYKAlgorithm.kt | package org.example.e3fxgaming.wortproblem
fun main() {
val fileContent = InputReader::class.java.getResource("/inputChomskyNF.txt")?.readText() ?: throw Exception("No rules found")
val inputReader = InputReader(fileContent)
val firstTestWord = "abaaba"
val secondTestWord = "abbbba"
val thirdTest... | [
{
"class_path": "E3FxGaming__ExtendedCYK-Algorithm__292026d/org/example/e3fxgaming/wortproblem/ExtendedCYKAlgorithmKt.class",
"javap": "Compiled from \"ExtendedCYKAlgorithm.kt\"\npublic final class org.example.e3fxgaming.wortproblem.ExtendedCYKAlgorithmKt {\n public static final void main();\n Code:\n ... |
HeerKirov__Hedge-v2__8140cd6/server/src/main/kotlin/com/heerkirov/hedge/server/library/compiler/grammar/definintion/SyntaxTable.kt | package com.heerkirov.hedge.server.library.compiler.grammar.definintion
import kotlin.math.max
//语法分析表的定义，作用是和syntax-table.txt中的定义对应。
class SyntaxTable(internal val actionTable: Array<Array<Action?>>,
internal val gotoTable: Array<Array<Int?>>,
private val actionMap: Map<String, I... | [
{
"class_path": "HeerKirov__Hedge-v2__8140cd6/com/heerkirov/hedge/server/library/compiler/grammar/definintion/SyntaxTableKt.class",
"javap": "Compiled from \"SyntaxTable.kt\"\npublic final class com.heerkirov.hedge.server.library.compiler.grammar.definintion.SyntaxTableKt {\n public static final com.heerki... |
HeerKirov__Hedge-v2__8140cd6/server/src/main/kotlin/com/heerkirov/hedge/server/library/compiler/grammar/definintion/SyntaxExpression.kt | package com.heerkirov.hedge.server.library.compiler.grammar.definintion
//文法产生式的定义，作用是和syntax.txt中的定义对应。
/**
* 被定义的文法产生式。
*/
data class SyntaxExpression(val index: Int, val key: KeyNotation, val sequence: List<Notation>)
/**
* 文法产生式中的文法符号。
*/
interface Notation
/**
* 终结符。
*/
interface TerminalNotation : Notat... | [
{
"class_path": "HeerKirov__Hedge-v2__8140cd6/com/heerkirov/hedge/server/library/compiler/grammar/definintion/SyntaxExpression.class",
"javap": "Compiled from \"SyntaxExpression.kt\"\npublic final class com.heerkirov.hedge.server.library.compiler.grammar.definintion.SyntaxExpression {\n private final int i... |
nickaigi__kotlin-in-action__bc2a547/src/ch02/iterations.kt | package ch02
import java.util.*
/* fizzbuzz:
* - if any number is divisible by 3 = Fizz
* - if any number is divisible by 5 = Buzz
* - if number is divisible by both 3 and 5 = FizzBuzz */
fun fizzBuzz(i: Int) = when {
i % 15 == 0 -> "FizzBuzz "
i % 3 == 0 -> "Fizz "
i % 5 == 0 -> "Buzz "
else -> "$i ... | [
{
"class_path": "nickaigi__kotlin-in-action__bc2a547/ch02/IterationsKt.class",
"javap": "Compiled from \"iterations.kt\"\npublic final class ch02.IterationsKt {\n public static final java.lang.String fizzBuzz(int);\n Code:\n 0: nop\n 1: iload_0\n 2: bipush 15\n 4: irem\n ... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/RpsSim.kt | package com.github.brpeterman.advent2022
class RpsSim {
fun simulateAndScore(plays: List<Pair<String, String>>): Int {
return plays.fold(0, { total, play ->
total + scorePlay(play.first, toPlay(play.second))
})
}
fun strategizeAndScore(plays: List<Pair<String, String>>): Int {
... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/RpsSim.class",
"javap": "Compiled from \"RpsSim.kt\"\npublic final class com.github.brpeterman.advent2022.RpsSim {\n public static final com.github.brpeterman.advent2022.RpsSim$Companion Companion;\n\n private static final j... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/ForestSurvey.kt | package com.github.brpeterman.advent2022
class ForestSurvey(input: String) {
data class Coords(val row: Int, val column: Int)
data class TreeMap(val width: Int, val height: Int, val trees: Map<Coords, Int>)
enum class Offset(val rowOffset: Int, val colOffset: Int) {
NORTH(-1, 0),
SOUTH(1, 0... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/ForestSurvey$Offset.class",
"javap": "Compiled from \"ForestSurvey.kt\"\npublic final class com.github.brpeterman.advent2022.ForestSurvey$Offset extends java.lang.Enum<com.github.brpeterman.advent2022.ForestSurvey$Offset> {\n ... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/KeepAway.kt | package com.github.brpeterman.advent2022
import java.util.LinkedList
import java.util.SortedMap
typealias ArithmeticOperation = (Long, Long) -> Long
typealias MonkeyRule = (Long) -> KeepAway.ItemPass
class KeepAway(input: String, worryDecay: Int) {
data class Monkey(val holding: LinkedList<Long>, val rule: Monke... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/KeepAway$Operation.class",
"javap": "Compiled from \"KeepAway.kt\"\npublic final class com.github.brpeterman.advent2022.KeepAway$Operation extends java.lang.Enum<com.github.brpeterman.advent2022.KeepAway$Operation> {\n privat... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/CrateCrane.kt | package com.github.brpeterman.advent2022
import java.util.*
class CrateCrane {
data class CrateState(val stacks: MutableMap<Int, LinkedList<Char>>, val moves: List<CrateMove>)
data class CrateMove(val count: Int, val from: Int, val to: Int)
fun reportStacks(stacks: List<LinkedList<Char>>): String {
... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/CrateCrane$CraneMode.class",
"javap": "Compiled from \"CrateCrane.kt\"\npublic final class com.github.brpeterman.advent2022.CrateCrane$CraneMode extends java.lang.Enum<com.github.brpeterman.advent2022.CrateCrane$CraneMode> {\n... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/HillClimber.kt | package com.github.brpeterman.advent2022
import java.util.LinkedList
class HillClimber(input: String) {
data class HeightMap(val startPos: Coords, val endPos: Coords, val elevations: Map<Coords, Int>)
data class Coords(val row: Int, val col: Int) {
operator fun plus(other: Coords): Coords {
... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/HillClimber$Companion.class",
"javap": "Compiled from \"HillClimber.kt\"\npublic final class com.github.brpeterman.advent2022.HillClimber$Companion {\n private com.github.brpeterman.advent2022.HillClimber$Companion();\n Co... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/RopeSnake.kt | package com.github.brpeterman.advent2022
class RopeSnake {
data class Coords(val row: Int, val column: Int) {
operator fun plus(other: Coords): Coords {
return Coords(row + other.row, column + other.column)
}
}
enum class Direction(val offset: Coords) {
UP(Coords(-1, 0))... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/RopeSnake$Coords.class",
"javap": "Compiled from \"RopeSnake.kt\"\npublic final class com.github.brpeterman.advent2022.RopeSnake$Coords {\n private final int row;\n\n private final int column;\n\n public com.github.brpeterm... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/DirTree.kt | package com.github.brpeterman.advent2022
class DirTree(input: String, val root: Folder = Folder("")) {
init {
constructTree(parseInput(input))
}
data class Folder(val name: String, val parent: Folder? = null, val children: MutableMap<String, Folder> = mutableMapOf(), val files: MutableMap<String, ... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/DirTree.class",
"javap": "Compiled from \"DirTree.kt\"\npublic final class com.github.brpeterman.advent2022.DirTree {\n public static final com.github.brpeterman.advent2022.DirTree$Companion Companion;\n\n private final com.... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/CampSections.kt | package com.github.brpeterman.advent2022
class CampSections {
fun countOverlaps(assignments: List<Pair<IntRange, IntRange>>): Int {
return assignments.fold(0, { total, assignment ->
if ((assignment.second.contains(assignment.first.first)) ||
(assignment.second.contains(assignmen... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/CampSections.class",
"javap": "Compiled from \"CampSections.kt\"\npublic final class com.github.brpeterman.advent2022.CampSections {\n public static final com.github.brpeterman.advent2022.CampSections$Companion Companion;\n\n... |
brpeterman__advent2022__1407ca8/src/main/kotlin/com/github/brpeterman/advent2022/Rucksacks.kt | package com.github.brpeterman.advent2022
class Rucksacks {
fun scoreMisfits(rucksacks: List<Pair<Set<String>, Set<String>>>): Int {
return rucksacks.fold(0) { total, sack ->
val misfit = sack.first.intersect(sack.second).first()
total + score(misfit)
}
}
fun scoreBa... | [
{
"class_path": "brpeterman__advent2022__1407ca8/com/github/brpeterman/advent2022/Rucksacks$Companion.class",
"javap": "Compiled from \"Rucksacks.kt\"\npublic final class com.github.brpeterman.advent2022.Rucksacks$Companion {\n private com.github.brpeterman.advent2022.Rucksacks$Companion();\n Code:\n ... |
Lazalatin__advent-of-code-2020__816e0e0/src/main/kotlin/de/bitfroest/aoc2020/Day01.kt | package de.bitfroest.aoc2020
object Day01 {
private fun Pair<Int, Int>.sum() = first + second
private fun Pair<Int, Int>.product() = first * second
private fun List<Int>.toPairs(): Sequence<Pair<Int, Int>> {
return this.asSequence().flatMapIndexed { i, first ->
this.drop(i).map { secon... | [
{
"class_path": "Lazalatin__advent-of-code-2020__816e0e0/de/bitfroest/aoc2020/Day01.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class de.bitfroest.aoc2020.Day01 {\n public static final de.bitfroest.aoc2020.Day01 INSTANCE;\n\n private de.bitfroest.aoc2020.Day01();\n Code:\n 0: aload... |
dremme__coding-kotlin__1bdd663/src/main/algorithms/Quicksort.kt | package algorithms
/**
* Sorts the array using quicksort. Elements must be greater than zero.
*/
fun IntArray.quicksort() {
require(all { it > 0 })
quicksort(0, size - 1)
}
/**
* Quicksort algorithm picking the highest element as pivot,
* so elements are only shifted to the right if they are
*/
private f... | [
{
"class_path": "dremme__coding-kotlin__1bdd663/algorithms/QuicksortKt.class",
"javap": "Compiled from \"Quicksort.kt\"\npublic final class algorithms.QuicksortKt {\n public static final void quicksort(int[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String <this>\n ... |
dremme__coding-kotlin__1bdd663/src/main/arrays/SpecialNumbers.kt | package arrays
/**
* Finds the minimum and maximum values. Elements can be any integer.
*
* @return a tuple of `(min, max)` or `null` if the array is empty.
*/
fun IntArray.findMinMaxNumbers(): Pair<Int, Int>? {
if (isEmpty()) return null
var min = Int.MAX_VALUE
var max = Int.MIN_VALUE
forEach {
... | [
{
"class_path": "dremme__coding-kotlin__1bdd663/arrays/SpecialNumbersKt.class",
"javap": "Compiled from \"SpecialNumbers.kt\"\npublic final class arrays.SpecialNumbersKt {\n public static final kotlin.Pair<java.lang.Integer, java.lang.Integer> findMinMaxNumbers(int[]);\n Code:\n 0: aload_0\n ... |
alexiscrack3__algorithms-kotlin__a201986/src/main/kotlin/search/BinarySearch.kt | package search
class BinarySearch {
fun binarySearch(arr: IntArray, l: Int, r: Int, key: Int): Int {
if (r < l) return -1
val mid = (l + r) / 2
if (key == arr[mid]) {
return mid
}
return if (key > arr[mid]) {
binarySearch(arr, mid + 1, r, key)
... | [
{
"class_path": "alexiscrack3__algorithms-kotlin__a201986/search/BinarySearch.class",
"javap": "Compiled from \"BinarySearch.kt\"\npublic final class search.BinarySearch {\n public search.BinarySearch();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\... |
techstay__kotlin-study__822a02c/kotlin-samples/src/yitian/study/skilled/collections.kt | package yitian.study.skilled
fun main(args: Array<String>) {
//获取订单数最多的顾客
val customerOfMaxOrder = orders().groupBy { it.customer }
.maxBy { it.value.size }
?.key
println("获取订单数最多的顾客:$customerOfMaxOrder")
//获取订单金额最多的顾客
val customerOfMaxOrderPrice = orders().groupBy { it.cu... | [
{
"class_path": "techstay__kotlin-study__822a02c/yitian/study/skilled/CollectionsKt$main$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class yitian.study.skilled.CollectionsKt$main$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public yitian.study.skilled.... |
ariannysOronoz__tutorialKotlin__a779f54/CombinacionesPalabras/src/main/java/Main.kt | package com.includehelp.basic
import java.util.*
/* fun main(args: Array<String>) {
val num = 10
var i = 1
var factorial: Long = 1
while (i <= num) {
factorial *= i.toLong()
i++
}
println(" El Factorial de $num = $factorial")
}*/
// Kotlin... | [
{
"class_path": "ariannysOronoz__tutorialKotlin__a779f54/com/includehelp/basic/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.includehelp.basic.MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
zebalu__advent2020__ca54c64/day_07/src/main/kotlin/io/github/zebalu/advent2020/BagRuleReader.kt | package io.github.zebalu.advent2020
typealias Rules = Map<String, Set<Pair<Int, String>>>
object BagRuleReader {
fun readRules(lines: List<String>): Rules {
val result = mutableMapOf<String, MutableSet<Pair<Int, String>>>()
lines.forEach { line ->
val parts = line.split(" bags contain ")
val type = parts... | [
{
"class_path": "zebalu__advent2020__ca54c64/io/github/zebalu/advent2020/BagRuleReader.class",
"javap": "Compiled from \"BagRuleReader.kt\"\npublic final class io.github.zebalu.advent2020.BagRuleReader {\n public static final io.github.zebalu.advent2020.BagRuleReader INSTANCE;\n\n private io.github.zebalu... |
zebalu__advent2020__ca54c64/day_13/src/main/kotlin/io/github/zebalu/advent2020/IdealTimeFinder.kt | package io.github.zebalu.advent2020
import java.math.BigInteger
object IdealTimeFinder {
fun findTime2(buses: List<Pair<Int, Int>>): Long = longBuses(buses)
.fold(Pair(0L, 1L)) { acc, next -> applyBus(acc.first, acc.second, next.first, next.second) }.first
private fun applyBus(sum: Long, interval: Long, bus: Lo... | [
{
"class_path": "zebalu__advent2020__ca54c64/io/github/zebalu/advent2020/IdealTimeFinder.class",
"javap": "Compiled from \"IdealTimeFinder.kt\"\npublic final class io.github.zebalu.advent2020.IdealTimeFinder {\n public static final io.github.zebalu.advent2020.IdealTimeFinder INSTANCE;\n\n private io.githu... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/oct_challenge2021/Trie.kt | package oct_challenge2021
fun main() {
val trie = Trie()
trie.insert("apple")
val res1 = trie.search("apple")
assert(res1)
val res2 = trie.search("app")
assert(!res2)
val res3 = trie.startsWith("app")
assert(res3)
trie.insert("app")
val res4 = trie.search("app")
assert(res4)... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/oct_challenge2021/Trie.class",
"javap": "Compiled from \"Trie.kt\"\npublic final class oct_challenge2021.Trie {\n private final oct_challenge2021.TrieNode root;\n\n public oct_challenge2021.Trie();\n Code:\n 0: aload_0\n 1: invokespecial ... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/oct_challenge2021/LongestCommonSubsequence.kt | package oct_challenge2021
fun main() {
assert(longestCommonSubsequence("abcde", "ace") == 3)
assert(longestCommonSubsequence("abc", "def") == 0)
assert(longestCommonSubsequence("abc", "abc") == 2)
val res = longestCommonSubsequence("abc", "abc")
println(res)
}
fun longestCommonSubsequence(text1: S... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/oct_challenge2021/LongestCommonSubsequenceKt.class",
"javap": "Compiled from \"LongestCommonSubsequence.kt\"\npublic final class oct_challenge2021.LongestCommonSubsequenceKt {\n public static final void main();\n Code:\n 0: ldc #8 ... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/oct_challenge2021/IslandPerimeter.kt | package oct_challenge2021
fun main() {
val grid = arrayOf(
intArrayOf(0, 1, 0, 0),
intArrayOf(1, 1, 1, 0),
intArrayOf(0, 1, 0, 0),
intArrayOf(1, 1, 0, 0),
)
val result = Solution().islandPerimeter(grid)
assert(result == 16)
println(result)
}
class Solution {
pri... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/oct_challenge2021/IslandPerimeterKt.class",
"javap": "Compiled from \"IslandPerimeter.kt\"\npublic final class oct_challenge2021.IslandPerimeterKt {\n public static final void main();\n Code:\n 0: iconst_4\n 1: anewarray #8 ... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/bk70/Problem3.kt | package bk70
import java.util.*
// [[0,2,0]]
// [2,2]
// [0,1]
// 1
fun main() {
val res = Problem3().highestRankedKItems(
arrayOf(
intArrayOf(0, 2, 0),
),
intArrayOf(2, 2),
intArrayOf(0, 1),
1
)
println(res)
}
class Problem3 {
private lateinit var ... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/bk70/Problem3$highestRankedKItems$$inlined$thenBy$3.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class bk70.Problem3$highestRankedKItems$$inlined$thenBy$3<T> implements java.util.Comparator {\n final java.util.Comparator $this_thenBy;... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/wk271/Problem3.kt | package wk271
fun main() {
// val res = Problem3().minimumRefill(intArrayOf(2,2,3,3), 5 ,5)
// val res = Problem3().minimumRefill(intArrayOf(2,2,3,3), 3 ,4)
val res = Problem3().minimumRefill(intArrayOf(2, 2, 5, 2, 2), 5, 5)
println(res)
}
class Problem3 {
fun minimumRefill(plants: IntArray, capacit... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/wk271/Problem3Kt.class",
"javap": "Compiled from \"Problem3.kt\"\npublic final class wk271.Problem3Kt {\n public static final void main();\n Code:\n 0: new #8 // class wk271/Problem3\n 3: dup\n 4: invokespe... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/bk65/Problem1.kt | package bk65
import kotlin.math.abs
fun main() {
// "aaaa"
// "bccb"
val resul = Problem1().checkAlmostEquivalent("aaaa", "bccb")
println(resul)
}
class Problem1 {
fun checkAlmostEquivalent(word1: String, word2: String): Boolean {
val map1 = word1.toCharArray().toList().groupingBy { it }.e... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/bk65/Problem1$checkAlmostEquivalent$$inlined$groupingBy$2.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class bk65.Problem1$checkAlmostEquivalent$$inlined$groupingBy$2 implements kotlin.collections.Grouping<java.lang.Character, java.la... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/sep_challenge2021/ShortestPathGridWithObstacles.kt | package sep_challenge2021
import java.util.*
fun main() {
val grid = arrayOf(
intArrayOf(0, 0, 0),
intArrayOf(1, 1, 0),
intArrayOf(0, 0, 0),
intArrayOf(0, 1, 1),
intArrayOf(0, 0, 0),
)
val result = shortestPath(grid, 1)
assert(result == 6)
println(result)
}
... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/sep_challenge2021/ShortestPathGridWithObstaclesKt.class",
"javap": "Compiled from \"ShortestPathGridWithObstacles.kt\"\npublic final class sep_challenge2021.ShortestPathGridWithObstaclesKt {\n private static final int[][] directions;\n\n public static f... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/wk269/Problem2.kt | package wk269
//
fun main() {
val result = Problem2().getAverages(intArrayOf(7, 4, 3, 9, 1, 8, 5, 2, 6), 3)
// val result = Problem2().getAverages(intArr, 10)
println(result)
}
class Problem2 {
fun getAverages(nums: IntArray, k: Int): IntArray {
if (k * 2 > nums.size - 1) return IntArray(nums.s... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/wk269/Problem2.class",
"javap": "Compiled from \"Problem2.kt\"\npublic final class wk269.Problem2 {\n public wk269.Problem2();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4:... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/wk269/Problem3.kt | package wk269
import kotlin.math.min
fun main() {
val result = Problem3().minimumDeletions(intArrayOf(1, 2))
println(result)
}
class Problem3 {
fun minimumDeletions(nums: IntArray): Int {
// Find indices of min and max elements
var minIndex = 0
var maxIndex = 0
for ((index... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/wk269/Problem3Kt.class",
"javap": "Compiled from \"Problem3.kt\"\npublic final class wk269.Problem3Kt {\n public static final void main();\n Code:\n 0: new #8 // class wk269/Problem3\n 3: dup\n 4: invokespe... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/feb_challenge2023/ShortestPathWithAltColors.kt | package feb_challenge2023
import java.util.*
fun main() {
val result =
ShortestPathWithAltColors()
.shortestAlternatingPaths(
5,
arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4)),
arrayOf(intArrayOf(1, 2), intArrayOf... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/feb_challenge2023/ShortestPathWithAltColors$Point.class",
"javap": "Compiled from \"ShortestPathWithAltColors.kt\"\npublic final class feb_challenge2023.ShortestPathWithAltColors$Point {\n private final int value;\n\n private final int color;\n\n publi... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/bk69/Problem3.kt | package bk69
// ["dd","aa","bb","dd","aa","dd","bb","dd","aa","cc","bb","cc","dd","cc"]
fun main() {
val res = Problem3().longestPalindrome(
arrayOf(
"xx", "zz"
)
)
println(res)
}
class Problem3 {
fun longestPalindrome(words: Array<String>): Int {
val countMap = wor... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/bk69/Problem3$longestPalindrome$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class bk69.Problem3$longestPalindrome$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.String, java.lang.String> ... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/bk66/Problem3.kt | package bk66
fun main() {
val result = Problem3().minCost(intArrayOf(0, 3), intArrayOf(2, 3), intArrayOf(5, 4, 3), intArrayOf(8, 2, 6, 7))
println(result)
}
class Problem3 {
fun minCost(startPos: IntArray, homePos: IntArray, rowCosts: IntArray, colCosts: IntArray): Int {
val startI = startPos[0]
... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/bk66/Problem3Kt.class",
"javap": "Compiled from \"Problem3.kt\"\npublic final class bk66.Problem3Kt {\n public static final void main();\n Code:\n 0: new #8 // class bk66/Problem3\n 3: dup\n 4: invokespecia... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/nov_challenge2021/UniquePathsIII.kt | package nov_challenge2021
fun main() {
val grid1 = arrayOf(
intArrayOf(1, 0, 0, 0),
intArrayOf(0, 0, 0, 0),
intArrayOf(0, 0, 2, -1),
)
val res1 = UniquePathsIII().uniquePathsIII(grid1)
assert(res1 == 2)
val grid2 = arrayOf(
intArrayOf(0, 1),
intArrayOf(2, 0)... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/nov_challenge2021/UniquePathsIII.class",
"javap": "Compiled from \"UniquePathsIII.kt\"\npublic final class nov_challenge2021.UniquePathsIII {\n private int result;\n\n private int[][] visited;\n\n private int[][] grid;\n\n private int obstaclesCount;\... |
yvelianyk__leetcode-kotlin__780d659/src/main/kotlin/oct_challenge2021/wordSearchII/WordSearchII.kt | package oct_challenge2021.wordSearchII
fun main() {
val matrix = arrayOf(
charArrayOf('o', 'a', 'a', 'n'),
charArrayOf('e', 't', 'a', 'e'),
charArrayOf('i', 'h', 'k', 'r'),
charArrayOf('i', 'f', 'l', 'v'),
)
val words = arrayOf("oath", "pea", "eat", "rain")
val result = ... | [
{
"class_path": "yvelianyk__leetcode-kotlin__780d659/oct_challenge2021/wordSearchII/WordSearchIIKt.class",
"javap": "Compiled from \"WordSearchII.kt\"\npublic final class oct_challenge2021.wordSearchII.WordSearchIIKt {\n public static final void main();\n Code:\n 0: iconst_4\n 1: anewarray ... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day07/day07.kt | package day07
import java.io.File
data class Bid(val hand: String, val bet: Int)
fun main() {
run(encode1, ::part1)
run(encode2, ::part2)
}
fun run(encode: Map<Char, Char>, rank: (String) -> Char) {
val result = File("input.data").readLines().map { parseHand(it, encode, rank) }.sortedBy { it.hand }.with... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day07/Day07Kt$part1$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class day07.Day07Kt$part1$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public day07.Day07Kt$part1$$inlined$sortedBy$1();\n Code:\n ... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day08/day08.kt | package day08
import java.io.File
data class Targets(val left: String, val right: String)
fun main() {
run(start = { it == "AAA" }, end = { it == "ZZZ" })
run(start = { it.endsWith('A') }, end = { it.endsWith('Z') })
}
fun run(start: (String) -> Boolean, end: (String) -> Boolean) {
val lines = File("inp... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day08/Day08Kt$turnSequence$1.class",
"javap": "Compiled from \"day08.kt\"\nfinal class day08.Day08Kt$turnSequence$1 extends kotlin.coroutines.jvm.internal.RestrictedSuspendLambda implements kotlin.jvm.functions.Function2<kotlin.sequences.SequenceScope<? supe... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day06/day06.kt | package day06
import java.io.File
import kotlin.math.ceil
import kotlin.math.sqrt
data class Race(val time: Long, val distance: Long)
fun main() {
run(::part1, ::solve)
run(::part1, ::altSolve)
run(::part2, ::solve)
run(::part2, ::altSolve)
}
fun run(part: (String) -> List<Long>, solution: (Race) ->... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day06/Day06Kt$main$8.class",
"javap": "Compiled from \"day06.kt\"\nfinal class day06.Day06Kt$main$8 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<day06.Race, java.lang.Long> {\n public static final day06.Day06Kt... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day04/day04.kt | package day04
import java.io.File
fun main() {
Part1("input.data").run()
Part2("input.data").run()
}
data class Card(val matchingNumbers: Int, var copies: Int = 1)
abstract class Day04(val fileName: String) {
val cards = parseInput()
fun run() {
var result = 0
for ((idx, card) in c... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day04/Day04Kt.class",
"javap": "Compiled from \"day04.kt\"\npublic final class day04.Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class day04/Part1\n 3: dup\n 4: ldc #10 ... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day03/day03.kt | package day03
import java.io.File
fun main() {
run(::part1)
run(::part2)
}
data class Number(val value: Int, val row: Int, val colStart: Int, var colEnd: Int)
fun run(part: (numbers: List<Number>, char: Char, row: Int, col: Int) -> Int) {
val lines = File("input.data").readLines()
val numbers = pars... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day03/Day03Kt.class",
"javap": "Compiled from \"day03.kt\"\npublic final class day03.Day03Kt {\n public static final void main();\n Code:\n 0: getstatic #12 // Field day03/Day03Kt$main$1.INSTANCE:Lday03/Day03Kt$main$1;\n 3... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day03_oop/day03_oop.kt | package day03_oop
import java.io.File
fun main() {
Part1("input.data").run()
Part2("input.data").run()
}
data class Number(val value: Int, val row: Int, val colStart: Int, var colEnd: Int)
abstract class Day03(fileName: String) {
private val lines = File(fileName).readLines()
val numbers = parseEngi... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day03_oop/Day03_oopKt.class",
"javap": "Compiled from \"day03_oop.kt\"\npublic final class day03_oop.Day03_oopKt {\n public static final void main();\n Code:\n 0: new #8 // class day03_oop/Part1\n 3: dup\n 4: ... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day02/day02.kt | package day02
import java.io.File
import kotlin.math.max
data class Game(val id: Int, val colors: Colors)
data class Colors(val red: Int, val green: Int, val blue: Int)
fun main() {
println(run(::part1))
println(run(::part2))
}
fun run(score: (Game) -> Int): Int = File("input.data").readLines().sumOf { scor... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day02/Day02Kt.class",
"javap": "Compiled from \"day02.kt\"\npublic final class day02.Day02Kt {\n public static final void main();\n Code:\n 0: getstatic #12 // Field day02/Day02Kt$main$1.INSTANCE:Lday02/Day02Kt$main$1;\n 3... |
andrew-suprun__AoC-2023__dd5f53e/src/main/kotlin/day05/day05.kt | package day05
import java.io.File
import kotlin.math.max
import kotlin.math.min
fun main() {
run(::part1)
run(::part2)
}
data class Map(val range: LongRange, val inc: Long)
data class Model(val seeds: List<LongRange>, val allMaps: List<List<Map>>)
fun run(part: (String) -> List<LongRange>) {
val model =... | [
{
"class_path": "andrew-suprun__AoC-2023__dd5f53e/day05/Day05Kt.class",
"javap": "Compiled from \"day05.kt\"\npublic final class day05.Day05Kt {\n public static final void main();\n Code:\n 0: getstatic #12 // Field day05/Day05Kt$main$1.INSTANCE:Lday05/Day05Kt$main$1;\n 3... |
RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/easy/TwoNumberSum.kt | package com.ztoais.dailycoding.algoexpert.easy
/*
Two Number Sum
Write a function that takes in a non-empty array of distinct integers and an integer representing a target sum. If any
two numbers in the input array sum up to the target sum, the function should return then in an array. in any order. if
no two numbers s... | [
{
"class_path": "RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/easy/TwoNumberSumKt.class",
"javap": "Compiled from \"TwoNumberSum.kt\"\npublic final class com.ztoais.dailycoding.algoexpert.easy.TwoNumberSumKt {\n public static final java.util.List<java.lang.Integer> twoNumberSum(j... |
RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/hard/FourNumberSum.kt | package com.ztoais.dailycoding.algoexpert.hard
/*
Write a function that takes in a non-empty array of distinct integers and an integer representing a target sum. The
function should find all quadruplets in the array that sum up to the target sum and return a tow-dimensional array of
all these quadruplets in no part... | [
{
"class_path": "RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/hard/FourNumberSumKt.class",
"javap": "Compiled from \"FourNumberSum.kt\"\npublic final class com.ztoais.dailycoding.algoexpert.hard.FourNumberSumKt {\n public static final java.util.List<java.util.List<java.lang.Integ... |
RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/medium/ThreeNumberSum.kt | package com.ztoais.dailycoding.algoexpert.medium
import kotlin.io.path.createTempDirectory
/*
Three Number Sum
Write a function that takes in a non-empty array of distinct integers and an integer representing a target sum. The
function should find all triplets in the array that sum up to the target sum and return a... | [
{
"class_path": "RanjithRagavan__daily-coding__a5f29dd/com/ztoais/dailycoding/algoexpert/medium/ThreeNumberSumKt.class",
"javap": "Compiled from \"ThreeNumberSum.kt\"\npublic final class com.ztoais.dailycoding.algoexpert.medium.ThreeNumberSumKt {\n public static final java.util.List<java.util.List<java.lan... |
DPNT-Sourcecode__CHK-gply01__cb056a9/src/main/kotlin/solutions/CHK/CheckoutSolution.kt | package solutions.CHK
//+------+-------+------------------------+
//| Item | Price | Special offers |
//+------+-------+------------------------+
//| H | 10 | 5H for 45, 10H for 80 |
//| K | 80 | 2K for 150 |
//| N | 40 | 3N get one M free |
//| P | 50 | 5P for 200 ... | [
{
"class_path": "DPNT-Sourcecode__CHK-gply01__cb056a9/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 static final java.util.List<java.lang... |
DPNT-Sourcecode__CHK-ojzb01__035af07/src/main/kotlin/solutions/CHK/CheckoutSolution.kt | package solutions.CHK
data class Product(val price: Int, val offers: List<Offer> = listOf())
data class Offer(
val requiredCount: Int,
val price: Int,
val freeItem: Char? = null,
val freeItemCount: Int = 1,
val groupItems: List<Char>? = null
)
object CheckoutSolution {
private var productMap =... | [
{
"class_path": "DPNT-Sourcecode__CHK-ojzb01__035af07/solutions/CHK/CheckoutSolution$processGroupDiscounts$lambda$10$lambda$9$$inlined$sortedByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class solutions.CHK.CheckoutSolution$processGroupDiscounts$lambda$10$lambda$9$$inlined$... |
gabriaraujo__scrabble__9623ecc/app/src/main/java/com/exemple/scrabble/Trie.kt | package com.exemple.scrabble
import java.lang.StringBuilder
import java.util.ArrayList
/**
* Title: Trie
*
* Author: <NAME>
*
* Brief:
* This object represents the implementation of a Trie tree for a 26 letter
* alphabet.
*
* Descrição:
* A Trie tree, or prefix tree, is an ordered tree that can be used to s... | [
{
"class_path": "gabriaraujo__scrabble__9623ecc/com/exemple/scrabble/Trie.class",
"javap": "Compiled from \"Trie.kt\"\npublic final class com.exemple.scrabble.Trie {\n public static final com.exemple.scrabble.Trie INSTANCE;\n\n public static final int alphabet;\n\n private static com.exemple.scrabble.Tri... |
StarWishsama__Comet-Bot__19ed20e/comet-utils/src/main/kotlin/ren/natsuyuk1/comet/utils/string/FuzzyMatch.kt | package ren.natsuyuk1.comet.utils.string
import java.math.BigDecimal
import java.math.RoundingMode
import kotlin.math.max
/**
* The Levenshtein distance between two words is the minimum number of
* single-character edits (insertions, deletions or substitutions) required to
* change one string into the other.
*
*... | [
{
"class_path": "StarWishsama__Comet-Bot__19ed20e/ren/natsuyuk1/comet/utils/string/FuzzyMatchKt.class",
"javap": "Compiled from \"FuzzyMatch.kt\"\npublic final class ren.natsuyuk1.comet.utils.string.FuzzyMatchKt {\n public static final double levenshteinDistance(java.lang.String, java.lang.String, int);\n ... |
NextTurnGames__Wordle__5e0f21a/src/main/kotlin/Main.kt | package games.nextturn
import java.io.File
import java.lang.RuntimeException
var allWords = setOf<String>()
var commonWords = setOf<String>()
fun main() {
loadWords()
println("Available choices:")
println("[1] Input grades (use as aide)")
println("[2] Test against random word")
println("[3] Test... | [
{
"class_path": "NextTurnGames__Wordle__5e0f21a/games/nextturn/MainKt$bestFirstGuess$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class games.nextturn.MainKt$bestFirstGuess$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public games.nextturn.MainKt$bestFi... |
fifth-postulate__parser-combinators__61f2c62/presentation/javagilde/code/src/main/kotlin/javagilde/final.kt | package javagilde
// We willen expressies parsen, d.w.z 5*2 + 1
sealed class Expression {
abstract fun evaluate(): Int
}
data class Multiplication(val left: Expression, val right: Expression): Expression() {
override fun evaluate(): Int =
left.evaluate() * right.evaluate()
}
data class Addition(val ... | [
{
"class_path": "fifth-postulate__parser-combinators__61f2c62/javagilde/FinalKt$addition$1.class",
"javap": "Compiled from \"final.kt\"\nfinal class javagilde.FinalKt$addition$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function0<kotlin.jvm.functions.Function1<? super... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day4/Day4.kt | package day4
class Day4 {
fun getOrganizer(filename: String): SupplyOrganizer {
val readLines = this::class.java.getResourceAsStream(filename).bufferedReader().readLines()
return SupplyOrganizer(readLines)
}
}
class SupplyOrganizer(input: List<String>) {
val elfPairs = input.map { ElfPair... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day4/Day4.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class day4.Day4 {\n public day4.Day4();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n pu... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day3/Day3.kt | package day3
class Day3 {
fun getOrganizer(filename: String): RucksackOrganizer {
val readLines = this::class.java.getResourceAsStream(filename).bufferedReader().readLines()
return RucksackOrganizer(readLines)
}
}
data class RucksackOrganizer(val input: List<String>) {
val rucksacks = inp... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day3/Day3.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class day3.Day3 {\n public day3.Day3();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n pu... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day2/Day2.kt | package day2
import java.lang.IllegalArgumentException
class Day2 {
fun getGameStore(filename: String): GameStore {
val readLines = this::class.java.getResourceAsStream(filename).bufferedReader().readLines()
return GameStore(
readLines.map { Round(Shape.fromString(it[0]), Shape.fromSt... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day2/Day2.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class day2.Day2 {\n public day2.Day2();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n pu... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day5/Day5.kt | package day5
class Day5 {
fun getOrganizer(filename: String): CrateOrganizer {
val readLines = this::class.java.getResourceAsStream(filename).bufferedReader().readLines()
return CrateOrganizer(readLines)
}
}
/*
[N] [C] [Z]
[Q] [G] [V] [S] [V]
[L] [C] [M] [T... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day5/Day5.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class day5.Day5 {\n public day5.Day5();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n pu... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day7/Day7.kt | package day7
import day6.Day6
class Day7(input: List<String>) {
val commands = parseCommands(listOf(), input)
private val pathMap = buildMap()
private fun parseCommands(initial: List<Command>, input: List<String>): List<Command> {
if (input.isEmpty()) return initial
val line = in... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day7/Day7.class",
"javap": "Compiled from \"Day7.kt\"\npublic final class day7.Day7 {\n private final java.util.List<day7.Command> commands;\n\n private final java.util.Map<java.lang.String, kotlin.Pair<java.lang.Integer, java.util.List<java.lang.St... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day9/Day9.kt | package day9
import java.lang.IllegalArgumentException
class Day9(val input: List<String>) {
private val board = Board(Point(0, 0), Point(0, 0), Point(0, 0), mapOf())
private val rope = (1..10).map { Point(0, 0) }.toMutableList()
private val board2 = Board2(Point(0, 0), rope, mutableMapOf())
private... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day9/Day9Kt.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class day9.Day9Kt {\n private static final day9.Point calculateTail(day9.Point, day9.Point);\n Code:\n 0: aload_0\n 1: aload_1\n 2: invokestatic #12 ... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day8/Day8.kt | package day8
class Day8(val input: List<String>) {
private val transposed = transpose(input)
val inputInts = input.map { it.toCharArray().map { it.digitToInt() } }
val transposedInts = transposed.map { it.toCharArray().map { it.digitToInt() } }
val visibleFromLeft = input.mapIndexed { rowNo, row ... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day8/Day8$part1$$inlined$compareBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class day8.Day8$part1$$inlined$compareBy$1<T> implements java.util.Comparator {\n public day8.Day8$part1$$inlined$compareBy$1();\n Code:\n ... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day6/Day6.kt | package day6
class Day6(val input: String) {
private val listOfWindows = (0..input.length-4).map { input.substring(it, it+4) }
private val messageMarkerWindows = (0..input.length-14).map { input.substring(it, it+14) }
fun startOfPacket(): Int {
return listOfWindows.indexOfFirst { !it.contains... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day6/Day6.class",
"javap": "Compiled from \"Day6.kt\"\npublic final class day6.Day6 {\n private final java.lang.String input;\n\n private final java.util.List<java.lang.String> listOfWindows;\n\n private final java.util.List<java.lang.String> messa... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day11/Day11.kt | package day11
import java.lang.IllegalArgumentException
class Day11(val input: List<String>) {
fun part1(): Long {
val monkies = parseInput(input, true)
println(monkies)
val game = Game(monkies)
(0 until 20).forEach { _ ->
game.performRound(1)
}
... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day11/Day11.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class day11.Day11 {\n private final java.util.List<java.lang.String> input;\n\n public day11.Day11(java.util.List<java.lang.String>);\n Code:\n 0: aload_1\n 1: ldc... |
mortenberg80__adventofcode2022__b21978e/src/main/kotlin/day10/Day10.kt | package day10
class Day10(private val input: List<String>) {
private val commands = parseCommands(input)
private fun parseCommands(input: List<String>): List<Command> {
return input.flatMap { parseCommand(it) }
}
private fun parseCommand(input: String): List<Command> {
if (input ... | [
{
"class_path": "mortenberg80__adventofcode2022__b21978e/day10/Day10.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class day10.Day10 {\n private final java.util.List<java.lang.String> input;\n\n private final java.util.List<day10.Command> commands;\n\n public day10.Day10(java.util.List<java.... |
erolsvik__advent-of-code-2022__82f1bbb/src/main/kotlin/day2/Day2.kt | package day2
import java.io.File
val values = mapOf("A" to 1, "B" to 2, "C" to 3)
val values2 = mapOf("X" to 1, "Y" to 2, "Z" to 3)
val winValues = mapOf("X" to "C", "Y" to "A", "Z" to "B")
val lossValues = mapOf("X" to "B", "Y" to "C", "Z" to "A")
val drawValues = mapOf("X" to "A", "Y" to "B", "Z" to "C")
var totalS... | [
{
"class_path": "erolsvik__advent-of-code-2022__82f1bbb/day2/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class day2.Day2Kt {\n private static final java.util.Map<java.lang.String, java.lang.Integer> values;\n\n private static final java.util.Map<java.lang.String, java.lang.Integer> va... |
KosmX__jneedle__b8d3ed1/api/src/main/kotlin/dev/kosmx/needle/util/KMP.kt | package dev.kosmx.needle.util
/**
* O(n+m) pattern matching with Knuth-Morris-Pratt algo
*
* @param T has to be comparable (== or .equals has to work as data-classes)
*/
class Word<T>(val word: Array<T>, private val comparator: (T, T) -> Boolean = { a, b -> a == b }) {
init {
require(word.isNotEmpty())... | [
{
"class_path": "KosmX__jneedle__b8d3ed1/dev/kosmx/needle/util/KMPKt.class",
"javap": "Compiled from \"KMP.kt\"\npublic final class dev.kosmx.needle.util.KMPKt {\n public static final <T> int match(dev.kosmx.needle.util.Word<T>, java.lang.Iterable<? extends T>);\n Code:\n 0: aload_0\n 1: ldc... |
RedwanSharafatKabir__OOP-Kotlin__f764850/src/All_Filters_and_Built_In_Functions/getOrElse_first_last_map_max_min_filter_all_any_associateBy_groupBy.kt | package All_Filters_and_Built_In_Functions
data class Hero(
val name: String,
val age: Int,
val gender: Gender?
)
enum class Gender { MALE, FEMALE }
fun main (args: Array<String>){
val heroes = listOf(
Hero("The Captain", 60, Gender.MALE),
Hero("Frenchy", 42, Gender... | [
{
"class_path": "RedwanSharafatKabir__OOP-Kotlin__f764850/All_Filters_and_Built_In_Functions/GetOrElse_first_last_map_max_min_filter_all_any_associateBy_groupByKt.class",
"javap": "Compiled from \"getOrElse_first_last_map_max_min_filter_all_any_associateBy_groupBy.kt\"\npublic final class All_Filters_and_Bu... |
TurpIF__coursera-algo-toolbox__86860f8/src/main/kotlin/fr/pturpin/coursera/greedy/MaximumValueOfTheLoot.kt | package fr.pturpin.coursera.greedy
import java.util.*
class MaximumValueOfTheLoot(private val knapsackCapacity: Int) {
private val formatPrecision = 4
private var weightOfCandidates = 0
private val sortedByLowValuationCandidates = PriorityQueue<Item>()
fun addPotentialItem(itemValue: Int, itemWeight... | [
{
"class_path": "TurpIF__coursera-algo-toolbox__86860f8/fr/pturpin/coursera/greedy/MaximumValueOfTheLoot$Item.class",
"javap": "Compiled from \"MaximumValueOfTheLoot.kt\"\nfinal class fr.pturpin.coursera.greedy.MaximumValueOfTheLoot$Item implements java.lang.Comparable<fr.pturpin.coursera.greedy.MaximumValu... |
TurpIF__coursera-algo-toolbox__86860f8/src/main/kotlin/fr/pturpin/coursera/dynprog/ArithmeticExpression.kt | package fr.pturpin.coursera.dynprog
class ArithmeticExpression(private val strExpression: String) {
private val cache = ArrayList<MutableList<MinMaxExpression?>>(strExpression.length)
fun getMaximumValue(): Long {
clearCache()
return computeCachedMaximumValue(0, strExpression.length).maxExpre... | [
{
"class_path": "TurpIF__coursera-algo-toolbox__86860f8/fr/pturpin/coursera/dynprog/ArithmeticExpression.class",
"javap": "Compiled from \"ArithmeticExpression.kt\"\npublic final class fr.pturpin.coursera.dynprog.ArithmeticExpression {\n private final java.lang.String strExpression;\n\n private final java... |
TurpIF__coursera-algo-toolbox__86860f8/src/main/kotlin/fr/pturpin/coursera/dynprog/PrimitiveCalculator.kt | package fr.pturpin.coursera.dynprog
class PrimitiveCalculator(private val number: Int) {
private val availableOperations = listOf(
MultByOperation(2),
MultByOperation(3),
AddToOperation(1)
)
private val cache = mutableMapOf<Int, OperationStates>()
fun getMinimumOperationsToCo... | [
{
"class_path": "TurpIF__coursera-algo-toolbox__86860f8/fr/pturpin/coursera/dynprog/PrimitiveCalculator$NoOpStates.class",
"javap": "Compiled from \"PrimitiveCalculator.kt\"\nfinal class fr.pturpin.coursera.dynprog.PrimitiveCalculator$NoOpStates implements fr.pturpin.coursera.dynprog.PrimitiveCalculator$Ope... |
TurpIF__coursera-algo-toolbox__86860f8/src/main/kotlin/fr/pturpin/coursera/divconquer/QuickSort.kt | package fr.pturpin.coursera.divconquer
import java.util.*
class QuickSort(private val elements: IntArray) {
private val random = Random(42)
fun sortInPlace(): IntArray {
sortInPlace(0, elements.size)
return elements
}
private fun sortInPlace(from: Int, untilExcluded: Int) {
... | [
{
"class_path": "TurpIF__coursera-algo-toolbox__86860f8/fr/pturpin/coursera/divconquer/QuickSort.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class fr.pturpin.coursera.divconquer.QuickSort {\n private final int[] elements;\n\n private final java.util.Random random;\n\n public fr.pturpin... |
eugenenosenko__coding-problems__673cc3e/src/test/kotlin/com/eugenenosenko/coding/problems/arrays/compose_from_old/ComposeArrayFromOldSolution.kt | package com.eugenenosenko.coding.problems.arrays.compose_from_old
// brute force approach
fun createArray(arr: IntArray): IntArray {
val result = mutableListOf<Int>()
for (i in arr.indices) {
result.add(
arr.foldIndexed(1) { index: Int, acc: Int, item: Int ->
// ign... | [
{
"class_path": "eugenenosenko__coding-problems__673cc3e/com/eugenenosenko/coding/problems/arrays/compose_from_old/ComposeArrayFromOldSolutionKt.class",
"javap": "Compiled from \"ComposeArrayFromOldSolution.kt\"\npublic final class com.eugenenosenko.coding.problems.arrays.compose_from_old.ComposeArrayFromOl... |
eugenenosenko__coding-problems__673cc3e/src/test/kotlin/com/eugenenosenko/coding/problems/arrays/pair_with_sum_x/FindPairWithSumXSolution.kt | package com.eugenenosenko.coding.problems.arrays.pair_with_sum_x
fun findPairSolution(arr: IntArray, sum: Int): IntArray {
// sort array first from smallest to largest
// you'll end up with an array [0,1,2,3,5,6]
arr.sort()
// create two pointers
var left = 0
var right = arr.size - 1
whil... | [
{
"class_path": "eugenenosenko__coding-problems__673cc3e/com/eugenenosenko/coding/problems/arrays/pair_with_sum_x/FindPairWithSumXSolutionKt.class",
"javap": "Compiled from \"FindPairWithSumXSolution.kt\"\npublic final class com.eugenenosenko.coding.problems.arrays.pair_with_sum_x.FindPairWithSumXSolutionKt... |
kcchoate__advent-of-kotlin__3e7c24b/src/main/kotlin/day03/Solution.kt | package day03
class Solution {
fun solve(items: List<String>): Int {
val sums = countArray(items)
val target = items.size / 2
val gammaRate = count(sums) { if (it < target) 0 else 1 }
val epsilonRate = count(sums) { if (it < target) 1 else 0 }
return gammaRate * epsilonRa... | [
{
"class_path": "kcchoate__advent-of-kotlin__3e7c24b/day03/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class day03.Solution {\n public day03.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4:... |
kcchoate__advent-of-kotlin__3e7c24b/src/main/kotlin/day02/Solution.kt | package day02
class Solution {
fun navigate(input: List<String>) =
input.map { it.split(' ') }
.map { Instruction(it[0], it[1].toInt()) }
.fold(Result(0, 0)) { acc, instruction ->
when (instruction.direction) {
"up" -> Result(acc.horizontal, acc.d... | [
{
"class_path": "kcchoate__advent-of-kotlin__3e7c24b/day02/Solution$Result2.class",
"javap": "Compiled from \"Solution.kt\"\nfinal class day02.Solution$Result2 {\n private final int horizontal;\n\n private final int depth;\n\n private final int aim;\n\n public day02.Solution$Result2(int, int, int);\n ... |
snikiforov4__numeric-matrix-processor__ace36ad/src/main/kotlin/Matrix.kt | package processor
import kotlin.math.pow
class Matrix(private val matrix: Array<Array<Double>>) {
companion object {
fun empty(n: Int, m: Int = n): Matrix {
require(n > 0)
require(m > 0)
return Matrix(Array(n) { Array(m) { 0.0 } })
}
}
val sizesOfDimen... | [
{
"class_path": "snikiforov4__numeric-matrix-processor__ace36ad/processor/Matrix$Companion.class",
"javap": "Compiled from \"Matrix.kt\"\npublic final class processor.Matrix$Companion {\n private processor.Matrix$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Met... |
snikiforov4__numeric-matrix-processor__ace36ad/src/main/kotlin/Main.kt | package processor
import java.text.DecimalFormat
private val regexp = "\\s+".toRegex()
var decimalFormat = DecimalFormat("#0.##")
fun main() {
while (true) {
printMenu()
print("Your choice: ")
when (readln().toInt()) {
0 -> break
1 -> {
val m1 = re... | [
{
"class_path": "snikiforov4__numeric-matrix-processor__ace36ad/processor/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class processor.MainKt {\n private static final kotlin.text.Regex regexp;\n\n private static java.text.DecimalFormat decimalFormat;\n\n public static final java.text.... |
emirhanaydin__ahp-android__7a58319/AnalyticHierarchyProcess/app/src/main/java/com/emirhanaydin/analytichierarchyprocess/math.kt | package com.emirhanaydin.analytichierarchyprocess
fun getRandomIndex(n: Int): Float {
return when (n) {
1, 2 -> 0f
3 -> 0.58f
4 -> 0.90f
5 -> 1.12f
6 -> 1.24f
7 -> 1.32f
8 -> 1.41f
9 -> 1.45f
10 -> 1.49f
11 -> 1.51f
12 -> 1.48f... | [
{
"class_path": "emirhanaydin__ahp-android__7a58319/com/emirhanaydin/analytichierarchyprocess/MathKt.class",
"javap": "Compiled from \"math.kt\"\npublic final class com.emirhanaydin.analytichierarchyprocess.MathKt {\n public static final float getRandomIndex(int);\n Code:\n 0: iload_0\n 1: t... |
mr-nothing__leetcode__0f7418e/src/main/kotlin/solved/p289/InPlaceSolution.kt | package solved.p289
/** The idea is that we will store in original array:
* -1 for dead-alive transition
* 0 for dead-dead transition
* 1 for alive-alive transition
* 2 for alive-dead transition
*/
class InPlaceSolution {
class Solution {
fun gameOfLife(board: Array<IntArray>) {
... | [
{
"class_path": "mr-nothing__leetcode__0f7418e/solved/p289/InPlaceSolution.class",
"javap": "Compiled from \"InPlaceSolution.kt\"\npublic final class solved.p289.InPlaceSolution {\n public solved.p289.InPlaceSolution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method ja... |
mr-nothing__leetcode__0f7418e/src/main/kotlin/solved/p672/Solution.kt | package solved.p672
class Solution {
class BruteForceSolution {
// This was the first idea: generate all possible combinations of button presses
// and simulate it on given bulbs. Clearly it does't fit any time limits :D
fun flipLights(n: Int, presses: Int): Int {
val states = H... | [
{
"class_path": "mr-nothing__leetcode__0f7418e/solved/p672/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class solved.p672.Solution {\n public solved.p672.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()... |
mr-nothing__leetcode__0f7418e/src/main/kotlin/solved/p1418/Solution.kt | package solved.p1418
class Solution {
fun displayTable(orders: List<List<String>>): List<List<String>> {
// A tree set of all tables sorted by natural order
val tables = sortedSetOf<Int>()
// A tree set of all dishes sorted by natural order
val dishes = sortedSetOf<String>()
... | [
{
"class_path": "mr-nothing__leetcode__0f7418e/solved/p1418/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class solved.p1418.Solution {\n public solved.p1418.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\"... |
mr-nothing__leetcode__0f7418e/src/main/kotlin/solved/p1679/Solution.kt | package solved.p1679
class Solution {
class SortingApproach {
fun maxOperations(nums: IntArray, k: Int): Int {
val sorted = nums.sorted()
var operations = 0
var head = 0
var tail = nums.lastIndex
while (head < tail) {
while (tail... | [
{
"class_path": "mr-nothing__leetcode__0f7418e/solved/p1679/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class solved.p1679.Solution {\n public solved.p1679.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\"... |
mr-nothing__leetcode__0f7418e/src/main/kotlin/solved/p581/Solution.kt | package solved.p581
class Solution {
class SortingApproach {
// The idea is to sort initial array and compare both arrays from the start and from the end.
// The index of first element from the:
// - start that is not equal is the lower bound of the subsequence
// - end that if not ... | [
{
"class_path": "mr-nothing__leetcode__0f7418e/solved/p581/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class solved.p581.Solution {\n public solved.p581.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()... |
mattianeroni__aoc__cbbe6f8/src/main/kotlin/day3.kt | package day3
import java.io.File
import java.util.PriorityQueue
val nums = Array<String>(10){ it.toString() }.toSet()
fun exercise1 ()
{
val filename = "./inputs/day3ex1.txt"
var total: Int = 0
val allLines = File(filename).readLines().toList()
for ((row, line) in allLines.withIndex())
{
... | [
{
"class_path": "mattianeroni__aoc__cbbe6f8/day3/Day3Kt.class",
"javap": "Compiled from \"day3.kt\"\npublic final class day3.Day3Kt {\n private static final java.util.Set<java.lang.String> nums;\n\n public static final java.util.Set<java.lang.String> getNums();\n Code:\n 0: getstatic #12 ... |
sdkei__KotlinJvmUtils__db6280c/src/main/kotlin/io/github/sdkei/kotlin_jvm_utils/PermutationAndCombination.kt | package io.github.sdkei.kotlin_jvm_utils
/**
* Returns permutation of elements of the receiver.
*
* ```
* listOf("A", "B", "C").permutation(2) // -> [[A, B], [A, C], [B, A], [B, C], [C, A], [C, B]]
* ```
*
* @param count number of elements of permutation.
*/
fun <T> Iterable<T>.permutation(count: Int): List<Li... | [
{
"class_path": "sdkei__KotlinJvmUtils__db6280c/io/github/sdkei/kotlin_jvm_utils/PermutationAndCombinationKt.class",
"javap": "Compiled from \"PermutationAndCombination.kt\"\npublic final class io.github.sdkei.kotlin_jvm_utils.PermutationAndCombinationKt {\n public static final <T> java.util.List<java.util... |
lilimapradhan9__kotlin-problems__356cef0/src/main/kotlin/dayFolders/day5/letterCombinationsOfPhone.kt | package dayFolders.day5
val digitToLetterMap = mapOf(
2 to listOf('a', 'b', 'c'),
3 to listOf('d', 'e', 'f'),
4 to listOf('g', 'h', 'i'),
5 to listOf('j', 'k', 'l'),
6 to listOf('m', 'n', 'o'),
7 to listOf('p', 'q', 'r', 's'),
8 to listOf('t', 'u', 'v'),
9 to listOf('w', 'x', 'y', 'z')
... | [
{
"class_path": "lilimapradhan9__kotlin-problems__356cef0/dayFolders/day5/LetterCombinationsOfPhoneKt.class",
"javap": "Compiled from \"letterCombinationsOfPhone.kt\"\npublic final class dayFolders.day5.LetterCombinationsOfPhoneKt {\n private static final java.util.Map<java.lang.Integer, java.util.List<jav... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.