Haskell

AOC-2023-1 Trebuchet?! I have tried solving advent of code 2023 challenges in haskell, and this was my attempt to solve day 1. In this problem we have to find the first and last digits in a line and sum them. problem link: https://adventofcode.com/2023/day/1 Part 1 First part is very simple as it is just a parsing problem, and we can use my favourite library for parsing: parsec to solve it. Part 2 Second part have a variation that say the digits may be spelled out like one instead of 1. which seems to be easy to solve as we can just change our parsing logic to consider both 1 and one as 1. But when I treid to solve it using that approach, I was getting the wrong result. ...

Hello world, I am Upendra Upadhyay. This is my first post and I have been trying to write for a long time. I think there is no better time than now. I have been trying to learn Haskell for past 3 years in my free time, but was never able to code anything useful; mostly did fibonacci, sieve of eratosthenes, and sudoku - which was taking lot of memory and time because of bad pruning. ...