programming-challenges | My solutions to various programming challenges

programming-challenges is a C++ library. programming-challenges has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Version 2 was a failed attempt. Runtime: 252 ms, faster than 89.36% of Kotlin online submissions for Add Two Numbers. Runtime: 384 ms, faster than 27.11% of Kotlin online submissions for Longest Substring Without Repeating Characters... :(. The problem requested O(log(m+n)) but this solution is O(m+n). Runtime: 4 ms, faster than 99.26%. Hash table with linked elements, organized through pointer manipulation. Inspired by compton_scatter solution. | Challenge | Solution | Difficulty | |-----------|----------|------------| | ASCII Art | AsciiArt.java | Easy | | Chuck Norris | chuck_norris.c | Easy | | Mars Lander - Episode 1 | mars_lander_episode_1.c | Easy | | Onboarding | onboarding.py | Easy | | Power of Thor - Episode 1 | power_of_thor_episode_1.c | Easy | | Temperatures | temperatures.c | Easy | | The Bridge - Episode 1 | the_bridge_episode_1.c | Easy | | There is no Spoon - Episode 1 | ThereIsNoSpoonEpisode1.java | Medium |. | Challenge | Solution | Difficulty | |-----------|----------|------------| | Maze To Graph | MazeToGraph.java | Medium | | Escaping a dangerous maze | MazeRunner.java | Hard |. | Challenge | Solution | Difficulty | |-----------|----------|------------| | Alphabet Cake | alphabet_cake.py | Round 1A 2017 |. | Challenge | Solution | Difficulty | |-----------|----------|------------| | Linked Lists: Detect a Cycle | detect_a_cycle.py | Easy | | Hash Tables: Ransom Note | ransom_note.py | Easy | | Arrays: Left Rotation | left_rotation.c | Easy | | Strings: Making Anagrams | MakingAnagrams.java | Easy | | ~~Recursion:~~ DP: Fibonacci Numbers | fibonacci.py | Easy | | Bit Manipulation: Lonely Integer | lonely_integer.py | Easy | | Stacks: Balanced Brackets | balanced_brackets.c | Medium | | Trees: Is This a Binary Search Tree? | BST.java | Medium | | Queues: A Tale of Two Stacks | two_stacks.c | Medium | | Sorting: Bubble Sort | bubble_sort.c | Medium | | Sorting: Comparator | Checker.java | Medium | | Time Complexity: Primality | primality.py | Medium | | ~~Recursion:~~ DP: Davis' Staircase | davis_staircase.py | Medium | | ~~Binary Search:~~ Ice Cream Parlor | ice_cream.py | Medium | | Tries: Contacts | Contacts.java | Hard | | DFS: Connected Cell in a Grid | connected_cell.c | Hard | | Merge Sort: Counting Inversions | counting_inversions.c | Hard | | Heaps: Find the Running Median | running_median.c | Hard | | DP: Coin Change | coin_change.py | Hard | | BFS: Shortest Reach in a Graph | shortest_reach.py | Hard |. | Challenge | Part 1 | Part2 | |-----------|--------|-------| | Day 1: Not Quite Lisp | day_1_a.cpp | day_1_b.cpp | | Day 2: I Was Told There Would Be No Math | day_2_a.cpp | day_2_b.cpp | | Day 3: Perfectly Spherical Houses in a Vacuum | day_3_a.cpp | day_3_b.cpp | | Day 4: The Ideal Stocking Stuffer | day_4_a.cpp | day_4_b.cpp | | Day 5: Doesn't He Have Intern-Elves For This? | day_5_a.cpp | day_5_b.cpp | | Day 6: Probably a Fire Hazard | day_6_a.cpp | day_6_b.cpp | | Day 7: Some Assembly Required | day_7_a.cpp | day_7_b.cpp |. | Challenge | Part 1 | Part2 | |-----------|--------|-------| | Day 1: Chronal Calibration | day_1_a.kt | day_1_b.kt | | Day 2: Inventory Management System | day_2_a.kt | day_2_b.kt | | Day 3: No Matter How You Slice It | day_3_a.kt | day_3_b.kt | | Day 4: Repose Record | day_4_a.kt | day_4_b.kt | | Day 5: Alchemical Reduction | day_5_a.kt | day_5_b.kt | | Day 6: Chronal Coordinates | day_6_a.kt | day_6_b.kt | | Day 7: The Sum of Its Parts | day_7_a.kt | day_7_b.kt | | Day 8: Memory Maneuver | day_8_a.kt | day_8_b.kt | | Day 9: Marble Mania | day_9_a.kt | day_9_b.kt | | Day 10: The Stars Align | day_10_a.kt | day_10_b.kt | | Day 11: Chronal Charge | day_11_a.kt | day_11_b.kt | | Day 12: Subterranean Sustainability | day_12_a.kt | day_12_b.kt |.