Trie Data Structure: Efficient Prefix Matching and Autocomplete Implementation
Introduction When building features like search bar autocomplete, spell checkers, or IP routing tables, traditional hash maps and balanced binary se…
Open Source
⚑ Report a ProblemLatest Open Source news from Tech News
All topics
AI
agents
ai
api
architecture
automation
backend
beginners
career
database
devchallenge
devops
discuss
javascript
linux
llm
machinelearning
mcp
opensource
performance
productivity
programming
python
react
security
showdev
testing
tutorial
typescript
webdev
Java 8 Streams vs Traditional Loops: Performance, Readability, and Lazy Evaluation
Introduction Since the introduction of Java 8, developers have faced a recurring architectural dilemma: should collections be processed using tradit…
Topic 13: Shortest Path Algorithms 🚀
Now we move deeper into graphs. The key interview question is: Given a graph, how do I find the minimum-cost path from one node to another? The corr…
Count of Subsets: One Word Changed. Everything Followed.
Chapter 3 ended with a hint. The shift from Knapsack to Subset Sum was a one-word change: max() became or . The structure stayed identical. Only the…
Code and approach to so solve Longest common prefix
class Solution : def longestCommonPrefix ( self , strs : List [ str ]) -> str : Longest_sum = "" for i in range ( len ( strs [ 0 ])): for j in st…
My Code and approach to solve the two sum problem of leetcode
class Solution : def twoSum ( self , nums : List [ int ], target : int ) -> List [ int ]: for i in range ( len ( nums )): for j in range ( len (…
Learn Valid Parentheses, Reverse Linked List, and Tree Max Depth with Step-by-Step Visualization in DSA View View 👀👀
Hoi hoi! I’m @nyaomaru , a frontend engineer who struggles to make game sounds. 😿 Have you used DSA View View already? 👀👀 I Built a Tool to Visualiz…
note taking app with auto sync leetcode and local llm model integration
I built this app over the weekend as a side project. 🛠️ The problem was simple: after I submit on LeetCode, going back and forth to write notes and…
Is Learning DSA Boring? Let's Use DSA View View 👀👀 (Two Sum, Binary Search, and Bubble Sort)
Hoi hoi! I’m @nyaomaru , a frontend engineer who dislikes crowded places, so I'm planning to take a quiet vacation in September. 🏝️ Have you used DS…
Algorithmic Patterns: The Ultimate Guide to Sliding Window
The Sliding Window pattern is one of the most vital algorithmic techniques for optimizing array and string problems. Instead of repeatedly processin…
768. Max Chunks To Make Sorted II
Problem You are given an integer array arr. We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After conc…
The Only Interview Prep Sheet I Actually Finished
Open the NeetCode 150 + Blind 75 tracker Somewhere around problem #40 of "just solving whatever LeetCode recommends," I realized I wasn't actually g…
O(N) Manacher's Algorithm with Mirror Boundary Optimization
Intuition Manacher's Algorithm leverages the symmetry of palindromes to avoid redundant comparisons. Instead of treating odd- and even-length palind…
STL in C++: The Toolbox Every DSA Learner Needs
If you've started learning DSA, you've probably run into the term STL more times than you can count. It sounds intimidating at first — but once it c…
# Why I'm Restarting My DSA Journey (And Documenting Every Step)
Hi, DEV Community! 👋 I'm Khushi, and welcome to the beginning of my Data Structures and Algorithms (DSA) journey—again. You might be wondering, "Why…
Two pointers and sliding window in Java — the pattern that shows up everywhere...
In my last post, I covered arrays and strings and briefly touched on the two-pointer technique while reversing an array. That one example ended up b…
Competitive Programming Series — Session 2: Recursion and Backtracking
After covering the foundational building blocks in Session 1, the next step is one of the most important problem-solving techniques in all of progra…
Competitive Programming Series — Session 1: The Foundations You Need Before Solving Problems
Competitive programming often looks like a race to write code as fast as possible. But the real secret is simpler: the best competitive programmers…
I Built Bit Flip to Make Coding Interview Practice Simpler
TLDR: I'm introducing Bit Flip, a newsletter where you get coding questions and interview questions asked by tech companies delivered to your inbox…
How to actually learn data structures and algorithms
Most people learn data structures and algorithms the hard way: they open a problem site, sort by "most solved," and start grinding. A month later th…
DSA Alone Is No Longer Enough: Why Students Should Learn Beyond Coding Problems
For a long time, the standard advice for computer science students was simple: Learn a programming language, practice Data Structures and Algorithms…
More Than LeetCode
As a third year student attending multiple internship drives and interviews, I started doubting my own worth ,is it all really confined to DSA? Does…
Why Contraint is King
When tackling data structures and algorithms (DSA) problems, whether in technical interviews or competitive programming, engineers often overlook th…
LeetCode Solution: 3. Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating Characters 🟡 Medium Hey Dev.to fam! 👋 Today, we're diving into a LeetCode classic that’s a fantastic introduc…
LeetCode Solution: 1. Two Sum
Your First LeetCode Journey: Conquering 'Two Sum' (Problem 1) with Ease! Hey fellow developers! 👋 Kushalx here, and today we're diving into the abso…
LeetCode Solution: 1752. Check if Array Is Sorted and Rotated
🔄 LeetCode 1752: Can You Un-Rotate This Array? (A Beginner's Guide) Hey there, fellow coders! 👋 Vansh2710 here, ready to demystify another exciting…
Insertion Sort Explained Simply — Algorithm, Code & Examples
Insertion Sort is the algorithm Python's Timsort uses for arrays under 64 elements . Not just a teaching tool — it's in production in the world's mo…
LeetCode Solution: 12. Integer to Roman
Unraveling the Mystery of Roman Numerals: A LeetCode Journey (Problem 12. Integer to Roman) Hey LeetCoders and aspiring developers! 👋 Today, we're t…
Linear Search vs Binary Search — Differences, Code & Complexity
The difference between linear and binary search is the difference between O(n) and O(log n) — which at scale means millions of operations vs 20 . 🔍…
3 and 4 Sum optimized Approach
3 Sum problem(2 pointer approach) Here,I discussed classic problem of both 3 Sum and 4 Sum problem. 3 Sum Problem Problem Statement Find all unique…