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.
Tracking Furthest Enemy in a Tower Defence Game using Max Heap

Tracking Furthest Enemy in a Tower Defence Game using Max Heap

Comments
7 min read
Why is Hamiltonian graph?

Why is Hamiltonian graph?

Comments
2 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
I Make Golang library

I Make Golang library

Comments
1 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
Math + Python = Love

Math + Python = Love

1
Comments
1 min read
Set STL in CPP 👨‍🎓

Set STL in CPP 👨‍🎓

Comments
1 min read
Secure transfer

Secure transfer

Comments
2 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
Demystifying Algorithms: Sliding Window

Demystifying Algorithms: Sliding Window

Comments
4 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
1652. Defuse the Bomb

1652. Defuse the Bomb

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
Floyd's Tortoise and Hare Algorithm

Floyd's Tortoise and Hare Algorithm

2
Comments
2 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
Hanoi Tower with procs

Hanoi Tower with procs

1
Comments
2 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
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
Thread Concurrency In Java

Thread Concurrency In Java

Comments
2 min read
Mastering Algorithms: Essential Concepts Every Computer Engineering Student Should Know

Mastering Algorithms: Essential Concepts Every Computer Engineering Student Should Know

1
Comments
3 min read
Mastering Algorithms: Unlock the Power of Data Structures and Numerical Computing

Mastering Algorithms: Unlock the Power of Data Structures and Numerical Computing

Comments
3 min read
2070. Most Beautiful Item for Each Query

2070. Most Beautiful Item for Each Query

Comments
4 min read
How does Cognitive Science influence knowledge Representation in AI?

How does Cognitive Science influence knowledge Representation in AI?

2
Comments
4 min read
Algorithm for compressing numbers to Base64

Algorithm for compressing numbers to Base64

Comments
2 min read
Entendendo RecursĂŁo em Python: E aĂ­, vai encarar?

Entendendo RecursĂŁo em Python: E aĂ­, vai encarar?

Comments
2 min read
Big O notation

Big O notation

1
Comments
1 min read
The Secret to Fast Typing on the Game Boy: Here’s How I Did It!

The Secret to Fast Typing on the Game Boy: Here’s How I Did It!

Comments
6 min read
2641. Cousins in Binary Tree II

2641. Cousins in Binary Tree II

Comments
5 min read
Understanding Polish Notation

Understanding Polish Notation

Comments
7 min read
3163. String Compression III

3163. String Compression III

Comments
3 min read
1106. Parsing A Boolean Expression

1106. Parsing A Boolean Expression

Comments
4 min read
1545. Find Kth Bit in Nth Binary String

1545. Find Kth Bit in Nth Binary String

Comments
4 min read
Learn Big O Notation once and for all

Learn Big O Notation once and for all

137
Comments 12
8 min read
3097. Shortest Subarray With OR at Least K II

3097. Shortest Subarray With OR at Least K II

1
Comments
4 min read
670. Maximum Swap

670. Maximum Swap

Comments
2 min read
👑Kichik Shahzoda

👑Kichik Shahzoda

Comments
1 min read
loading...