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

Tag

# #data-structures-and-algorithms

17 posts · 14 followers

[Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Oct 9](https://hashnode.com/posts/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there/6ac9254cb8f25ffd2bd94a31)

### [Maximum Width of a Binary Tree: Counting the Nodes That Aren't There](https://mayankdev.hashnode.dev/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there?utm_source=hashnode&utm_medium=feed)

A BFS story about empty positions, heap-style indexes, and why re-basing keeps your numbers small.

5 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there?utm_source=hashnode&utm_medium=feed)

[Eric](https://hashnode.com/@ericzhou) · [Oct 4](https://hashnode.com/posts/probabilistic-analysis-and-quick-sort-notes/6ac2c38acb7c09e8586c92fa)

### [Probabilistic Analysis and Quick Sort Notes](https://ericzhou.hashnode.dev/probabilistic-analysis-and-quick-sort-notes?utm_source=hashnode&utm_medium=feed)

A step-by-step guide to probabilistic analysis, expected runtime, and Quick Sort with examples and formulas.

7 min read · [ericzhou.hashnode.dev](https://ericzhou.hashnode.dev/probabilistic-analysis-and-quick-sort-notes?utm_source=hashnode&utm_medium=feed)

[Gunjan](https://hashnode.com/@gunjantech) · [Jun 21](https://hashnode.com/posts/my-journey-of-learning-dsa-as-a-first-year-computer-science-student/6a378c9b8c3a554846cc0f2e)

### [My Journey of Learning DSA as a First-Year Computer Science Student](https://gunjantech.hashnode.dev/my-journey-of-learning-dsa-as-a-first-year-computer-science-student?utm_source=hashnode&utm_medium=feed)

A personal story of how I started learning Data Structures and Algorithms using Java, faced challenges on LeetCode, and worked on building consistency as a first-year Computer Science student.

3 min read · [gunjantech.hashnode.dev](https://gunjantech.hashnode.dev/my-journey-of-learning-dsa-as-a-first-year-computer-science-student?utm_source=hashnode&utm_medium=feed)

[Simran Bali](https://hashnode.com/@simranbali-ace04) · [Jun 16](https://hashnode.com/posts/lc-41-first-missing-integer-hard/6a31826a8132161697826237)

### [LC 41. First Missing Integer (Hard)](https://simranbali-dsa.hashnode.dev/lc-41-first-missing-integer-hard?utm_source=hashnode&utm_medium=feed)

Problem Statement Given an unsorted integer array A, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. Example 1 I

6 min read · [simranbali-dsa.hashnode.dev](https://simranbali-dsa.hashnode.dev/lc-41-first-missing-integer-hard?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/lc-41-first-missing-integer-hard/6a31826a8132161697826237)

[Muppidi Srinivas](https://hashnode.com/@srinivas364) · [Feb 23](https://hashnode.com/posts/mastering-fenwick-tree-for-competitive-programming/699bed5e96cb64f7288301aa)

### [Mastering Fenwick Tree for Competitive Programming](https://srinivastechblog.hashnode.dev/mastering-fenwick-tree-for-competitive-programming?utm_source=hashnode&utm_medium=feed)

Crack range queries and updates in O(log n) with this powerful and easy-to-implement data structure.

11 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/mastering-fenwick-tree-for-competitive-programming?utm_source=hashnode&utm_medium=feed)

[Aman Raj](https://hashnode.com/@huamanraj) · [Jan 11](https://hashnode.com/posts/how-to-learn-dsa-fast-without-solving-1000-leetcode-problems/6963a2bd2f28a257f0585754)

### [How to Learn DSA Fast Without Solving 1000 LeetCode Problems](https://blogs.amanraj.me/how-to-learn-dsa-fast-without-solving-1000-leetcode-problems?utm_source=hashnode&utm_medium=feed)

Learn how to master Data Structures and Algorithms faster by focusing on core problem-solving patterns, deep understanding, and repetition

5 min read · [blogs.amanraj.me](https://blogs.amanraj.me/how-to-learn-dsa-fast-without-solving-1000-leetcode-problems?utm_source=hashnode&utm_medium=feed)

[Alok kumar Das](https://hashnode.com/@Kumar-alok25) · [Oct 2, 2025](https://hashnode.com/posts/is-dsa-enough-for-placement/68ded2f681d3e8bd209b7aea)

### [Is Dsa Enough for Placement ?](https://codebyalok24.hashnode.dev/is-dsa-enough-for-placement?utm_source=hashnode&utm_medium=feed)

Discover whether mastering data structures and algorithms alone guarantees placement success—and what extra skills you need to land your dream job.

5 min read · [codebyalok24.hashnode.dev](https://codebyalok24.hashnode.dev/is-dsa-enough-for-placement?utm_source=hashnode&utm_medium=feed)

[Piyush Kumar](https://hashnode.com/@grindwithpiyush) · [May 26, 2025](https://hashnode.com/posts/day-6-of-my-90daysofdsa-challenge-palindromes-and-sliding-windows/68349d93a6d63cd1f1f7491f)

### [🧠 Day 6 of My #90DaysOfDSA Challenge: Palindromes and Sliding Windows!](https://grindwithpiyush.hashnode.dev/day-6-of-my-90daysofdsa-challenge-palindromes-and-sliding-windows?utm_source=hashnode&utm_medium=feed)

Day 6 of Piyush Kumar’s 90 Days of DSA features two classic coding problems—solved efficiently using Python. Perfect for those preparing for coding intervie

2 min read · [grindwithpiyush.hashnode.dev](https://grindwithpiyush.hashnode.dev/day-6-of-my-90daysofdsa-challenge-palindromes-and-sliding-windows?utm_source=hashnode&utm_medium=feed)

[Charan R](https://hashnode.com/@charanravi) · [Apr 8, 2025](https://hashnode.com/posts/valid-anagram--deleted/67f49abcc20796d21f9693af)

### [Valid Anagram](https://blog.charanravi.com/valid-anagram--deleted?utm_source=hashnode&utm_medium=feed)

Check if two strings are anagrams of each other using a hashmap. Returns true or false

1 min read · [blog.charanravi.com](https://blog.charanravi.com/valid-anagram--deleted?utm_source=hashnode&utm_medium=feed)

[Singaraju Saiteja](https://hashnode.com/@singarajusaiteja) · [Mar 5, 2025](https://hashnode.com/posts/enough-data-structures-and-algorithms-to-crack-interviews-in-simple-words/67c8d70b8e70160141838ed9)

### [Enough Data Structures and Algorithms to crack interviews, in simple words](https://singarajusaiteja.hashnode.dev/enough-data-structures-and-algorithms-to-crack-interviews-in-simple-words?utm_source=hashnode&utm_medium=feed)

Think of DSA like your toolbox for problem-solving. You have different tools for different jobs. DSA helps you organize data and solve problems efficiently, especially when dealing with large amounts of data. Why is DSA important for interviews? Pro...

13 min read · [singarajusaiteja.hashnode.dev](https://singarajusaiteja.hashnode.dev/enough-data-structures-and-algorithms-to-crack-interviews-in-simple-words?utm_source=hashnode&utm_medium=feed)
