Daily Dose of DSA - Day 13

Question link: https://leetcode.com/problems/next-permutation/ Approach : Step 1: Linearly traverse array from backward such that ith index value of the array is less than (i+1)th index value. Store that index in a variable. Step 2: If the index valu...