{"id":24659987,"url":"https://github.com/it-enduro/code-tasks","last_synced_at":"2025-03-21T06:23:25.760Z","repository":{"id":216385276,"uuid":"739858550","full_name":"IT-Enduro/code-tasks","owner":"IT-Enduro","description":"Leetcode tasks in Kotlin","archived":false,"fork":false,"pushed_at":"2024-07-22T19:12:16.000Z","size":178,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-26T03:15:53.530Z","etag":null,"topics":["kotlin","leetcode-solutions","tests"],"latest_commit_sha":null,"homepage":"https://leetcode.com","language":"Kotlin","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/IT-Enduro.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-06T18:57:54.000Z","updated_at":"2024-07-22T19:12:19.000Z","dependencies_parsed_at":"2024-02-01T12:29:12.247Z","dependency_job_id":"19b90eff-47e0-4f83-92ca-c8f79ab818fa","html_url":"https://github.com/IT-Enduro/code-tasks","commit_stats":null,"previous_names":["it-enduro/code-tasks"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IT-Enduro%2Fcode-tasks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IT-Enduro%2Fcode-tasks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IT-Enduro%2Fcode-tasks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IT-Enduro%2Fcode-tasks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/IT-Enduro","download_url":"https://codeload.github.com/IT-Enduro/code-tasks/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244747027,"owners_count":20503305,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["kotlin","leetcode-solutions","tests"],"created_at":"2025-01-26T03:15:58.480Z","updated_at":"2025-03-21T06:23:25.739Z","avatar_url":"https://github.com/IT-Enduro.png","language":"Kotlin","readme":"# Code Tasks\n\n[![Build project](https://github.com/IT-Enduro/code-tasks/actions/workflows/build.yml/badge.svg?branch=master)](https://github.com/IT-Enduro/code-tasks/actions/workflows/build.yml)\n[![pre-commit](https://img.shields.io/badge/pre--commit-enabled-brightgreen?logo=pre-commit)](https://github.com/pre-commit/pre-commit)\n\n## Easy level\n\n1. [First bad version](https://leetcode.com/problems/first-bad-version/) – [solution](src/main/kotlin/ru/romanow/FirstBadVersion.kt), [test](src/test/kotlin/ru/romanow/FirstBadVersionTest.kt)\n2. [Merge sorted array](https://leetcode.com/problems/merge-sorted-array/) – [solution](src/main/kotlin/ru/romanow/MergeSortedArrays.kt), [test](src/test/kotlin/ru/romanow/MergeSortedArraysTest.kt), разбор на [YouTube](https://youtube.com/watch?v=qEHYFV0f6FQ)\n3. [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) – [solution](src/main/kotlin/ru/romanow/FirstOccurrenceInAString.kt), [test](src/test/kotlin/ru/romanow/FirstOccurrenceInAStringTest.kt), **TODO**\n4. [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) – [solution](src/main/kotlin/ru/romanow/LongestCommonPrefix.kt), [test](src/test/kotlin/ru/romanow/LongestCommonPrefixTest.kt)\n5. [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) – [solution](src/main/kotlin/ru/romanow/ValidPalindrome.kt), [test](src/test/kotlin/ru/romanow/ValidPalindromeTest.kt), **TODO**\n6. [Two Sum](https://leetcode.com/problems/two-sum/) – [solution](src/main/kotlin/ru/romanow/TwoSum.kt), [test](src/test/kotlin/ru/romanow/TwoSumTest.kt)\n7. [Plus One](https://leetcode.com/problems/plus-one/) – [solution](src/main/kotlin/ru/romanow/PlusOne.kt), [test](src/test/kotlin/ru/romanow/PlusOneTest.kt), разбор на [YouTube](https://www.youtube.com/watch?v=tKVFK1kVzyI)\n8. [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) – [solution](src/main/kotlin/ru/romanow/RomanToInteger.kt), [test](src/test/kotlin/ru/romanow/RomanToIntegerTest.kt)\n9. [Remove Element](https://leetcode.com/problems/remove-element/) – [solution](src/main/kotlin/ru/romanow/RemoveElement.kt), [test](src/test/kotlin/ru/romanow/RemoveElementTest.kt), **TODO**\n10. [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) – [solution](src/main/kotlin/ru/romanow/MiddleOfTheLinkedList.kt), [test](src/test/kotlin/ru/romanow/MiddleOfTheLinkedListTest.kt), **TODO**\n11. [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) – [solution](src/main/kotlin/ru/romanow/HammingWeight.kt), [test](src/test/kotlin/ru/romanow/HammingWeightTest.kt)\n12. [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) – [solution](src/main/kotlin/ru/romanow/LinkedListCycle.kt), [test](src/test/kotlin/ru/romanow/LinkedListCycleTest.kt), **TODO**\n13. [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) – [solution](src/main/kotlin/ru/romanow/ValidParentheses.kt), [test](src/test/kotlin/ru/romanow/ValidParenthesesTest.kt), **TODO**\n14. [Missing Number](https://leetcode.com/problems/missing-number/) – [solution](src/main/kotlin/ru/romanow/MissingNumber.kt), [test](src/test/kotlin/ru/romanow/MissingNumberTest.kt)\n15. [Power of Three](https://leetcode.com/problems/power-of-three/) – [solution](src/main/kotlin/ru/romanow/PowerOfThree.kt), [test](src/test/kotlin/ru/romanow/PowerOfThreeTest.kt)\n16. [Majority Element](https://leetcode.com/problems/majority-element/) – [solution](src/main/kotlin/ru/romanow/MajorityElement.kt), [test](src/test/kotlin/ru/romanow/MajorityElementTest.kt)\n17. [Valid Anagram](https://leetcode.com/problems/valid-anagram/) – [solution](src/main/kotlin/ru/romanow/ValidAnagram.kt), [test](src/test/kotlin/ru/romanow/ValidAnagramTest.kt)\n18. [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) – [solution](src/main/kotlin/ru/romanow/IntersectionOfTwoArrays.kt), [test](src/test/kotlin/ru/romanow/IntersectionOfTwoArraysTest.kt)\n19. [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) – [solution](src/main/kotlin/ru/romanow/RemoveDuplicatesFromSortedArray.kt), [test](src/test/kotlin/ru/romanow/RemoveDuplicatesFromSortedArrayTest.kt)\n\n## Medium level\n\n1. [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) – [solution](src/main/kotlin/ru/romanow/ProductOfArrayExceptSelf.kt), [test](src/test/kotlin/ru/romanow/ProductOfArrayExceptSelfTest.kt)\n2. [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) – [solution](src/main/kotlin/ru/romanow/IntegerToRoman.kt), [test](src/test/kotlin/ru/romanow/IntegerToRomanTest.kt)\n3. [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) – [solution](src/main/kotlin/ru/romanow/SearchIn2dMatrix.kt), [test](src/test/kotlin/ru/romanow/SearchIn2dMatrixTest.kt), **TODO**\n4. [Summary Ranges](https://leetcode.com/problems/summary-ranges/) – [solution](src/main/kotlin/ru/romanow/SummaryRanges.kt), [test](src/test/kotlin/ru/romanow/SummaryRangesTest.kt)\n5. [Merge Intervals](https://leetcode.com/problems/merge-intervals/) – [solution](src/main/kotlin/ru/romanow/MergeIntervals.kt), [test](src/test/kotlin/ru/romanow/MergeIntervalsTest.kt)\n6. [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) – [solution](src/main/kotlin/ru/romanow/ValidSudoku.kt), [test](src/test/kotlin/ru/romanow/ValidSudokuTest.kt), **TODO**\n7. [LRU Cache](https://leetcode.com/problems/lru-cache/) – [solution](src/main/kotlin/ru/romanow/LRUCache.kt), [test](src/test/kotlin/ru/romanow/LRUCacheTest.kt), **TODO**\n8. [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) – [solution](src/main/kotlin/ru/romanow/MaximumSubarray.kt), [test](src/test/kotlin/ru/romanow/MaximumSubarrayTest.kt), **TODO**\n9. [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) – [solution](src/main/kotlin/ru/romanow/ReverseWordsInAString.kt), [test](src/test/kotlin/ru/romanow/ReverseWordsInAStringTest.kt), **TODO**\n10. [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) – [solution](src/main/kotlin/ru/romanow/FlattenBinaryTreeToLinkedList.kt), [test](src/test/kotlin/ru/romanow/FlattenBinaryTreeToLinkedListTest.kt), **TODO**\n11. [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) – [solution](src/main/kotlin/ru/romanow/EvaluateReversePolishNotation.kt), [test](src/test/kotlin/ru/romanow/EvaluateReversePolishNotationTest.kt), **TODO**\n12. [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) – [solution](src/main/kotlin/ru/romanow/LongestConsecutiveSequence.kt), [test](src/test/kotlin/ru/romanow/LongestConsecutiveSequenceTest.kt), **TODO**\n13. [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) – [solution](src/main/kotlin/ru/romanow/BasicCalculator.kt), [test](src/test/kotlin/ru/romanow/BasicCalculatorTest.kt), **TODO**\n14. [Basic Calculator II](https://leetcode.com/problems/implement-trie-prefix-tree/) – [solution](src/main/kotlin/ru/romanow/PrefixTree.kt), [test](src/test/kotlin/ru/romanow/PrefixTreeTest.kt)\n15. [Game of Life](https://leetcode.com/problems/game-of-life/) – [solution](src/main/kotlin/ru/romanow/GameOfLife.kt), [test](src/test/kotlin/ru/romanow/GameOfLifeTest.kt)\n16. [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) – [solution](src/main/kotlin/ru/romanow/DeleteNodeInALinkedList.kt), [test](src/test/kotlin/ru/romanow/DeleteNodeInALinkedListTest.kt)\n17. [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) – [solution](src/main/kotlin/ru/romanow/LongestCommonSubsequence.kt), [test](src/test/kotlin/ru/romanow/LongestCommonSubsequenceTest.kt)\n18. [Delete Node in a Binary Search Tree](https://leetcode.com/problems/delete-node-in-a-bst/) – [solution](src/main/kotlin/ru/romanow/DeleteNodeInABalancedSearchTree.kt), [test](src/test/kotlin/ru/romanow/DeleteNodeInABalancedSearchTreeTest.kt)\n19. [Decode String](https://leetcode.com/problems/decode-string/) – [solution](src/main/kotlin/ru/romanow/DecodeString.kt), [test](src/test/kotlin/ru/romanow/DecodeStringTest.kt)\n20. [Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) – [solution](src/main/kotlin/ru/romanow/DetermineIfTwoStringsAreClose.kt), [test](src/test/kotlin/ru/romanow/DetermineIfTwoStringsAreCloseTest.kt)\n21. [Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/) – [solution](src/main/kotlin/ru/romanow/RemovingStarsFromAString.kt), [test](src/test/kotlin/ru/romanow/RemovingStarsFromAStringTest.kt)\n\n## Hard level\n\n1. [Basic Calculator](https://leetcode.com/problems/basic-calculator/) – [solution](src/main/kotlin/ru/romanow/BasicCalculatorWithBrackets.kt), [test](src/test/kotlin/ru/romanow/BasicCalculatorWithBracketsTest.kt)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fit-enduro%2Fcode-tasks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fit-enduro%2Fcode-tasks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fit-enduro%2Fcode-tasks/lists"}