programming-challenges

KO | EN

gitlite — search

#react #llm #golang #android #machine-learning #rust #docker #java #nodejs #windows #awesome #vue #awesome-list #open-source

programming-challenges

(★ 9)

My solutions to various programming challenges.

programming-challenges Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Programming Challenges

## [LeetCode](https://leetcode.com/)

| Challenge | Solution | Difficulty | Observations |
|-----------|----------|------------|--------------|
| [1. Two Sum](https://leetcode.com/problems/two-sum) | [two_sum.py](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/two_sum.py) | Easy | |
| [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [AddTwoNumbers.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/AddTwoNumbers.kt) [AddTwoNumbers2.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/AddTwoNumbers2.kt)  | Medium | Version 2 was a failed attempt. Runtime: 252 ms, faster than 89.36% of Kotlin online submissions for Add Two Numbers. |
| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [LongestSubstringWithoutRepeatingCharacters.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/LongestSubstringWithoutRepeatingCharacters.kt) | Medium | Runtime: 384 ms, faster than 27.11% of Kotlin online submissions for Longest Substring Without Repeating Characters... :( |
| [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [median_of_two_sorted_arrays.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/median_of_two_sorted_arrays.c) | Hard | The problem requested O(log(m+n)) but this solution is O(m+n) |
| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [LongestPalindromicSubstring.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/LongestPalindromicSubstring.kt) [LongestPalindromicSubstring.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/LongestPalindromicSubstring.java) | Medium |  |
| [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [ReverseInteger.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/ReverseInteger.kt) | Easy |  |
| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [ContainerWithMostWater.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/ContainerWithMostWater.java) | Medium | Runtime: 4 ms, faster than 99.26% |
| [15. 3Sum](https://leetcode.com/problems/3sum/) | [3Sum.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/3Sum.kt) | Medium | |
| [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [GenerateParentesis.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/GenerateParentesis.kt) | Medium | |
| [46. Permutations](https://leetcode.com/problems/permutations) | [permutations.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/permutations.c) | Medium |  |
| [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [GroupAnagrams.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/GroupAnagrams.java) | Medium |  |
| [65. Valid Number](https://leetcode.com/problems/valid-number) | [ValidNumber.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/ValidNumber.java) | Hard | |
| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [SetMatrixZeroes.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/SetMatrixZeroes.java) | Medium | |
| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [MaximumDepthOfBinaryTree.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/MaximumDepthOfBinaryTree.cpp) | Easy | |
| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [max_path_sum.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/max_path_sum.c) | Hard | [Solution](https://discuss.leetcode.com/topic/7325/a-very-concise-recursive-solution) by [shichaotan](https://discuss.leetcode.com/user/shichaotan) |
| [136. Single Number](https://leetcode.com/problems/single-number/) | [single_number.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/single_number.cpp) | Easy |  |
| [146. LRU Cache](https://leetcode.com/problems/lru-cache) | [lru_cache.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/lru_cache.c) | Hard | Hash table with linked elements, organized through pointer manipulation |
| [155. Min Stack](https://leetcode.com/problems/min-stack) | [min_stack.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/min_stack.c) | Easy | |
| [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [IntersectionOfTwoLinkedLists.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/IntersectionOfTwoLinkedLists.java) | Easy | |
| [297. Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | [SerializeAndDeserializeBinaryTree.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/SerializeAndDeserializeBinaryTree.java) | Hard | |
| [328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [OddEvenLinkedList.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/OddEvenLinkedList.kt) | Medium | |
| [338. Counting Bits](https://leetcode.com/problems/counting-bits/) | [counting_bits.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/counting_bits.cpp) | Medium |  |
| [380. Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [InsertDeleteGetRandomO1.java](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/InsertDeleteGetRandomO1.java) | Medium |  |
| [406. Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) |  | Medium | [Solution](https://leetcode.com/problems/queue-reconstruction-by-height/discuss/89407/Python-Documented-solution-in-O(n*n)-time-that-is-easy-to-understand) |
| [461. Hamming Distance](https://leetcode.com/problems/hamming-distance) | [hamming_distance.py](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/hamming_distance.py) | Easy | |
| [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [shortest_unsorted_continuos_subarray.c](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/shortest_unsorted_continuos_subarray.c) | Easy | Inspired by [compton_scatter](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/discuss/103057/Java-O(n)-Time-O(1)-Space) solution |
| [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | [MergeTwoBinaryTrees.kt](https://github.com/migafgarcia/programming-challenges/blob/master/leetcode/MergeTwoBinaryTrees.kt) | Easy | |

## [CodinGame](https://www.codingame.com/)

| Challenge | Solution | Difficulty | 
|-----------|----------|------------|
| [ASCII Art](https://www.codingame.com/training/easy/ascii-art) | [AsciiArt.java](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/AsciiArt.java) | Easy | 
| [Chuck Norris](https://www.codingame.com/training/easy/chuck-norris) | [chuck_norris.c](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/chuck_norris.c) | Easy | 
| [Mars Lander - Episode 1](https://www.codingame.com/training/easy/mars-lander-episode-1) | [mars_lander_episode_1.c](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/mars_lander_episode_1.c) | Easy | 
| [Onboarding](https://www.codingame.com/training/easy/onboarding) | [onboarding.py](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/onboarding.py) | Easy | 
| [Power of Thor - Episode 1](https://www.codingame.com/training/easy/power-of-thor-episode-1) | [power_of_thor_episode_1.c](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/power_of_thor_episode_1.c) | Easy | 
| [Temperatures](https://www.codingame.com/training/easy/temperatures) | [temperatures.c](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/temperatures.c) | Easy | 
| The Bridge - Episode 1 | [the_bridge_episode_1.c](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/easy/the_bridge_episode_1.c) | Easy | 
| [There is no Spoon - Episode 1](https://www.codingame.com/training/medium/there-is-no-spoon-episode-1) | [ThereIsNoSpoonEpisode1.java](https://github.com/migafgarcia/programming-challenges/blob/master/codingame/medium/ThereIsNoSpoonEpisode1.java) | Medium |

## [/r/dailyprogrammer/](https://www.reddit.com/r/dailyprogrammer/)

| Challenge | Solution | Difficulty | 
|-----------|----------|------------|
| [Maze To Graph](https://www.reddit.com/r/dailyprogrammer/comments/5nciz5/20170111_challenge_299_intermediate_from_maze_to/) | [MazeToGraph.java](https://github.com/migafgarcia/programming-challenges/blob/master/r_dailyprogrammer/medium/MazeToGraph.java) | Medium | 
| [Escaping a dangerous maze](https://www.reddit.com/r/dailyprogrammer/comments/5vwwzg/20170224_challenge_303_hard_escaping_a_dangerous/) | [MazeRunner.java](https://github.com/migafgarcia/programming-challenges/blob/master/r_dailyprogrammer/hard/MazeRunner.java) | Hard |

## [Google Code Jam](https://code.google.com/codejam/)

| Challenge | Solution | Difficulty | 
|-----------|----------|------------|
| [Alphabet Cake](https://code.google.com/codejam/contest/5304486/dashboard) | [alphabet_cake.py](https://github.com/migafgarcia/programming-challenges/blob/master/google_code_jam/round_1a_2017/alphabet_cake/alphabet_cake.py) | Round 1A 2017 |

## [HackerRank](https://www.hackerrank.com/)

### [Cracking the Coding Interview](https://www.hackerrank.com/domains/tutorials/cracking-the-coding-interview)

| Challenge | Solution | Difficulty | 
|-----------|----------|------------|
| [Linked Lists: Detect a Cycle](https://www.hackerrank.com/challenges/ctci-linked-list-cycle) | [detect_a_cycle.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/detect_a_cycle.py) | Easy | 
| [Hash Tables: Ransom Note](https://www.hackerrank.com/challenges/ctci-ransom-note) | [ransom_note.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/ransom_note.py) | Easy | 
| [Arrays: Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation) | [left_rotation.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/left_rotation.c) | Easy | 
| [Strings: Making Anagrams](https://www.hackerrank.com/challenges/ctci-making-anagrams) | [MakingAnagrams.java](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/MakingAnagrams.java) | Easy | 
| [~~Recursion:~~ DP: Fibonacci Numbers](https://www.hackerrank.com/challenges/ctci-fibonacci-numbers) | [fibonacci.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/fibonacci.py) | Easy | 
| [Bit Manipulation: Lonely Integer](https://www.hackerrank.com/challenges/ctci-lonely-integer) | [lonely_integer.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/lonely_integer.py) | Easy | 
| [Stacks: Balanced Brackets](https://www.hackerrank.com/challenges/ctci-balanced-brackets) | [balanced_brackets.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/balanced_brackets.c) | Medium | 
| [Trees: Is This a Binary Search Tree?](https://www.hackerrank.com/challenges/ctci-is-binary-search-tree) | [BST.java](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/BST.java) | Medium | 
| [Queues: A Tale of Two Stacks](https://www.hackerrank.com/challenges/ctci-queue-using-two-stacks) | [two_stacks.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/two_stacks.c) | Medium | 
| [Sorting: Bubble Sort](https://www.hackerrank.com/challenges/ctci-bubble-sort) | [bubble_sort.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/bubble_sort.c) | Medium | 
| [Sorting: Comparator](https://www.hackerrank.com/challenges/ctci-comparator-sorting/) | [Checker.java](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/Checker.java) | Medium | 
| [Time Complexity: Primality](https://www.hackerrank.com/challenges/ctci-big-o) | [primality.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/primality.py) | Medium | 
| [~~Recursion:~~ DP: Davis' Staircase](https://www.hackerrank.com/challenges/ctci-recursive-staircase) | [davis_staircase.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/davis_staircase.py) | Medium | 
| [~~Binary Search:~~ Ice Cream Parlor](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor) | [ice_cream.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/ice_cream.py) | Medium | 
| [Tries: Contacts](https://www.hackerrank.com/challenges/ctci-contacts) | [Contacts.java](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/Contacts.java) | Hard | 
| [DFS: Connected Cell in a Grid](https://www.hackerrank.com/challenges/ctci-connected-cell-in-a-grid) | [connected_cell.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/connected_cell.c) | Hard | 
| [Merge Sort: Counting Inversions](https://www.hackerrank.com/challenges/ctci-merge-sort) | [counting_inversions.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/counting_inversions.c) | Hard | 
| [Heaps: Find the Running Median](https://www.hackerrank.com/challenges/ctci-find-the-running-median) | [running_median.c](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/running_median.c) | Hard | 
| [DP: Coin Change](https://www.hackerrank.com/challenges/ctci-coin-change) | [coin_change.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/coin_change.py) | Hard | 
| [BFS: Shortest Reach in a Graph](https://www.hackerrank.com/challenges/ctci-bfs-shortest-reach) | [shortest_reach.py](https://github.com/migafgarcia/programming-challenges/blob/master/hackerrank/cracking_the_coding_interview/shortest_reach.py) | Hard |

## [Advent of Code 2015](http://adventofcode.com/2015)
| Challenge | Part 1 | Part2 | 
|-----------|--------|-------|
| [Day 1: Not Quite Lisp](http://adventofcode.com/2015/day/1) | [day_1_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_1_a.cpp) | [day_1_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_1_b.cpp) |
| [Day 2: I Was Told There Would Be No Math](http://adventofcode.com/2015/day/2) | [day_2_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_2_a.cpp) | [day_2_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_2_b.cpp) |
| [Day 3: Perfectly Spherical Houses in a Vacuum](http://adventofcode.com/2015/day/3) | [day_3_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_3_a.cpp) | [day_3_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_3_b.cpp) |
| [Day 4: The Ideal Stocking Stuffer](http://adventofcode.com/2015/day/4) | [day_4_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_4_a.cpp) | [day_4_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_4_b.cpp) |
| [Day 5: Doesn't He Have Intern-Elves For This?](http://adventofcode.com/2015/day/5) | [day_5_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_5_a.cpp) | [day_5_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_5_b.cpp) |
| [Day 6: Probably a Fire Hazard](http://adventofcode.com/2015/day/6) | [day_6_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_6_a.cpp) | [day_6_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_6_b.cpp) |
| [Day 7: Some Assembly Required](http://adventofcode.com/2015/day/6) | [day_7_a.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_7_a.cpp) | [day_7_b.cpp](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2015/day_7_b.cpp) |

## [Advent of Code 2018](http://adventofcode.com/2018)
| Challenge | Part 1 | Part2 | 
|-----------|--------|-------|
| [Day 1: Chronal Calibration](http://adventofcode.com/2018/day/1) | [day_1_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_1_a.kt) | [day_1_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_1_b.kt) |
| [Day 2: Inventory Management System](http://adventofcode.com/2018/day/2) | [day_2_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_2_a.kt) | [day_2_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_2_b.kt) |
| [Day 3: No Matter How You Slice It](http://adventofcode.com/2018/day/3) | [day_3_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_3_a.kt) | [day_3_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_3_b.kt) |
| [Day 4: Repose Record](http://adventofcode.com/2018/day/4) | [day_4_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_4_a.kt) | [day_4_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_4_b.kt) |
| [Day 5: Alchemical Reduction](http://adventofcode.com/2018/day/5) | [day_5_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_5_a.kt) | [day_5_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_5_b.kt) |
| [Day 6: Chronal Coordinates](http://adventofcode.com/2018/day/6) | [day_6_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_6_a.kt) | [day_6_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_6_b.kt) |
| [Day 7: The Sum of Its Parts](http://adventofcode.com/2018/day/7) | [day_7_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_7_a.kt) | [day_7_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_7_b.kt) |
| [Day 8: Memory Maneuver](http://adventofcode.com/2018/day/8) | [day_8_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_8_a.kt) | [day_8_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_8_b.kt) |
| [Day 9: Marble Mania](http://adventofcode.com/2018/day/9) | [day_9_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_9_a.kt) | [day_9_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_9_b.kt) |
| [Day 10: The Stars Align](http://adventofcode.com/2018/day/10) | [day_10_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_10_a.kt) | [day_10_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_10_b.kt) |
| [Day 11: Chronal Charge](http://adventofcode.com/2018/day/11) | [day_11_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_11_a.kt) | [day_11_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_11_b.kt) |
| [Day 12: Subterranean Sustainability](http://adventofcode.com/2018/day/12) | [day_12_a.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_12_a.kt) | [day_12_b.kt](https://github.com/migafgarcia/programming-challenges/blob/master/advent_of_code/2018/solutions/day_12_b.kt) |

programming-challenges

programming-challenges Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

programming-challenges

programming-challenges Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README