---
title: "Siddharth Gandhi (@SidGandhiCodes) | Hashnode"
description: "Learning. Building. Blogging. Repeat. Read the latest articles by Siddharth Gandhi on Hashnode."
url: "https://hashnode.com/@SidGandhiCodes"
---

@SidGandhiCodes

# Siddharth Gandhi

@SidGandhiCodes · Joined June 2025

Learning. Building. Blogging. Repeat.

### [Day 19 – Recursion, Backtracking, and Math Logic](https://sids-dsa-journal.hashnode.dev/day-19-recursion-backtracking-and-math-logic?utm_source=hashnode&utm_medium=feed)

1\. Subset Sum (Leetcode 78: Subsets) Problem: Return all possible subsets (the power set) of a given array of distinct integers. Intuition: At each index, we have two choices: include or exclude the current element. void solve(int i, vector<int>& num...

4 min read · [sids-dsa-journal.hashnode.dev](https://sids-dsa-journal.hashnode.dev/day-19-recursion-backtracking-and-math-logic?utm_source=hashnode&utm_medium=feed)

[Jul 26, 2025](https://hashnode.com/posts/day-19-recursion-backtracking-and-math-logic/68848b5e0c3ffc1541446b1a)

### [Day 18 – Greedy Algorithms](https://sids-dsa-journal.hashnode.dev/day-18-greedy-algorithms?utm_source=hashnode&utm_medium=feed)

1\. N Meetings in One Room Problem: Given start\[\] and end\[\] times of meetings, find the maximum number of meetings that can be held in one room where only one meeting can happen at a time. Intuition: Sort meetings by end time. Always pick the meeting ...

4 min read · [sids-dsa-journal.hashnode.dev](https://sids-dsa-journal.hashnode.dev/day-18-greedy-algorithms?utm_source=hashnode&utm_medium=feed)

[Jul 22, 2025](https://hashnode.com/posts/day-18-greedy-algorithms/687f072a61be54e0bb0fcfc4)

### [Day 17 – Advanced Linked Lists + Trapping Rainwater](https://sids-dsa-journal.hashnode.dev/day-17-advanced-linked-lists-trapping-rainwater?utm_source=hashnode&utm_medium=feed)

Leetcode 237. Delete Node in a Linked List Intuition: You’re given access to the node itself, not the head. Copy data from next node, then delete the next node. void deleteNode(ListNode\* node) { node->val = node->next->val; node->next = node-...

6 min read · [sids-dsa-journal.hashnode.dev](https://sids-dsa-journal.hashnode.dev/day-17-advanced-linked-lists-trapping-rainwater?utm_source=hashnode&utm_medium=feed)

[Jul 21, 2025](https://hashnode.com/posts/day-17-advanced-linked-lists-trapping-rainwater/687e871cde7536bd781f40de)

### [Day 16 – Linked List Insertions, Reversal, Midpoint, Merge, Nth Deletion, and Addition](https://sids-dsa-journal.hashnode.dev/day-16-linked-list-insertions-reversal-midpoint-merge-nth-deletion-and-addition?utm_source=hashnode&utm_medium=feed)

Insert Node at Head Intuition: Create a new node, point it to the current head, and update the head. Node\* insertAtHead(Node\* head, int val) { Node\* newNode = new Node(val); newNode->next = head; return newNode; } // TC: O(1) // SC: O(1) ...

4 min read · [sids-dsa-journal.hashnode.dev](https://sids-dsa-journal.hashnode.dev/day-16-linked-list-insertions-reversal-midpoint-merge-nth-deletion-and-addition?utm_source=hashnode&utm_medium=feed)

[Jul 21, 2025](https://hashnode.com/posts/day-16-linked-list-insertions-reversal-midpoint-merge-nth-deletion-and-addition/687e77c9eb5446d01d600df4)

### [Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists](https://sids-dsa-journal.hashnode.dev/day-15-unique-paths-reverse-pairs-longest-substring-without-repeating-characters-and-starting-linked-lists?utm_source=hashnode&utm_medium=feed)

Leetcode 62 – Unique Paths Problem: From top-left of an m x n grid, reach the bottom-right using only right/down moves. 1. Brute Force (Recursion) Intuition: Try all paths recursively. int count(int i, int j, int m, int n) { if (i >= m || j >= n...

5 min read · [sids-dsa-journal.hashnode.dev](https://sids-dsa-journal.hashnode.dev/day-15-unique-paths-reverse-pairs-longest-substring-without-repeating-characters-and-starting-linked-lists?utm_source=hashnode&utm_medium=feed)

[Jul 20, 2025](https://hashnode.com/posts/day-15-unique-paths-reverse-pairs-longest-substring-without-repeating-characters-and-starting-linked-lists/687c9657ff26bf47bace94b2)
