---
title: "#dsainrust articles | Hashnode"
description: "Explore 13 articles tagged #dsainrust on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/dsainrust"
---

Tag

# #dsainrust

13 posts · 0 followers

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 15](https://hashnode.com/posts/cracking-the-grid-maximizing-square-holes-in-a-grid/6968f610bdd98cb29c8be0f4)

### [Cracking the Grid: Maximizing Square Holes in a Grid](https://mahmudsudo.hashnode.dev/cracking-the-grid-maximizing-square-holes-in-a-grid?utm_source=hashnode&utm_medium=feed)

Discover how to create the largest square opening in a grid by strategically removing bars, using a geometric coding challenge

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/cracking-the-grid-maximizing-square-holes-in-a-grid?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 13](https://hashnode.com/posts/finding-the-balance-solving-the-median-horizontal-line-problem/69665fc6128c9b7b8d2cde43)

### [Finding the Balance: Solving the median Horizontal Line Problem](https://mahmudsudo.hashnode.dev/finding-the-balance-solving-the-median-horizontal-line-problem?utm_source=hashnode&utm_medium=feed)

Solve the median Horizontal Line Problem using Rust with binary search for efficient area distribution of overlapping squares

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/finding-the-balance-solving-the-median-horizontal-line-problem?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 12](https://hashnode.com/posts/efficient-pathfinding-solving-the-minimum-time-visiting-all-points-problem-in-rust/696529f1727a3c91a59cd1b4)

### [Efficient Pathfinding: Solving the Minimum Time Visiting All Points Problem in Rust](https://mahmudsudo.hashnode.dev/efficient-pathfinding-solving-the-minimum-time-visiting-all-points-problem-in-rust?utm_source=hashnode&utm_medium=feed)

Efficient pathfinding with Chebyshev Distance in Rust for time-optimized point visiting, featuring implementation and insights

2 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/efficient-pathfinding-solving-the-minimum-time-visiting-all-points-problem-in-rust?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 11](https://hashnode.com/posts/maximal-rectangle-in-rust/6963bb9e0f4aef17de04c582)

### [Maximal Rectangle in rust](https://mahmudsudo.hashnode.dev/maximal-rectangle-in-rust?utm_source=hashnode&utm_medium=feed)

Learn how to find the largest rectangle of 1s in a binary matrix using Rust, leveraging histograms and monotonic stack for efficient solutions

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/maximal-rectangle-in-rust?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 10](https://hashnode.com/posts/minimum-ascii-delete-sum-for-two-strings-in-rust/69626858b51a4c7230637edd)

### [Minimum ASCII Delete Sum for Two Strings in Rust](https://mahmudsudo.hashnode.dev/minimum-ascii-delete-sum-for-two-strings-in-rust?utm_source=hashnode&utm_medium=feed)

Learn to solve the Minimum ASCII Delete Sum problem in Rust using dynamic programming with detailed examples and Rust implementation

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/minimum-ascii-delete-sum-for-two-strings-in-rust?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 9](https://hashnode.com/posts/finding-the-smallest-subtree-containing-all-deepest-nodes/6960d0abe179a29cc29eec7c)

### [Finding the Smallest Subtree Containing All Deepest Nodes](https://mahmudsudo.hashnode.dev/finding-the-smallest-subtree-containing-all-deepest-nodes?utm_source=hashnode&utm_medium=feed)

Discover how to find the smallest subtree containing all deepest nodes in a binary tree using a Rust implementation

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/finding-the-smallest-subtree-containing-all-deepest-nodes?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 8](https://hashnode.com/posts/mastering-subsequence-alignment-max-dot-product-of-two-subsequences/695f96829e73d1344ba4a08b)

### [Mastering Subsequence Alignment: Max Dot Product of Two Subsequences](https://mahmudsudo.hashnode.dev/mastering-subsequence-alignment-max-dot-product-of-two-subsequences?utm_source=hashnode&utm_medium=feed)

Solve Max Dot Product of Two Subsequences using dynamic programming and Rust optimization, efficiently handling negatives to maximize the product

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/mastering-subsequence-alignment-max-dot-product-of-two-subsequences?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 7](https://hashnode.com/posts/maximizing-the-split-solving-the-maximum-product-of-splitted-binary-tree/695e32bf103b9039ae3e71b8)

### [Maximizing the Split: Solving the Maximum Product of Splitted Binary Tree](https://mahmudsudo.hashnode.dev/maximizing-the-split-solving-the-maximum-product-of-splitted-binary-tree?utm_source=hashnode&utm_medium=feed)

Solve the Maximum Product of a Splitted Binary Tree problem with two-pass DFS for efficient implementation

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/maximizing-the-split-solving-the-maximum-product-of-splitted-binary-tree?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 6](https://hashnode.com/posts/swapping-nodes-in-pairs-a-rust-adventure-with-linked-lists/695c544022c1271210359ef1)

### [Swapping Nodes in Pairs: A Rust Adventure with Linked Lists](https://mahmudsudo.hashnode.dev/swapping-nodes-in-pairs-a-rust-adventure-with-linked-lists?utm_source=hashnode&utm_medium=feed)

Explore swapping nodes in pairs using Rust's recursion and iteration. Learn ownership, borrowing, and elegant solutions for linked list challenges

5 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/swapping-nodes-in-pairs-a-rust-adventure-with-linked-lists?utm_source=hashnode&utm_medium=feed)

[Bello Mahmud](https://hashnode.com/@Mahmudsudo) · [Jan 5](https://hashnode.com/posts/mastering-the-merge-k-sorted-lists-problem-in-rust/695b1de41d84cc031ea37def)

### [Mastering the Merge K Sorted Lists Problem in Rust 🦀](https://mahmudsudo.hashnode.dev/mastering-the-merge-k-sorted-lists-problem-in-rust?utm_source=hashnode&utm_medium=feed)

Learn how to master the Merge K Sorted Lists problem in Rust, optimizing with a Min-Heap and tackling memory management effectively

3 min read · [mahmudsudo.hashnode.dev](https://mahmudsudo.hashnode.dev/mastering-the-merge-k-sorted-lists-problem-in-rust?utm_source=hashnode&utm_medium=feed)
