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

Tag

# #deletion

15 posts · 0 followers

[ahmed isam](https://hashnode.com/@xiaoxiao2026) · [Sep 12](https://hashnode.com/posts/deletion-failed-rate-limits-retries-and-refunds-answered/6aa4b28f926d98642a2e03e6)

### [Deletion Failed? Rate Limits, Retries and Refunds, Answered](https://xiaoxiao2026.hashnode.dev/deletion-failed-rate-limits-retries-and-refunds-answered?utm_source=hashnode&utm_medium=feed)

Deletion runs fail in a handful of ways and the fix depends on which one you hit. The five questions that come up most, with the signal to check first.

2 min read · [xiaoxiao2026.hashnode.dev](https://xiaoxiao2026.hashnode.dev/deletion-failed-rate-limits-retries-and-refunds-answered?utm_source=hashnode&utm_medium=feed)

[Ganesh Rama Hegde](https://hashnode.com/@hegde10122) · [Nov 12, 2025](https://hashnode.com/posts/chapter-26-testing-the-insert-and-delete-use-cases/6914ad0fdba6e4e0b9869f5b)

### [Chapter 26 - Testing the Insert and Delete Use Cases](https://androidavatar.hashnode.dev/chapter-26-testing-the-insert-and-delete-use-cases?utm_source=hashnode&utm_medium=feed)

Since InsertArtUseCase and DeleteArtUseCase are pure domain logic, they’re easy to test — no Android dependencies, just Kotlin coroutines and a fake repository. Let’s write clear, minimal, and clean unit tests using JUnit + Kotlin coroutines test. We...

2 min read · [androidavatar.hashnode.dev](https://androidavatar.hashnode.dev/chapter-26-testing-the-insert-and-delete-use-cases?utm_source=hashnode&utm_medium=feed)

[Ganesh Rama Hegde](https://hashnode.com/@hegde10122) · [Nov 9, 2025](https://hashnode.com/posts/chapter-21-coding-the-data-layer-for-the-insertartusecase-and-deleteartusecase/6910d10104625d3051fc0f6a)

### [Chapter 21 - Coding the Data layer for the InsertArtUseCase and DeleteArtUseCase](https://androidavatar.hashnode.dev/chapter-21-coding-the-data-layer-for-the-insertartusecase-and-deleteartusecase?utm_source=hashnode&utm_medium=feed)

Here we implement the repository implementation class @Singleton class ArtRepositoryImpl @Inject constructor(private val artDao: ArtDao, private val imageApi:ImageApi, ...

1 min read · [androidavatar.hashnode.dev](https://androidavatar.hashnode.dev/chapter-21-coding-the-data-layer-for-the-insertartusecase-and-deleteartusecase?utm_source=hashnode&utm_medium=feed)

[Muskan Agrawal](https://hashnode.com/@muskan-agrawal) · [Aug 29, 2025](https://hashnode.com/posts/how-kubernetes-manages-pods-in-statefulsets-creation-deletion-and-updates/68b1e1b8cc1e63b99dab1eb8)

### [How Kubernetes Manages Pods in StatefulSets: Creation, Deletion, and Updates](https://muskanagrawal.hashnode.dev/how-kubernetes-manages-pods-in-statefulsets-creation-deletion-and-updates?utm_source=hashnode&utm_medium=feed)

A Clear Guide to Understanding StatefulSet Pod Lifecycle and Update Strategies in Kubernetes

3 min read · [muskanagrawal.hashnode.dev](https://muskanagrawal.hashnode.dev/how-kubernetes-manages-pods-in-statefulsets-creation-deletion-and-updates?utm_source=hashnode&utm_medium=feed)

[Divya Vetriveeran](https://hashnode.com/@CSTales) · [Aug 10, 2025](https://hashnode.com/posts/deleting-the-nth-node-from-the-end-of-a-list/6898c6838e742869c0c1c9c4)

### [Deleting the Nth Node from the End of a List](https://cstales.hashnode.dev/deleting-the-nth-node-from-the-end-of-a-list?utm_source=hashnode&utm_medium=feed)

Learn how to efficiently remove the nth node from the end of a linked list using the two-pointer technique

6 min read · [cstales.hashnode.dev](https://cstales.hashnode.dev/deleting-the-nth-node-from-the-end-of-a-list?utm_source=hashnode&utm_medium=feed)

[고라니드로](https://hashnode.com/@koranidro) · [Feb 22, 2025](https://hashnode.com/posts/array-data-structure-4/67ba06d14982c03aa2cdcfbc)

### [\[TypeScript\] 자료 구조로 담아내기. #4 - 배열(with. 시프트)](https://koranidro.hashnode.dev/array-data-structure-4?utm_source=hashnode&utm_medium=feed)

이번 편은 이전 편으로부터 이어집니다. 삽입과 삭제를 수행할 때는 일정 구간을 밀어내거나 당겨오게 됩니다. 이러한 연산을 일반적으로 시프트라 부릅니다. 왼쪽 시프트 function shl(mem: any\[\], l: number, r: number): void { for(let i = l; i <= r; i++) { mem\[i - 1\] = mem\[i\]; } } 왼쪽 시프트는 지정된 메모리 mem 중 l과 r로 지정된 범위를 왼쪽으로 한...

2 min read · [koranidro.hashnode.dev](https://koranidro.hashnode.dev/array-data-structure-4?utm_source=hashnode&utm_medium=feed)

[Sushil Kumar Mishra](https://hashnode.com/@Sushil2k4) · [Aug 11, 2024](https://hashnode.com/posts/step-by-step-guide-to-array-based-linked-list-implementation/66b9356e443e429d5493ad2d)

### [Step-by-Step Guide to Linked List Implementation](https://sushilsblog.hashnode.dev/step-by-step-guide-to-array-based-linked-list-implementation?utm_source=hashnode&utm_medium=feed)

Guide on implementing array-based linked lists in C: create, insert, delete, display for efficient data management

6 min read · [sushilsblog.hashnode.dev](https://sushilsblog.hashnode.dev/step-by-step-guide-to-array-based-linked-list-implementation?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Jul 28, 2024](https://hashnode.com/posts/ll-3-doubly-linked-list/66a619a79b21fff6237671ac)

### [LL 3 - Doubly Linked List](https://chetan77.hashnode.dev/ll-3-doubly-linked-list?utm_source=hashnode&utm_medium=feed)

Construction of Doubly Linked List public static Node constructDll(int arr\[\]){ Node head = new Node(0); Node temp = head; for (int num: arr){ Node newNode = new Node(num); temp.next = newNode; newNode.prev = temp;...

3 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/ll-3-doubly-linked-list?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Jul 27, 2024](https://hashnode.com/posts/ll-1-single-linked-list/66a4db16a9d2be0dd0b40c09)

### [LL 1 - Single Linked List](https://chetan77.hashnode.dev/ll-1-single-linked-list?utm_source=hashnode&utm_medium=feed)

Construction of Linked List Input: n = 5 arr = \[1,2,3,4,5\] Output: 1 2 3 4 5 Explanation: Linked list for the given array will be 1->2->3->4->5 Here, the head points to a dummy which doesn't store anything. Later, when we return the new head pointer...

3 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/ll-1-single-linked-list?utm_source=hashnode&utm_medium=feed)

[Mahira Technology Private Limited](https://hashnode.com/@mahiratechnology) · [Jul 15, 2024](https://hashnode.com/posts/simplify-your-git-management-automate-merged-branch-deletion-in-github-with-python/669582d70b9b3f82aca4f7b0)

### [Simplify Your Git Management: Automate Merged Branch Deletion in GitHub with Python](https://mahiratechnology.com//simplify-your-git-management-automate-merged-branch-deletion-in-github-with-python?utm_source=hashnode&utm_medium=feed)

Overview :- Managing branches in Git can quickly become overwhelming, especially in active projects with multiple contributors. After merging branches, cleaning up the old ones can be tedious and often forgotten. Automating this process not only keep...

3 min read · [mahiratechnology.com](https://mahiratechnology.com//simplify-your-git-management-automate-merged-branch-deletion-in-github-with-python?utm_source=hashnode&utm_medium=feed)
