Discussion on "Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists"

Siddharth Gandhi · 2025-07-20T07:10:15.296Z

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

Discussion on "Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists" | Hashnode

Search Hashnode

Day 15 – Unique Paths, Reverse Pairs, Longest Substring Without Repeating Characters, and Starting Linked Lists

Responses