06:40 <+bridge> [ddnet] with the lava puzzle, for these recursive approaches, I always instantly declare an extra array of booleans where I check if I already was at this index to avoid repetition. I wonder if this is the common way to do it 07:56 <+bridge> [ddnet] memoization? 08:38 <+bridge> [ddnet] im getting the example correct but with my input it doesnt work 08:38 <+bridge> [ddnet] 💀 08:47 <+bridge> [ddnet] 11011110 08:50 <+bridge> [ddnet] got the first part xd 08:53 <+bridge> [ddnet] https://support.alexa.com/hc/en-us/articles/4410503838999 08:54 <+bridge> [ddnet] lol this is surprising 08:54 <+bridge> [ddnet] > We will be retiring Alexa.com on May 1, 2022 08:54 <+bridge> [ddnet] https://news.ycombinator.com/item?id=29488522 08:55 <+bridge> [ddnet] > 08:55 <+bridge> [ddnet] > ravenstine 11 hours ago | prev | next [–] 08:55 <+bridge> [ddnet] > 08:55 <+bridge> [ddnet] > Are there any alternatives? I enjoy watching the long-term decline of the websites of former employers I don't like. 08:55 <+bridge> [ddnet] xd 20:04 <+bridge> [ddnet] eh sure :> 20:04 <+bridge> [ddnet] ```Bash 20:04 <+bridge> [ddnet] #!/bin/bash 20:04 <+bridge> [ddnet] shopt -s lastpipe; for l in `cut -d'|' -f2 "$1" | xargs | tr ' ' '\n'`; do [[ "2 4 3 7" =~ "${#l}" ]] && i=$((i+1)); done; echo $i 20:04 <+bridge> [ddnet] ``` 20:04 <+bridge> [ddnet] (143 Bytes) 20:04 <+bridge> [ddnet] btw that didnt work for today, but somehow i have a p1 solution :> 20:04 <+bridge> [ddnet] ```Bash 20:04 <+bridge> [ddnet] #!/bin/bash 20:04 <+bridge> [ddnet] # Advent of Code 9p1 20:04 <+bridge> [ddnet] shopt -s lastpipe 20:04 <+bridge> [ddnet] declare -A f 20:04 <+bridge> [ddnet] i=0 20:04 <+bridge> [ddnet] while read -r l; do 20:04 <+bridge> [ddnet] for j in {0..99}; do f[$i,$j]=${l:$j:1}; done 20:04 <+bridge> [ddnet] i=$((i+1)) 20:04 <+bridge> [ddnet] done < "$1" 20:04 <+bridge> [ddnet] for i in {0..99}; do 20:04 <+bridge> [ddnet] for j in {0..99}; do 20:04 <+bridge> [ddnet] l=${f[$i,$j]} 20:04 <+bridge> [ddnet] if [ -z ${f[$((i-1)),$j]} ] || [[ ${f[$((i-1)),$j]} -gt $l ]]; then 20:04 <+bridge> [ddnet] if [ -z ${f[$((i+1)),$j]} ] || [[ ${f[$((i+1)),$j]} -gt $l ]]; then 20:04 <+bridge> [ddnet] if [ -z ${f[$i,$((j-1))]} ] || [[ ${f[$i,$((j-1))]} -gt $l ]]; then 20:04 <+bridge> [ddnet] if [ -z ${f[$i,$((j+1))]} ] || [[ ${f[$i,$((j+1))]} -gt $l ]]; then 20:04 <+bridge> [ddnet] [ -z $l ] && continue 20:04 <+bridge> [ddnet] a=$((a + l + 1)) 20:04 <+bridge> [ddnet] fi 20:04 <+bridge> [ddnet] fi 20:04 <+bridge> [ddnet] fi 20:04 <+bridge> [ddnet] fi 20:05 <+bridge> [ddnet] done 20:05 <+bridge> [ddnet] done 20:05 <+bridge> [ddnet] echo $a 20:05 <+bridge> [ddnet] ``` 20:05 <+bridge> [ddnet] eh sure :> (143 Bytes) 20:05 <+bridge> [ddnet] ```Bash 20:05 <+bridge> [ddnet] #!/bin/bash 20:05 <+bridge> [ddnet] shopt -s lastpipe; for l in `cut -d'|' -f2 "$1" | xargs | tr ' ' '\n'`; do [[ "2 4 3 7" =~ "${#l}" ]] && i=$((i+1)); done; echo $i 20:05 <+bridge> [ddnet] ``` 20:12 <+bridge> [ddnet] that looks so complicated 20:24 <+bridge> [ddnet] :monkaS: 20:25 <+bridge> [ddnet] 👀