James Jahner
@james-allen-jahner.bsky.social
Software Engineer specializing in Frontend with Backend knowledge | Familiar with technologies like React, MongoDB, Node and more |
Leet code of the day!
Place N Cameras Without Conflict on Blocked Grid
Did You Know your row has an integer: row 0, row 1, row 2, row 3.
Did you know your column has an integer: column 0, column 1, column 2, column 3.
But so do your diagonals
Place N Cameras Without Conflict on Blocked Grid
Did You Know your row has an integer: row 0, row 1, row 2, row 3.
Did you know your column has an integer: column 0, column 1, column 2, column 3.
But so do your diagonals
December 13, 2025 at 1:59 AM
Leet code of the day!
Place N Cameras Without Conflict on Blocked Grid
Did You Know your row has an integer: row 0, row 1, row 2, row 3.
Did you know your column has an integer: column 0, column 1, column 2, column 3.
But so do your diagonals
Place N Cameras Without Conflict on Blocked Grid
Did You Know your row has an integer: row 0, row 1, row 2, row 3.
Did you know your column has an integer: column 0, column 1, column 2, column 3.
But so do your diagonals
...why use one framework when you can use 8?
you have a huge choice when choosing which framework to use when writing for windows 11.
which would you choose?
you have a huge choice when choosing which framework to use when writing for windows 11.
which would you choose?
December 6, 2025 at 1:59 AM
...why use one framework when you can use 8?
you have a huge choice when choosing which framework to use when writing for windows 11.
which would you choose?
you have a huge choice when choosing which framework to use when writing for windows 11.
which would you choose?
LeetCode of the day!
Remove Consecutive Duplicates from Sorted Linked List
Remove Consecutive Duplicates from Sorted Linked List
December 3, 2025 at 2:27 AM
LeetCode of the day!
Remove Consecutive Duplicates from Sorted Linked List
Remove Consecutive Duplicates from Sorted Linked List
LeetCode of the day.
Good old Fibonacci sequence.
The most important thing to do when you start a LeetCode is read it.
Notice at the top says that this can have a long integer.
Good old Fibonacci sequence.
The most important thing to do when you start a LeetCode is read it.
Notice at the top says that this can have a long integer.
November 19, 2025 at 2:27 AM
LeetCode of the day.
Good old Fibonacci sequence.
The most important thing to do when you start a LeetCode is read it.
Notice at the top says that this can have a long integer.
Good old Fibonacci sequence.
The most important thing to do when you start a LeetCode is read it.
Notice at the top says that this can have a long integer.
Hey, it looks like it's time to update Next JS.
Who's gonna do it on their current project or will you wait till your next project?
Who's gonna do it on their current project or will you wait till your next project?
November 15, 2025 at 2:52 PM
Hey, it looks like it's time to update Next JS.
Who's gonna do it on their current project or will you wait till your next project?
Who's gonna do it on their current project or will you wait till your next project?
LeetCode of the Day.
November 8, 2025 at 1:59 AM
LeetCode of the Day.
🎉 PageLM 🎉
Finally this will help kids and adults a like learn with the one on one help proven to be effective... since we aren't willing to spend to support education. this will have to do!
PageLM converts study material into interactive resources, check it out!
Finally this will help kids and adults a like learn with the one on one help proven to be effective... since we aren't willing to spend to support education. this will have to do!
PageLM converts study material into interactive resources, check it out!
November 5, 2025 at 2:27 AM
🎉 PageLM 🎉
Finally this will help kids and adults a like learn with the one on one help proven to be effective... since we aren't willing to spend to support education. this will have to do!
PageLM converts study material into interactive resources, check it out!
Finally this will help kids and adults a like learn with the one on one help proven to be effective... since we aren't willing to spend to support education. this will have to do!
PageLM converts study material into interactive resources, check it out!
Leetcode of the Day!
Including the thought process of solving it.
Good Luck.
Including the thought process of solving it.
Good Luck.
November 3, 2025 at 10:29 PM
Leetcode of the Day!
Including the thought process of solving it.
Good Luck.
Including the thought process of solving it.
Good Luck.
I love this image. I was reading about Lodash and how have reached a knew stage of life!
"Lodash’s future will focus on making the project sustainable, based on the assumption that it is now feature-complete (ref).
blog.ulisesgascon.com/the-future-o...
"Lodash’s future will focus on making the project sustainable, based on the assumption that it is now feature-complete (ref).
blog.ulisesgascon.com/the-future-o...
November 2, 2025 at 2:09 PM
I love this image. I was reading about Lodash and how have reached a knew stage of life!
"Lodash’s future will focus on making the project sustainable, based on the assumption that it is now feature-complete (ref).
blog.ulisesgascon.com/the-future-o...
"Lodash’s future will focus on making the project sustainable, based on the assumption that it is now feature-complete (ref).
blog.ulisesgascon.com/the-future-o...
LeetCode of the day: TWO SUM duh duh duh!
Now I'm trying to teach you thought processes. So enjoy your thinks🤯
Now I'm trying to teach you thought processes. So enjoy your thinks🤯
October 30, 2025 at 1:45 PM
LeetCode of the day: TWO SUM duh duh duh!
Now I'm trying to teach you thought processes. So enjoy your thinks🤯
Now I'm trying to teach you thought processes. So enjoy your thinks🤯
Leetcode of the day. And this one was a little confusing. The way it's worded I thought K was referring to the index but it's actually referring to the value
"Remove Elements Within K Distance"
"Remove Elements Within K Distance"
October 29, 2025 at 4:40 PM
Leetcode of the day. And this one was a little confusing. The way it's worded I thought K was referring to the index but it's actually referring to the value
"Remove Elements Within K Distance"
"Remove Elements Within K Distance"
I don't know if you guys use Notion but they just hit 3.0 version and so we got another AI agent, They're making it pretty powerful where anything that you could do in Notion. I don't know if I can even fathom all the kind of work that you can do in Notion.
October 26, 2025 at 1:09 PM
I don't know if you guys use Notion but they just hit 3.0 version and so we got another AI agent, They're making it pretty powerful where anything that you could do in Notion. I don't know if I can even fathom all the kind of work that you can do in Notion.
Alright LEETCODE OF the day: Walkthrough Version!
Count Number Pairs
Given a sorted array of positive integers and a target value, count the number of pairs (i, j) where i < j and array[i] + array[j] <= target.
a. READ IT, I didn't realize I was doing it wrong until I reread it
Count Number Pairs
Given a sorted array of positive integers and a target value, count the number of pairs (i, j) where i < j and array[i] + array[j] <= target.
a. READ IT, I didn't realize I was doing it wrong until I reread it
October 25, 2025 at 1:52 PM
Alright LEETCODE OF the day: Walkthrough Version!
Count Number Pairs
Given a sorted array of positive integers and a target value, count the number of pairs (i, j) where i < j and array[i] + array[j] <= target.
a. READ IT, I didn't realize I was doing it wrong until I reread it
Count Number Pairs
Given a sorted array of positive integers and a target value, count the number of pairs (i, j) where i < j and array[i] + array[j] <= target.
a. READ IT, I didn't realize I was doing it wrong until I reread it
LeetCode of the day
October 18, 2025 at 3:29 PM
LeetCode of the day
LeetCode of the Day:
- Time: O(n log n)
- Space: O(1)
- Time: O(n log n)
- Space: O(1)
October 11, 2025 at 1:52 PM
LeetCode of the Day:
- Time: O(n log n)
- Space: O(1)
- Time: O(n log n)
- Space: O(1)
LeetCode of the the Day:
Height of Binary Search Tree:
In this particular case each node is depicted by the index.
So in this case use recursive.
space and time O(n)
Height of Binary Search Tree:
In this particular case each node is depicted by the index.
So in this case use recursive.
space and time O(n)
October 8, 2025 at 1:27 AM
LeetCode of the the Day:
Height of Binary Search Tree:
In this particular case each node is depicted by the index.
So in this case use recursive.
space and time O(n)
Height of Binary Search Tree:
In this particular case each node is depicted by the index.
So in this case use recursive.
space and time O(n)
Here's the leet code of the day. Today we're going to work through it on Linkedin because it's really confusing.
October 6, 2025 at 9:29 PM
Here's the leet code of the day. Today we're going to work through it on Linkedin because it's really confusing.
LeetCode of the Day:
This one was very hard the first time I went through it,
but I had some help to logically figure it out.
Then I waited a week and tried it again. This is what I got.
This one was very hard the first time I went through it,
but I had some help to logically figure it out.
Then I waited a week and tried it again. This is what I got.
October 5, 2025 at 1:09 PM
LeetCode of the Day:
This one was very hard the first time I went through it,
but I had some help to logically figure it out.
Then I waited a week and tried it again. This is what I got.
This one was very hard the first time I went through it,
but I had some help to logically figure it out.
Then I waited a week and tried it again. This is what I got.
Leetcode of the day.
74. Search a 2D Matrix
You are given an m x n integer matrix matrix:
Each row is sorted in non-decreasing order.
The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
74. Search a 2D Matrix
You are given an m x n integer matrix matrix:
Each row is sorted in non-decreasing order.
The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
October 4, 2025 at 1:52 PM
Leetcode of the day.
74. Search a 2D Matrix
You are given an m x n integer matrix matrix:
Each row is sorted in non-decreasing order.
The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
74. Search a 2D Matrix
You are given an m x n integer matrix matrix:
Each row is sorted in non-decreasing order.
The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
So which one would you suggest for a new developer to start with?
October 4, 2025 at 12:59 AM
So which one would you suggest for a new developer to start with?
oh these are some fun effects with plain old CSS.
this guy Josh W Comeau seems to have been having some fun.
he explains he process, but you can skip to the end
www.joshwcomeau.com/animation/co...
this guy Josh W Comeau seems to have been having some fun.
he explains he process, but you can skip to the end
www.joshwcomeau.com/animation/co...
September 21, 2025 at 1:09 PM
oh these are some fun effects with plain old CSS.
this guy Josh W Comeau seems to have been having some fun.
he explains he process, but you can skip to the end
www.joshwcomeau.com/animation/co...
this guy Josh W Comeau seems to have been having some fun.
he explains he process, but you can skip to the end
www.joshwcomeau.com/animation/co...
Leon and Danny have another one the podcasts and it happens to be just in time for CYC.
I hope I'll see all of you there!
I'm super excited it's going to be bigger than ever, and remember all proceeds go to charity.
youtu.be/JVueeJ2Ah2o?...
I hope I'll see all of you there!
I'm super excited it's going to be bigger than ever, and remember all proceeds go to charity.
youtu.be/JVueeJ2Ah2o?...
September 18, 2025 at 11:53 PM
Leon and Danny have another one the podcasts and it happens to be just in time for CYC.
I hope I'll see all of you there!
I'm super excited it's going to be bigger than ever, and remember all proceeds go to charity.
youtu.be/JVueeJ2Ah2o?...
I hope I'll see all of you there!
I'm super excited it's going to be bigger than ever, and remember all proceeds go to charity.
youtu.be/JVueeJ2Ah2o?...
Hey you noticed the new footer at the bottom of chrome?
If you don't like it: right click it.
If you don't like it: right click it.
September 15, 2025 at 9:29 PM
Hey you noticed the new footer at the bottom of chrome?
If you don't like it: right click it.
If you don't like it: right click it.
I laughed when I when I saw this for the first time. How many layers of destructing do you think it is w/o counting?
September 8, 2025 at 9:29 PM
I laughed when I when I saw this for the first time. How many layers of destructing do you think it is w/o counting?