From deb65633ced4a8d96488e9b5d9d8b09c6a3a6ed6 Mon Sep 17 00:00:00 2001
From: chayan das <dasshuvo817@gmail.com>
Date: Wed, 24 Sep 2025 00:00:17 +0530
Subject: [PATCH] Create 165. Compare Version Numbers

---
 165. Compare Version Numbers | 60 ++++++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 165. Compare Version Numbers

diff --git a/165. Compare Version Numbers b/165. Compare Version Numbers
new file mode 100644
index 0000000..2d37f97
--- /dev/null
+++ b/165. Compare Version Numbers	
@@ -0,0 +1,60 @@
+class Solution {
+public:
+    int conv(string s) //convert a string to number
+    {
+        int ans=0;
+        for(int i=0;i<s.size();i++)
+        {
+            int num = s[i]-'0';
+            ans*=10;
+            ans+=num;
+        }
+        return ans;
+    }
+    vector<int> solve(string s)
+    {
+        s+=".";   //add dot at end since we are getting revision by finding str between 2 dots
+        int n = s.size();
+        vector<int> ans;
+        string str = "";
+        
+        
+        for(int i=0;i<n;i++){
+            if(s[i]=='.') //once we get a dot
+            {
+                int num = conv(str);  //convert str to num
+                ans.push_back(num);
+                str=""; //reset str
+            }
+            else{
+                str+=s[i];
+            }
+        }
+
+        return ans;
+
+    }
+    int compareVersion(string version1, string version2) {
+
+        vector<int> v1 = solve(version1);
+        vector<int> v2 = solve(version2);
+
+        int n = v1.size();
+        int m = v2.size();
+
+        if(n<m){
+            for(int i=1;i<=(m-n);i++) v1.push_back(0); //if v1 is smaller than v2, add 0 to v1 till same size
+        }else{
+            for(int i=1;i<=(n-m);i++) v2.push_back(0); //if v2 is smaller than v1, add 0s to v2 till same size
+        }
+        int sz = v1.size();
+        for(int i=0;i<sz;i++)
+        {
+            if(v1[i]>v2[i]) return 1;
+            else if(v1[i]<v2[i]) return -1;
+        }
+
+        return 0;
+        
+    }
+};