Explicit code is always better
A thesis on why magic abstractions are harmful to codebases and teams.
30 seconds of code contains a curated collection of code articles covering a wide range of development needs. The collection spans many topics, ranging from simple coding problems to theoretical concepts and development techniques.
A thesis on why magic abstractions are harmful to codebases and teams.
A short summary of your story up to 140 characters long.
Have you tried solving "Best Time to Buy and Sell Stock" on LeetCode? Let's take a couple of approaches to tackle it in JavaScript.
Infinite flexibility in your tech stack can lead to refactoring headaches and technical debt. Here's how to avoid the trap.
The new Speculation Rules API aims to deliver across the board performance optimizations with little developer effort. Let's see how!
Pair programming can be valuable for junior and senior developers alike, fostering collaboration and knowledge sharing.
Keep your code, data, and users safe by following these simple tips to secure your JavaScript projects from vulnerable dependencies.
Have you ever encountered an issue with incorrect line endings in your git repository? Let's fix it!
Writing great code is more than writing code that works, requiring discipline and a focus on testability, maintainability, and readability.
What's the connection between meditation and debugging? Let's find out.
Explore how to solve Sudoku puzzles in JavaScript using the wave function collapse algorithm, a constraint-propagation technique.
No code tools? No code at all? No code you write? Prepare for a triple entendre that cuts deep into the world of software development.
How staying on the frontend can limit your career growth and a hot take on how to escape it.
Learn how to deep clone objects in JavaScript using structuredClone, and how it compares to other cloning methods.
Using the degree of nodes, we can employ a very efficient algorithmic trick to find the minimum height tree in an undirected tree in JavaScript.
Using a two-pass DFS approach, we can efficiently find the diameter of an undirected tree in JavaScript.
Learn how to apply bipartite coloring to an undirected tree in JavaScript, ensuring that no two adjacent nodes share the same color.
Learn how to traverse an undirected tree using Depth-First Search (DFS) or Breadth-First Search (BFS) in JavaScript.
Learn how to build an undirected tree from an array of edges in JavaScript, with various approaches for storing node relationships.
Binary numbers are a fundamental part of computer science. Learn how to convert between binary and decimal numbers in JavaScript.
A historical run-through of how 30 seconds of code was deployed then and now.
Using indexes can speed up querying object collections significantly, but it seems like a black box for many. Let's dive in!
While a brute-force longest palindrome finder is simple, it is not efficient. Let's explore a more efficient solution.
Combining techniques presented in the past, we can solve a more complex problem with stellar performance.