〰️ full stack engineer

Los Angeles, CA
Joined May 2020
πŸ™‚ feeling grateful
1
3
187
Great blog on how to install Ruby on macOS with rvm 😁 jeffreymorgan.io/articles/ru…
118
Today I'm learning how to add Storybook to Nx React Native applications πŸ’›
2
229
I find listening to #Chopin first thing in the morning boosts my productivity most. 🎹🎢
2
still getting used to useMemo vs useCallback πŸ€” #react
Love it when my team embrace conventional commits πŸ’› conventionalcommits.org/en/v…
learned a new word today, numeronym 😬
1
2
I'm having fun playing with my old #CLI project. πŸš€πŸ‘¨πŸ»β€πŸš€πŸ‘©πŸ»β€πŸš€
1
I’ve decided to take a break from my dsa study for a month. Namaste. πŸ™πŸΌπŸ“Ώ
2
1
3
The lifespans of some of the most well-known people of the past 600 years
192
736
129
5,631
I can't seem to wrap my head around this tree problem πŸ˜΅β€πŸ’« sort of understood first provided solution in recursion, but then got lost in recursion with memoization and dynamic programming. #leetcode problem leetcode.com/problems/house-…
1
1
1
O(n) time as we are going through each node. O(log n) best and O(n) worst space complexity.
1
Looking at old projects from coding bootcamp, I’ve grown. πŸ₯²πŸ’›
1
7
Trippy. 😬 So instead of creating a visited object/array, we can mutate the '1's to '0's. Problem can be solved with #dfs and #bfs, same time but better space complexity. 🏝️ #leetcode problem leetcode.com/problems/number…
2
Graphs.. I really need to get used to non-linear data structure moving forward. This problem took me a while to understand, and I could only understand the first iteration of possible solutions. n is total of stones and e is edge O(n ^ 2 + e) time and O(n + e) space complexity
1
1
I have a tendency to solve most of my #leetcode problems.. first with hash table.. πŸ˜“
3
Accidentally picked up a "hard" #leetcode problemπŸ€¦πŸ»β€β™€οΈ Now picking up an "easy" one to make it up 🫠
3
I messed up the initial solution thinking #javascript Set() would solve it, had to refactor to Map(). I still have to get used to .get(), .set(), .has() and .delete(). πŸŠπŸŽπŸ‹πŸ‘πŸ #leetcode problem leetcode.com/problems/fruit-…
2