Judy Zhang
@judyzhang.bsky.social
Multi-task lover | Looking to build up my portfolio
Hello world! I'm still alive. There are a couple things I've been working on so just been out for a bit.
- product development
- API and typescript
- some reading on improving health
- listening to a podcast on ADHD
It's hard to put my capabilities in a resume...
- product development
- API and typescript
- some reading on improving health
- listening to a podcast on ADHD
It's hard to put my capabilities in a resume...
August 27, 2025 at 1:45 AM
Hello world! I'm still alive. There are a couple things I've been working on so just been out for a bit.
- product development
- API and typescript
- some reading on improving health
- listening to a podcast on ADHD
It's hard to put my capabilities in a resume...
- product development
- API and typescript
- some reading on improving health
- listening to a podcast on ADHD
It's hard to put my capabilities in a resume...
Using Gemini Pro 2.5 to write paper and I feel (?) that writing style is a bit different than ChatGPT. Both models write initial drafts with extremely long sentences, tho grammatically correct, but am I hallucinating that Gemini Pro 2.5 writes more with hyphens? #genAI
May 7, 2025 at 1:42 AM
Using Gemini Pro 2.5 to write paper and I feel (?) that writing style is a bit different than ChatGPT. Both models write initial drafts with extremely long sentences, tho grammatically correct, but am I hallucinating that Gemini Pro 2.5 writes more with hyphens? #genAI
498. Diagonal Traverse - Python | 2587 ms, 21 MB
The optimal solution is simply "walk" through the path until hitting a decision point. My solution is obviously too tricky for both compute time and storage time. #leetcode #python
Was kinda forced to do lc because I can't tutor my friend.
The optimal solution is simply "walk" through the path until hitting a decision point. My solution is obviously too tricky for both compute time and storage time. #leetcode #python
Was kinda forced to do lc because I can't tutor my friend.
April 11, 2025 at 11:37 PM
566. Reshape the Matrix - #Python | 0 ms, 18.4 MB
leetcode.com/problems/res...
2373. Largest Local Values in a Matrix - #Python | 26 ms, 18.4 MB leetcode.com/problems/lar...
With #leetcode and interviews, I wonder if it's just a mental block. My brilliant friends just cannot overcome it.
leetcode.com/problems/res...
2373. Largest Local Values in a Matrix - #Python | 26 ms, 18.4 MB leetcode.com/problems/lar...
With #leetcode and interviews, I wonder if it's just a mental block. My brilliant friends just cannot overcome it.
April 11, 2025 at 7:19 PM
566. Reshape the Matrix - #Python | 0 ms, 18.4 MB
leetcode.com/problems/res...
2373. Largest Local Values in a Matrix - #Python | 26 ms, 18.4 MB leetcode.com/problems/lar...
With #leetcode and interviews, I wonder if it's just a mental block. My brilliant friends just cannot overcome it.
leetcode.com/problems/res...
2373. Largest Local Values in a Matrix - #Python | 26 ms, 18.4 MB leetcode.com/problems/lar...
With #leetcode and interviews, I wonder if it's just a mental block. My brilliant friends just cannot overcome it.
To prepare for my upcoming data bricks exam, I used OpenAI's ChatGPT and Google's Gemini to create a study schedule. ChatGPT gave a much more reasonable schedule, but the ics file was not generated (prob cuz I used anonymized mode). Gemini was able to create the events with ease. #AI #Productivity
March 27, 2025 at 4:10 AM
To prepare for my upcoming data bricks exam, I used OpenAI's ChatGPT and Google's Gemini to create a study schedule. ChatGPT gave a much more reasonable schedule, but the ics file was not generated (prob cuz I used anonymized mode). Gemini was able to create the events with ease. #AI #Productivity
207. Course Schedule - Python | 44 ms, 19.9 MB
The solution is the same as checking if a graph is a DAG (directed acyclic graph). I was surprised my original solution exceeded the time limit - I needed to clear the children to be explored to save intermediate result. #python #leetcode #neetcode75
The solution is the same as checking if a graph is a DAG (directed acyclic graph). I was surprised my original solution exceeded the time limit - I needed to clear the children to be explored to save intermediate result. #python #leetcode #neetcode75
March 27, 2025 at 3:42 AM
207. Course Schedule - Python | 44 ms, 19.9 MB
The solution is the same as checking if a graph is a DAG (directed acyclic graph). I was surprised my original solution exceeded the time limit - I needed to clear the children to be explored to save intermediate result. #python #leetcode #neetcode75
The solution is the same as checking if a graph is a DAG (directed acyclic graph). I was surprised my original solution exceeded the time limit - I needed to clear the children to be explored to save intermediate result. #python #leetcode #neetcode75
417. Pacific Atlantic Water Flow - Python | 9588 ms, 18.9 MB
Passing all the test cases and beating only 5% of solutions in runtime is an achievement (memory beat 99% though). Will have to revisit. #python #leetcode #neetcode75
Passing all the test cases and beating only 5% of solutions in runtime is an achievement (memory beat 99% though). Will have to revisit. #python #leetcode #neetcode75
March 26, 2025 at 3:16 AM
417. Pacific Atlantic Water Flow - Python | 9588 ms, 18.9 MB
Passing all the test cases and beating only 5% of solutions in runtime is an achievement (memory beat 99% though). Will have to revisit. #python #leetcode #neetcode75
Passing all the test cases and beating only 5% of solutions in runtime is an achievement (memory beat 99% though). Will have to revisit. #python #leetcode #neetcode75
133. Clone Graph - Python | 40 ms, 18.1 MB
DFS is used to find and make all nodes and then connect all graphs. So runtime should be O(n). Used a map data structure to store the intermediate results to make finding each node with O(1) computation. #python #leetcode #neetcode75
DFS is used to find and make all nodes and then connect all graphs. So runtime should be O(n). Used a map data structure to store the intermediate results to make finding each node with O(1) computation. #python #leetcode #neetcode75
March 24, 2025 at 8:03 PM
133. Clone Graph - Python | 40 ms, 18.1 MB
DFS is used to find and make all nodes and then connect all graphs. So runtime should be O(n). Used a map data structure to store the intermediate results to make finding each node with O(1) computation. #python #leetcode #neetcode75
DFS is used to find and make all nodes and then connect all graphs. So runtime should be O(n). Used a map data structure to store the intermediate results to make finding each node with O(1) computation. #python #leetcode #neetcode75
200. Number of Islands - Python | 216 ms, 20.3 MB
Used DFS to identify tiles that represent the current "island" and then convert it to "water" to mark that this tile is no longer of interest. O(m*n): m = # of rows, n = # of columns. #python #leetcode. 41 out of #neetcode75. More than halfway done!
Used DFS to identify tiles that represent the current "island" and then convert it to "water" to mark that this tile is no longer of interest. O(m*n): m = # of rows, n = # of columns. #python #leetcode. 41 out of #neetcode75. More than halfway done!
March 23, 2025 at 7:05 PM
200. Number of Islands - Python | 216 ms, 20.3 MB
Used DFS to identify tiles that represent the current "island" and then convert it to "water" to mark that this tile is no longer of interest. O(m*n): m = # of rows, n = # of columns. #python #leetcode. 41 out of #neetcode75. More than halfway done!
Used DFS to identify tiles that represent the current "island" and then convert it to "water" to mark that this tile is no longer of interest. O(m*n): m = # of rows, n = # of columns. #python #leetcode. 41 out of #neetcode75. More than halfway done!
208. Implement Trie (Prefix Tree) - Python |56 ms, 32.3 MB
Trie is like a linked list on steroids...
#python #leetcode #neetcode75
Trie is like a linked list on steroids...
#python #leetcode #neetcode75
March 21, 2025 at 2:24 AM
208. Implement Trie (Prefix Tree) - Python |56 ms, 32.3 MB
Trie is like a linked list on steroids...
#python #leetcode #neetcode75
Trie is like a linked list on steroids...
#python #leetcode #neetcode75
79. Word Search - Python | 5675 ms, 18 MB
DFS search. Again, my performance is not great when I track these intermediate steps. I need to read up on backtrack and think about the difference between it and just tree search algorithms.
#leetcode #python #neetcode75
DFS search. Again, my performance is not great when I track these intermediate steps. I need to read up on backtrack and think about the difference between it and just tree search algorithms.
#leetcode #python #neetcode75
March 19, 2025 at 1:23 PM
79. Word Search - Python | 5675 ms, 18 MB
DFS search. Again, my performance is not great when I track these intermediate steps. I need to read up on backtrack and think about the difference between it and just tree search algorithms.
#leetcode #python #neetcode75
DFS search. Again, my performance is not great when I track these intermediate steps. I need to read up on backtrack and think about the difference between it and just tree search algorithms.
#leetcode #python #neetcode75
39. Combination Sum - Python | 1019 ms, 17.9 MB
I got the recursion part right. Comparing my result to some of the other more efficient solutions, the difference is how the problem is divided into subproblems and track progress. Might redo this problem. #python #leetcode #neetcode75
I got the recursion part right. Comparing my result to some of the other more efficient solutions, the difference is how the problem is divided into subproblems and track progress. Might redo this problem. #python #leetcode #neetcode75
March 18, 2025 at 5:46 PM
39. Combination Sum - Python | 1019 ms, 17.9 MB
I got the recursion part right. Comparing my result to some of the other more efficient solutions, the difference is how the problem is divided into subproblems and track progress. Might redo this problem. #python #leetcode #neetcode75
I got the recursion part right. Comparing my result to some of the other more efficient solutions, the difference is how the problem is divided into subproblems and track progress. Might redo this problem. #python #leetcode #neetcode75
If I remember correctly... I got a A- in data structure in college despite the fact that so many years later I completely forgot heap is actually a tree structure... To be fair, I've never used it since data structure class.
March 17, 2025 at 8:46 PM
If I remember correctly... I got a A- in data structure in college despite the fact that so many years later I completely forgot heap is actually a tree structure... To be fair, I've never used it since data structure class.
295. Find Median from Data Stream - Python
First time using heapq in Python (btw I never took a formal CS class in Python...). I will have to revisit this problem as I did not solve this question independently. Found some nice #python resource: pymotw.com/3/
#leetcode #neetcode75
First time using heapq in Python (btw I never took a formal CS class in Python...). I will have to revisit this problem as I did not solve this question independently. Found some nice #python resource: pymotw.com/3/
#leetcode #neetcode75
Python 3 Module of the Week
pymotw.com
March 17, 2025 at 8:22 PM
295. Find Median from Data Stream - Python
First time using heapq in Python (btw I never took a formal CS class in Python...). I will have to revisit this problem as I did not solve this question independently. Found some nice #python resource: pymotw.com/3/
#leetcode #neetcode75
First time using heapq in Python (btw I never took a formal CS class in Python...). I will have to revisit this problem as I did not solve this question independently. Found some nice #python resource: pymotw.com/3/
#leetcode #neetcode75
23. Merge k Sorted Lists - Python | 1288 ms, 20.2 MB
For #leetcode hard questions, I believe, "as long as I solve this, even if it's brute force and not the best solution out there, I am golden." Mine's O(mn) solution, where I check for min of each list every time. But heck, I solved a HARD.
For #leetcode hard questions, I believe, "as long as I solve this, even if it's brute force and not the best solution out there, I am golden." Mine's O(mn) solution, where I check for min of each list every time. But heck, I solved a HARD.
March 17, 2025 at 1:41 AM
23. Merge k Sorted Lists - Python | 1288 ms, 20.2 MB
For #leetcode hard questions, I believe, "as long as I solve this, even if it's brute force and not the best solution out there, I am golden." Mine's O(mn) solution, where I check for min of each list every time. But heck, I solved a HARD.
For #leetcode hard questions, I believe, "as long as I solve this, even if it's brute force and not the best solution out there, I am golden." Mine's O(mn) solution, where I check for min of each list every time. But heck, I solved a HARD.
19. Remove Nth Node From End of List - Python | 0 ms, 18 MB
Linked list type of problem seems to have a trend to use 2 pointers. I did peek into the hint section and solved this one in O(n) within 10 minutes (definitely a record).
#python #leetcode #neetcode75
Linked list type of problem seems to have a trend to use 2 pointers. I did peek into the hint section and solved this one in O(n) within 10 minutes (definitely a record).
#python #leetcode #neetcode75
March 15, 2025 at 8:48 PM
19. Remove Nth Node From End of List - Python | 0 ms, 18 MB
Linked list type of problem seems to have a trend to use 2 pointers. I did peek into the hint section and solved this one in O(n) within 10 minutes (definitely a record).
#python #leetcode #neetcode75
Linked list type of problem seems to have a trend to use 2 pointers. I did peek into the hint section and solved this one in O(n) within 10 minutes (definitely a record).
#python #leetcode #neetcode75
I just finished initial learning on #LaTeX from Overleaf; I don't understand why I didn't spend the time to really practice LaTeX in school, but it's better late than never. I do feel more confident in rewriting my technical resume.
March 15, 2025 at 1:36 AM
I just finished initial learning on #LaTeX from Overleaf; I don't understand why I didn't spend the time to really practice LaTeX in school, but it's better late than never. I do feel more confident in rewriting my technical resume.
143. Reorder List - Python | 47 ms, 23.3 MB
I brute-forced it with O(n) solution.
1- create a queue that stores all of the nodes - remove all of the links between nodes
2- pop the front and the back of the list to recreate the linked list
Not as elegant. But job done.
#python #leetcode #neetcode75
I brute-forced it with O(n) solution.
1- create a queue that stores all of the nodes - remove all of the links between nodes
2- pop the front and the back of the list to recreate the linked list
Not as elegant. But job done.
#python #leetcode #neetcode75
March 15, 2025 at 12:51 AM
143. Reorder List - Python | 47 ms, 23.3 MB
I brute-forced it with O(n) solution.
1- create a queue that stores all of the nodes - remove all of the links between nodes
2- pop the front and the back of the list to recreate the linked list
Not as elegant. But job done.
#python #leetcode #neetcode75
I brute-forced it with O(n) solution.
1- create a queue that stores all of the nodes - remove all of the links between nodes
2- pop the front and the back of the list to recreate the linked list
Not as elegant. But job done.
#python #leetcode #neetcode75
141. Linked List Cycle - Python
This is another problem that I might redo. The solution uses 2 pointers approach where slow pointer moves at pace of 1 while fast pointer moves at the pace of 2. Every iteration, the gap between two pointers increases by 1. #python #leetcode #neetcode
This is another problem that I might redo. The solution uses 2 pointers approach where slow pointer moves at pace of 1 while fast pointer moves at the pace of 2. Every iteration, the gap between two pointers increases by 1. #python #leetcode #neetcode
March 12, 2025 at 4:25 PM
21. Merge Two Sorted Lists - Python | 0 ms, 17.7 MB
Used recursion and achieved the best result. I also did this question in 2020, and the performance is not as great with the 3-pointer approach (my first instinct). My laziness guided me to use recursion. #python #leetcode #neetcode75
Used recursion and achieved the best result. I also did this question in 2020, and the performance is not as great with the 3-pointer approach (my first instinct). My laziness guided me to use recursion. #python #leetcode #neetcode75
March 11, 2025 at 9:46 AM
21. Merge Two Sorted Lists - Python | 0 ms, 17.7 MB
Used recursion and achieved the best result. I also did this question in 2020, and the performance is not as great with the 3-pointer approach (my first instinct). My laziness guided me to use recursion. #python #leetcode #neetcode75
Used recursion and achieved the best result. I also did this question in 2020, and the performance is not as great with the 3-pointer approach (my first instinct). My laziness guided me to use recursion. #python #leetcode #neetcode75
206. Reverse Linked List - Python | 0 ms, 18.8 MB
Implemented 2 solutions: 1 with recursion and 1 with just 3 pointers (prev, curr, next). Despite the fact that both solutions are O(n), the recursive solution takes much longer in runtime and more memory. #python #leetcode 30/ #neetcode75
Implemented 2 solutions: 1 with recursion and 1 with just 3 pointers (prev, curr, next). Despite the fact that both solutions are O(n), the recursive solution takes much longer in runtime and more memory. #python #leetcode 30/ #neetcode75
March 10, 2025 at 7:28 PM
206. Reverse Linked List - Python | 0 ms, 18.8 MB
Implemented 2 solutions: 1 with recursion and 1 with just 3 pointers (prev, curr, next). Despite the fact that both solutions are O(n), the recursive solution takes much longer in runtime and more memory. #python #leetcode 30/ #neetcode75
Implemented 2 solutions: 1 with recursion and 1 with just 3 pointers (prev, curr, next). Despite the fact that both solutions are O(n), the recursive solution takes much longer in runtime and more memory. #python #leetcode 30/ #neetcode75
33. Search in Rotated Sorted Array - Python | 0 ms, 18.4 MB
To decide which subproblem is worth solving, peek into the first and last number (as this is a rotated ordered list). O(logN).
#leetcode #python #neetcode75
To decide which subproblem is worth solving, peek into the first and last number (as this is a rotated ordered list). O(logN).
#leetcode #python #neetcode75
March 9, 2025 at 6:42 PM
33. Search in Rotated Sorted Array - Python | 0 ms, 18.4 MB
To decide which subproblem is worth solving, peek into the first and last number (as this is a rotated ordered list). O(logN).
#leetcode #python #neetcode75
To decide which subproblem is worth solving, peek into the first and last number (as this is a rotated ordered list). O(logN).
#leetcode #python #neetcode75