🔢 Day 30

Author: AkashRajpurohit

README.md

@@ -48,6 +48,7 @@
 ## Week 5 🚧
 
 1. [Maximize Distance to Closest Person](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3512/) ➡️ [CPP Solution](Week5/maxDistToClosest.cpp)
+2. [Number of Longest Increasing Subsequence](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3513/) ➡️ [CPP Solution](Week5/findNumberOfLIS.cpp)
 
 ## Other Challenges 💪
 

Week5/findNumberOfLIS.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    int findNumberOfLIS(vector<int>& nums) {
+        int n = nums.size();
+        if(n <= 1) return n;
+        
+        vector<int> dp(n, 1);
+        vector<int> count(n, 1);
+        
+        for(int i = 1; i < n; ++i) {
+            for(int j = 0; j < i; ++j) {
+                if(nums[i] > nums[j]) {
+                    if(dp[j] + 1 > dp[i]) {
+                        dp[i] = dp[j] + 1;
+                        count[i] = count[j];   
+                    } else if(dp[j] + 1 == dp[i]) {
+                        count[i] += count[j];
+                    }
+                }
+            }
+        }
+        
+        int lis = *max_element(dp.begin(), dp.end());
+        int numLis = 0;
+        
+        for(int i = 0; i < n; ++i) {
+            if(dp[i] == lis) {
+                numLis += count[i];
+            }
+        }
+        
+        return numLis;
+    }
+};