I'm a software engineer eager to make this world a better place to live in.
It's easy to give too much importance to them, and it feels that all the progress is gone when we break them
Tracking the total days since I started keeps a healthier perspective on my habits.
#buildinpublic
It's easy to give too much importance to them, and it feels that all the progress is gone when we break them
Tracking the total days since I started keeps a healthier perspective on my habits.
#buildinpublic
#buildinpublic #selfimprovement #mindset #selflove
#buildinpublic #selfimprovement #mindset #selflove
One day someone asked me "If you had to catch a flight, would you use that excuse?". It was game changer
#selfimprovement #buildinpublic #mindset
One day someone asked me "If you had to catch a flight, would you use that excuse?". It was game changer
#selfimprovement #buildinpublic #mindset
Realized I was avoiding it because it felt uncomfortable, but that's exactly why I needed to do it. Growth happens outside the comfort zone.
Good things can only happen if we put ourselves out there.
#buildinpublic
Realized I was avoiding it because it felt uncomfortable, but that's exactly why I needed to do it. Growth happens outside the comfort zone.
Good things can only happen if we put ourselves out there.
#buildinpublic
- Built a whole admin dashboard to make it easier for me to maintain courses and feedback
- Built new scrapers get course bibliography, assessment and description
But it was finally time to make UI improvements.
Roast my design!
- Built a whole admin dashboard to make it easier for me to maintain courses and feedback
- Built new scrapers get course bibliography, assessment and description
But it was finally time to make UI improvements.
Roast my design!
Join us to meet awesome builders in town, get inspired, charge your batteries and have a helluva productive week 🔥🚀 (it's free!)
👉 lu.ma/lqk0f36j
See you there!
Join us to meet awesome builders in town, get inspired, charge your batteries and have a helluva productive week 🔥🚀 (it's free!)
👉 lu.ma/lqk0f36j
See you there!
Guide with code available at github.com/afonsocrg/mu...
Feel free to PR with your own variation of the Pong game ;)
Guide with code available at github.com/afonsocrg/mu...
Feel free to PR with your own variation of the Pong game ;)
Today we made something similar in Lisbon and it was awesome! We had a productive day, got good feedback and made new connections!
#coworking #lisbon #indie
Today we made something similar in Lisbon and it was awesome! We had a productive day, got good feedback and made new connections!
#coworking #lisbon #indie
Add real-time shared cursors to your React app with just ONE line of code! Want full control? The useCursors is here for you!
StackBlitz Demo: stackblitz.com/edit/react-t...
#ReactJS #WebDev
Add real-time shared cursors to your React app with just ONE line of code! Want full control? The useCursors is here for you!
StackBlitz Demo: stackblitz.com/edit/react-t...
#ReactJS #WebDev
Full guide at github.com/afonsocrg/multi-pong
#workshop #croquet
Full guide at github.com/afonsocrg/multi-pong
#workshop #croquet
🎟️ 𝗬𝗼𝘂𝗿 𝗳𝗿𝗲𝗲 𝘁𝗶𝗰𝗸𝗲𝘁: meetup.com/lisboajs/eve...
A huge thanks to Remote Crew, Infraspeak and Le Wagon Portugal for making this event possible!!
#vue #lisbon
🎟️ 𝗬𝗼𝘂𝗿 𝗳𝗿𝗲𝗲 𝘁𝗶𝗰𝗸𝗲𝘁: meetup.com/lisboajs/eve...
A huge thanks to Remote Crew, Infraspeak and Le Wagon Portugal for making this event possible!!
#vue #lisbon
Try it → reacttogether.dev/chat
#react #reactjs
Try it → reacttogether.dev/chat
#react #reactjs
A few years ago I had to create some python CLI menus. Didn't like what was out there at the time, so decided to build my own :)
Hope it helps someone!
github.com/afonsocrg/ya...
#python
A few years ago I had to create some python CLI menus. Didn't like what was out there at the time, so decided to build my own :)
Hope it helps someone!
github.com/afonsocrg/ya...
#python
See you there 🔥
We'll have 2 awesome talks from Vasco Neves and Mário Balça.
Thanks to Remote Crew, Infra Speak, and Le Wagon Portugal for making this event possible!
Come for the talks, stay for the people!
See you there!
See you there 🔥
I believe the internet needs to evolve towards collaboration by default. Thoughts on this? 🤔
#webdev #ux
dev.to/afonsocrg/st...
I believe the internet needs to evolve towards collaboration by default. Thoughts on this? 🤔
#webdev #ux
dev.to/afonsocrg/st...
Yes, it's possible, and it's extremely easy! Here's how:
dev.to/afonsocrg/ad...
#react #javascript #web #frontend #webdev
Yes, it's possible, and it's extremely easy! Here's how:
dev.to/afonsocrg/ad...
#react #javascript #web #frontend #webdev
Yey, it's done! To reduce search, I stored the locks in a tree of HashMaps, indexed by pin size.
Thanks @was.tl and team for these challenges, it's been a fun journey!! Merry Christmas to everyone
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Yey, it's done! To reduce search, I stored the locks in a tree of HashMaps, indexed by pin size.
Thanks @was.tl and team for these challenges, it's been a fun journey!! Merry Christmas to everyone
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
For Part 2, I checked which gates broke addition circuit rules: XOR outputs must feed into AND+XOR gates, and so on... Got a messy code, but found the 8 swapped wires!
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
For Part 2, I checked which gates broke addition circuit rules: XOR outputs must feed into AND+XOR gates, and so on... Got a messy code, but found the 8 swapped wires!
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Got a fast solution by checking for complete subgraphs (TIL they're also known as cliques) while processing each edge.
Used HashMaps and HashSets for faster lookup and intersections.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Got a fast solution by checking for complete subgraphs (TIL they're also known as cliques) while processing each edge.
Used HashMaps and HashSets for faster lookup and intersections.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Used bit-wise operators to make the next number generation faster. For Part 2, stored diff sequences as 20 bit integers for faster lookup.
Times:
Part 1: 11.6ms
Part 2: 147.8ms
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Used bit-wise operators to make the next number generation faster. For Part 2, stored diff sequences as 20 bit integers for faster lookup.
Times:
Part 1: 11.6ms
Part 2: 147.8ms
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Defined the problem recursively and used caching to avoid re-computation of intermediate results. This one was a real conundrum.
Happy with my execution times:
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Defined the problem recursively and used caching to avoid re-computation of intermediate results. This one was a real conundrum.
Happy with my execution times:
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Got a O(n) solution by storing the distance from each position to the end, and by checking for shortcuts in each position vicinity. Did a "diamond" for-loop for the first time, it was fun.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Got a O(n) solution by storing the distance from each position to the end, and by checking for shortcuts in each position vicinity. Did a "diamond" for-loop for the first time, it was fun.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Memoization did the trick for this problem!!
Also, instead of checking one pattern at a time, I checked if prefixes with different lengths existed in the pattern set, which sped up my solution by 4x.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Memoization did the trick for this problem!!
Also, instead of checking one pattern at a time, I checked if prefixes with different lengths existed in the pattern set, which sped up my solution by 4x.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Reused the A* from day 16 (might implement a generic one). For part 2, a binary search got me the right answer in 400ms (took 13 attempts)
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Reused the A* from day 16 (might implement a generic one). For part 2, a binary search got me the right answer in 400ms (took 13 attempts)
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Part 2 was a fun excuse to revisit Z3—it’s been five years since I last played around with it.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust
Part 2 was a fun excuse to revisit Z3—it’s been five years since I last played around with it.
Code: github.com/afonsocrg/AoC
#AdventOfCode #rust