DEV Community

Algorithms

Heap, Binary Tree, Data Structure it doesn't matter. This tag should be used for anything Algorithm & Data Structure focused.

Posts

👋 Sign in for the ability to sort posts by relevant, latest, or top.
2109. Adding Spaces to a String

2109. Adding Spaces to a String

Comments
3 min read
LeetCode Meditations: Insert Interval

LeetCode Meditations: Insert Interval

Comments
3 min read
TIL: How to Trim Trailing Zeros【CodeWars】

TIL: How to Trim Trailing Zeros【CodeWars】

2
Comments
1 min read
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence

1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence

Comments
3 min read
LeetCode Meditations — Chapter 13: Intervals

LeetCode Meditations — Chapter 13: Intervals

Comments
1 min read
From Data to Decisions: Understanding Machine Learning AlgorithmsđŸ’»

From Data to Decisions: Understanding Machine Learning AlgorithmsđŸ’»

Comments
4 min read
LeetCode Meditations: Longest Increasing Subsequence

LeetCode Meditations: Longest Increasing Subsequence

Comments
2 min read
1346. Check If N and Its Double Exist

1346. Check If N and Its Double Exist

Comments
3 min read
2097. Valid Arrangement of Pairs

2097. Valid Arrangement of Pairs

Comments
4 min read
2577. Minimum Time to Visit a Cell In a Grid

2577. Minimum Time to Visit a Cell In a Grid

Comments
4 min read
Demystifying Algorithms: Circular Linked Lists

Demystifying Algorithms: Circular Linked Lists

Comments
4 min read
Demystifying Algorithms: Doubly Linked Lists

Demystifying Algorithms: Doubly Linked Lists

Comments
4 min read
Demystifying Algorithms: Singly Linked Lists

Demystifying Algorithms: Singly Linked Lists

Comments
3 min read
2290. Minimum Obstacle Removal to Reach Corner

2290. Minimum Obstacle Removal to Reach Corner

Comments
4 min read
Bank Business Strategy Optimization

Bank Business Strategy Optimization

5
Comments 1
4 min read
3243. Shortest Distance After Road Addition Queries I

3243. Shortest Distance After Road Addition Queries I

Comments
5 min read
2924. Find Champion II

2924. Find Champion II

Comments
4 min read
LeetCode Meditations: Word Break

LeetCode Meditations: Word Break

Comments
3 min read
Demystifying Algorithms: Merging Sorted Singly Linked Lists

Demystifying Algorithms: Merging Sorted Singly Linked Lists

Comments
4 min read
Algorithms Unveiled: Essential Learning Resources for Programmers

Algorithms Unveiled: Essential Learning Resources for Programmers

Comments
3 min read
773. Sliding Puzzle

773. Sliding Puzzle

Comments
4 min read
Demystifying Algorithms: Rabin-Karp

Demystifying Algorithms: Rabin-Karp

Comments
4 min read
Scaling AI Computing with Ray: Large-Scale Implementation and Optimization

Scaling AI Computing with Ray: Large-Scale Implementation and Optimization

Comments
7 min read
1861. Rotating the Box

1861. Rotating the Box

Comments
3 min read
Backtracking Demystified: Solving Mazes, N-Queens, and Hamiltonian Circuits

Backtracking Demystified: Solving Mazes, N-Queens, and Hamiltonian Circuits

1
Comments 1
2 min read
Mastering the Maze: How Run-in-the-Maze Algorithms Solve Complex Problem

Mastering the Maze: How Run-in-the-Maze Algorithms Solve Complex Problem

Comments
3 min read
Finding the Way: Backtracking Algorithm for Rat in a Maze

Finding the Way: Backtracking Algorithm for Rat in a Maze

Comments 1
3 min read
Set STL in CPP 👹‍🎓

Set STL in CPP 👹‍🎓

Comments
1 min read
1072. Flip Columns For Maximum Number of Equal Rows

1072. Flip Columns For Maximum Number of Equal Rows

Comments
3 min read
"Mastering the N-Queen Problem: Solving Complex Puzzles with Backtracking"

"Mastering the N-Queen Problem: Solving Complex Puzzles with Backtracking"

Comments 1
3 min read
Backtracking Unleashed: Cracking Mazes, Queens, and Circuits

Backtracking Unleashed: Cracking Mazes, Queens, and Circuits

3
Comments 2
3 min read
The N Queens Problem ♟: A Game-Changer for Scheduling and Resource Optimization

The N Queens Problem ♟: A Game-Changer for Scheduling and Resource Optimization

2
Comments 1
5 min read
Navigating the Maze: How Backtracking Algorithms Solve Complex Problems

Navigating the Maze: How Backtracking Algorithms Solve Complex Problems

1
Comments 1
3 min read
2257. Count Unguarded Cells in the Grid

2257. Count Unguarded Cells in the Grid

Comments
4 min read
Demystifying Algorithms: Modular Indexing

Demystifying Algorithms: Modular Indexing

Comments
4 min read
Why Read/Write in Hash Maps Has O(1) Time Complexityâ‰ïžđŸš€

Why Read/Write in Hash Maps Has O(1) Time Complexityâ‰ïžđŸš€

Comments
3 min read
2516. Take K of Each Character From Left and Right

2516. Take K of Each Character From Left and Right

Comments
4 min read
10 Common Machine Learning Algorithms You Should Understand in 2024-25

10 Common Machine Learning Algorithms You Should Understand in 2024-25

Comments
5 min read
2461. Maximum Sum of Distinct Subarrays With Length K

2461. Maximum Sum of Distinct Subarrays With Length K

Comments
4 min read
I Make Golang library gocurrency

I Make Golang library gocurrency

Comments
1 min read
1652. Defuse the Bomb

1652. Defuse the Bomb

Comments
3 min read
Historian Hysteria

Historian Hysteria

1
Comments
3 min read
Insertion Sort

Insertion Sort

Comments
2 min read
Selection Sorts

Selection Sorts

Comments
2 min read
862. Shortest Subarray with Sum at Least K

862. Shortest Subarray with Sum at Least K

Comments
3 min read
3254. Find the Power of K-Size Subarrays I

3254. Find the Power of K-Size Subarrays I

Comments
4 min read
Demystifying Algorithms: Two Pointers

Demystifying Algorithms: Two Pointers

Comments
4 min read
Demystifying Algorithms: Brute Force

Demystifying Algorithms: Brute Force

Comments
4 min read
1574. Shortest Subarray to be Removed to Make Array Sorted

1574. Shortest Subarray to be Removed to Make Array Sorted

Comments
3 min read
I Made My Own Standard Template Library

I Made My Own Standard Template Library

Comments
16 min read
2563. Count the Number of Fair Pairs

2563. Count the Number of Fair Pairs

Comments
3 min read
Advent of Code 2024

Advent of Code 2024

1
Comments 2
3 min read
Comparative Benchmarking: ILP, A*, and Branch and Bound Algorithms in High-Throughput Scenarios

Comparative Benchmarking: ILP, A*, and Branch and Bound Algorithms in High-Throughput Scenarios

Comments
8 min read
Navigating the Directed Maze: Finding the Minimum Spanning Tree

Navigating the Directed Maze: Finding the Minimum Spanning Tree

Comments
3 min read
2914. Minimum Number of Changes to Make Binary String Beautiful

2914. Minimum Number of Changes to Make Binary String Beautiful

Comments
3 min read
Mastering Binary Search in JavaScript and Java: A Step-by-Step Guide

Mastering Binary Search in JavaScript and Java: A Step-by-Step Guide

Comments
5 min read
Conceptual Framework for Token Stream Analysis using Dual-level Exponential Rolling Average Centroids

Conceptual Framework for Token Stream Analysis using Dual-level Exponential Rolling Average Centroids

Comments
6 min read
1-D Prefix Sum

1-D Prefix Sum

Comments
2 min read
Demystifying Big O Notation.

Demystifying Big O Notation.

Comments
4 min read
Free Algorithms Learning Resources: A Comprehensive Guide for Aspiring Developers

Free Algorithms Learning Resources: A Comprehensive Guide for Aspiring Developers

4
Comments
3 min read
loading...