Search for a command to run...
Series
Just a daily log of my DSA practice—problems I solve, things I learn, and mistakes I make. Mostly for my own tracking, but if you find it useful or interesting, you're more than welcome to follow along!
Fibonacci Series Problem LinkArticlesSolutions Climbing StairsGithub Fibonacci Series Min Cost Climbing Stairs Kadane’s Algorithm Problem LinkArticlesSolutions Maximum SubarrayGithub Maximum Sum Circular Subarray Maximum Product S...
Problem Link Summary Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Test cases: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Input: nums = [0...
Pattern 1: Fast and Slow Pointers Problem LinkArticlesSolution Linked List CycleGithub Happy NumberGithub Find the duplicate number Pattern 2: Sliding Window Problem LinkArticlesSolution Maximum Average SubarrayGithub Longest Subst...