new soln

Author: shreymehul

Diff for: 1029.TwoCitySchedCost.cs

@@ -0,0 +1,39 @@
+// 1029. Two City Scheduling
+// A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti.
+
+// Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.
+// Example 1:
+// Input: costs = [[10,20],[30,200],[400,50],[30,20]]
+// Output: 110
+// Explanation: 
+// The first person goes to city A for a cost of 10.
+// The second person goes to city A for a cost of 30.
+// The third person goes to city B for a cost of 50.
+// The fourth person goes to city B for a cost of 20.
+// The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.
+// Example 2:
+// Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
+// Output: 1859
+// Example 3:
+// Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
+// Output: 3086
+// Constraints:
+// 2 * n == costs.length
+// 2 <= costs.length <= 100
+// costs.length is even.
+// 1 <= aCosti, bCosti <= 1000
+
+public class Solution {
+    public int TwoCitySchedCost(int[][] costs) {
+        //Sort on the basis of how much more I will be profited if I choose city 1 insted of city 2;
+        costs = costs.OrderBy(x => x[0]-x[1]).ToArray(); 
+        int cost = 0;
+        for(int i = 0; i < costs.Length; i++){
+            if(i<costs.Length/2)
+                cost += costs[i][0];
+            else
+                cost += costs[i][1];
+        }
+        return cost;
+    }
+}

Diff for: 290.WordPattern.cs

@@ -0,0 +1,41 @@
+// 290. Word Pattern
+// Given a pattern and a string s, find if s follows the same pattern.
+// Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.
+// Example 1:
+// Input: pattern = "abba", s = "dog cat cat dog"
+// Output: true
+// Example 2:
+// Input: pattern = "abba", s = "dog cat cat fish"
+// Output: false
+// Example 3:
+// Input: pattern = "aaaa", s = "dog cat cat dog"
+// Output: false
+// Constraints:
+// 1 <= pattern.length <= 300
+// pattern contains only lower-case English letters.
+// 1 <= s.length <= 3000
+// s contains only lowercase English letters and spaces ' '.
+// s does not contain any leading or trailing spaces.
+// All the words in s are separated by a single space.
+
+public class Solution {
+    public bool WordPattern(string pattern, string s) {
+        Dictionary <char,string> map1 = new Dictionary<char,string>();
+        Dictionary <string,char> map2 = new Dictionary<string,char>();
+        string[] sArr = s.Split(" ");
+        if(sArr.Length != pattern.Length)
+            return false;
+        for(int i = 0; i < pattern.Length; i++){
+            if(!map1.ContainsKey(pattern[i]) && !map2.ContainsKey(sArr[i])){
+                map1[pattern[i]] = sArr[i];
+                map2[sArr[i]] = pattern[i];
+            }
+            else if(map1.ContainsKey(pattern[i]) && map1[pattern[i]] == sArr[i]
+                && map2.ContainsKey(sArr[i]) && map2[sArr[i]] == pattern[i])
+                continue;
+            else
+                return false;
+        }
+        return true;
+    }
+}

Diff for: 520.DetectCapitalUse.cs

@@ -0,0 +1,48 @@
+// 520. Detect Capital
+// We define the usage of capitals in a word to be right when one of the following cases holds:
+// All letters in this word are capitals, like "USA".
+// All letters in this word are not capitals, like "leetcode".
+// Only the first letter in this word is capital, like "Google".
+// Given a string word, return true if the usage of capitals in it is right.
+// Example 1:
+// Input: word = "USA"
+// Output: true
+// Example 2:
+// Input: word = "FlaG"
+// Output: false
+// Constraints:
+// 1 <= word.length <= 100
+// word consists of lowercase and uppercase English letters.
+
+public class Solution {
+    public bool DetectCapitalUse(string word) {
+        bool flag = false;
+        for(int i = 0; i < word.Length; i++){
+            if(i == 0){
+                if(word[i] >= 'A' && word[i] <= 'Z')
+                    flag = true;
+                else
+                    flag = false;
+            }
+            else if(i == 1){
+                if(flag && word[i] >= 'a' && word[i] <= 'z')
+                    flag = false;
+                else if(flag && word[i] >= 'A' && word[i] <= 'Z')
+                    continue;
+                else if(!flag && word[i] >= 'a' && word[i] <= 'z')
+                    continue;
+                else 
+                    return false;
+            }
+            else{
+                if(flag && word[i] >= 'A' && word[i] <= 'Z')
+                    continue;
+                else if(!flag && word[i] >= 'a' && word[i] <= 'z')
+                    continue;
+                else 
+                    return false;
+            }
+        }
+        return true;
+    }
+}