Programming Puzzle Solutions

Competitive programming is a focused way to sharpen algorithmic thinking. These are worked solutions — not shortcuts, but walkthroughs of the ideas, trade-offs, and optimizations that lead to efficient answers.

Codesignal Solution: onesPosition

Codesignal Solution: onesPosition

Project Euler

  1. Project Euler Solution #1: Multiples of 3 and 5
  2. Project Euler Solution #2: Even Fibonacci numbers
  3. Project Euler Solution #3: Largest prime factor
  4. Project Euler Solution #4: Largest palindrome product
  5. Project Euler Solution #5: Smallest multiple
  6. Project Euler Solution #6: Sum square difference
  7. Project Euler Solution #7: 10001st prime
  8. Project Euler Solution #8: Largest product in a series
  9. Project Euler Solution #9: Special Pythagorean triplet
  10. Project Euler Solution #10: Summation of primes
  11. Project Euler Solution #11: Largest product in a grid
  12. Project Euler Solution #12: Highly divisible triangular number
  13. Project Euler Solution #13: Large sum
  14. Project Euler Solution #14: Longest Collatz sequence
  15. Project Euler Solution #15: Lattice paths
  16. Project Euler Solution #16: Power digit sum
  17. Project Euler Solution #17: Number letter counts
  18. Project Euler Solution #18: Maximum path sum I
  19. Project Euler Solution #19: Counting Sundays
  20. Project Euler Solution #20: Factorial digit sum
  21. Project Euler Solution #21: Amicable numbers
  22. Project Euler Solution #22: Names scores
  23. Project Euler Solution #23: Non-abundant sums
  24. Project Euler Solution #24: Lexicographic permutations
  25. Project Euler Solution #25: 1000-digit Fibonacci number
  26. Project Euler Solution #26: Reciprocal cycles
  27. Project Euler Solution #27: Quadratic primes
  28. Project Euler Solution #28: Number spiral diagonals
  29. Project Euler Solution #29: Distinct powers
  30. Project Euler Solution #30: Digit fifth powers
  31. Project Euler Solution #31: Coin sums
  32. Project Euler Solution #32: Pandigital products
  33. Project Euler Solution #33: Digit cancelling fractions
  34. Project Euler Solution #34: Digit factorials
  35. Project Euler Solution #35: Circular primes
  36. Project Euler Solution #36: Double-base palindromes
  37. Project Euler Solution #37: Truncatable primes
  38. Project Euler Solution #38: Pandigital multiples
  39. Project Euler Solution #39: Integer right triangles
  40. Project Euler Solution #40: Champernowne's constant
  41. Project Euler Solution #41: Pandigital prime
  42. Project Euler Solution #42: Coded triangle numbers
  43. Project Euler Solution #43: Sub-string divisibility
  44. Project Euler Solution #44: Pentagon numbers
  45. Project Euler Solution #45: Triangular, pentagonal, and hexagonal
  46. Project Euler Solution #46: Goldbach's other conjecture
  47. Project Euler Solution #47: Distinct primes factors
  48. Project Euler Solution #48: Self powers
  49. Project Euler Solution #49: Prime permutations
  50. Project Euler Solution #50: Consecutive prime sum
  51. Project Euler Solution #52: Permuted multiples
  52. Project Euler Solution #55: Lychrel numbers
  53. Project Euler Solution #56: Powerful digit sum
  54. Project Euler Solution #57: Square root convergents
  55. Project Euler Solution #58: Spiral primes
  56. Project Euler Solution #59: XOR decryption
  57. Project Euler Solution #62: Cubic permutations
  58. Project Euler Solution #63: Powerful digit counts
  59. Project Euler Solution #64: Odd period square roots
  60. Project Euler Solution #67: Maximum path sum II
  61. Project Euler Solution #69: Totient maximum
  62. Project Euler Solution #71: Ordered fractions
  63. Project Euler Solution #72: Counting fractions
  64. Project Euler Solution #81: Path sum: two ways
  65. Project Euler Solution #92: Square digit chains
  66. Project Euler Solution #107: Minimal network

CodinGame