---
title: "Discussion on \"Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists\" | Hashnode"
description: "Discussion on \"Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists\". Leetcode 62 – Unique Paths\nProblem: From top-left of an m x n grid, reach the bottom-right using only right/down moves.\n\n1. Brute Force (Recursion)\nIntuition: Try all paths recursively.\nint count(int i, int j, int m, int n) {\n    if (i >= m || j >= n..."
url: "https://hashnode.com/posts/day-15-unique-paths-reverse-pairs-longest-substring-without-repeating-characters-and-starting-linked-lists/687c9657ff26bf47bace94b2"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [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...

Jul 20, 2025 · 5 min read · sids-dsa-journal.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#cpp](https://hashnode.com/tag/cpp)

## Written by

[Siddharth Gandhi](https://hashnode.com/@SidGandhiCodes)

@SidGandhiCodes

  
[View profile](https://hashnode.com/@SidGandhiCodes)

Learning. Building. Blogging. Repeat.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
