From bea9a65b712239974163ffef74bb43533d230120 Mon Sep 17 00:00:00 2001
From: chehak123 <chehakagrawal01@gmail.com>
Date: Thu, 1 Oct 2020 15:45:58 +0530
Subject: [PATCH] added leetcode math question

---
 CodeChef/ FLOW001.cpp        | 18 ----------------
 LeetCode/ugly numbers II.cpp | 40 ++++++++++++++++++++++++++++++++++++
 2 files changed, 40 insertions(+), 18 deletions(-)
 delete mode 100644 CodeChef/ FLOW001.cpp 
 create mode 100644 LeetCode/ugly numbers II.cpp

diff --git a/CodeChef/ FLOW001.cpp  b/CodeChef/ FLOW001.cpp 
deleted file mode 100644
index fba930f..0000000
--- a/CodeChef/ FLOW001.cpp 	
+++ /dev/null
@@ -1,18 +0,0 @@
-/*Link to the question: https://www.codechef.com/problems/FLOW001 */
-
-
-#include<iostream>
-using namespace std;
-int main()
-{
-    int t;
-    cin>>t;
-    int a,b;
-    for(int i=1;i<=t;i++)
-    {
-        cin>>a;
-        cin>>b;
-        cout<<a+b<<endl;
-    }
-    return 0 ;
-}
\ No newline at end of file
diff --git a/LeetCode/ugly numbers II.cpp b/LeetCode/ugly numbers II.cpp
new file mode 100644
index 0000000..4f04456
--- /dev/null
+++ b/LeetCode/ugly numbers II.cpp	
@@ -0,0 +1,40 @@
+// Question link - https://leetcode.com/problems/ugly-number-ii/
+
+class Solution {
+public:
+    int nthUglyNumber(int n) {
+        
+        if(n==0){
+            return 0;
+        }
+        
+        // if(n==1){
+        //     return 1;
+        // }
+        
+        int dp[n];
+        
+        dp[0]=1;
+        
+        int i2=0,i3=0,i5=0;
+        
+        for(int i=1;i<n;i++){
+            // cout<<dp[i-1];
+            dp[i]=min(dp[i2]*2, min(dp[i3]*3,dp[i5]*5));
+            
+            if(dp[i]==dp[i2]*2){
+                i2++;
+            }
+            
+             if(dp[i]==dp[i3]*3){
+                i3++;
+            }
+            
+            if(dp[i]==dp[i5]*5){
+                i5++;
+            }
+        }
+        
+        return dp[n-1]; 
+    }
+};