Merge branch 'master' into sambabib-js-solutions

Author: sambabib

cpp/_916.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    vector<string> wordSubsets(vector<string>& words1, vector<string>& words2) {
+        int maxCharFreq[26] = {0};
+        int tempCharFreq[26];
+        for (const auto& word : words2) {
+            memset(tempCharFreq, 0, sizeof tempCharFreq);
+            for (char ch : word) {
+                tempCharFreq[ch - 'a']++;
+            }
+            for (int i = 0; i < 26; ++i) {
+                maxCharFreq[i] = max(maxCharFreq[i], tempCharFreq[i]);
+            }
+        } 
+        vector<string> universalWords;
+        for (const auto& word : words1) {
+            memset(tempCharFreq, 0, sizeof tempCharFreq);
+            for (char ch : word) {
+                tempCharFreq[ch - 'a']++;
+            }
+            bool isUniversal = true;
+            for (int i = 0; i < 26; ++i) {
+                if (maxCharFreq[i] > tempCharFreq[i]) {
+                    isUniversal = false;
+                    break;
+                }
+            }
+            if (isUniversal) {
+                universalWords.emplace_back(word);
+            }
+        }
+        return universalWords;
+    }
+};

paginated_contents/algorithms/2nd_thousand/README.md

@@ -6,6 +6,7 @@
 | 3059 |[Find All Unique Email Domains](https://leetcode.com/problems/find-all-unique-email-domains/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_3159.sql)                                || Easy |
 | 3051 |[Find Candidates for Data Scientist Position](https://leetcode.com/problems/find-candidates-for-data-scientist-position/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_3051.sql)                                || Easy |
 | 2990 |[Loan Types](https://leetcode.com/problems/loan-types/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2990.sql)                                || Easy |
+| 2879 |[Display the First Three Rows](https://leetcode.com/problems/display-the-first-three-rows/)| [Python3](https://github.com/fishercoder1534/Leetcode/blob/master/python3/2879.py)                                 || Easy |
 | 2205 |[The Number of Users That Are Eligible for Discount](https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2205.sql)                                || Easy |
 | 2082 |[The Number of Rich Customers](https://leetcode.com/problems/the-number-of-rich-customers/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2082.sql)                                || Easy |
 | 2072 |[The Winner University](https://leetcode.com/problems/the-winner-university/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2072.sql)                                || Easy |

paginated_contents/algorithms/3rd_thousand/README.md

@@ -0,0 +1,4 @@
+import pandas as pd
+
+def selectFirstRows(employees: pd.DataFrame) -> pd.DataFrame:
+    return employees.head(3)

paginated_contents/algorithms/4th_thousand/README.md

@@ -0,0 +1,22 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3270 {
+    public static class Solution1 {
+        public int generateKey(int num1, int num2, int num3) {
+            String[] padded = new String[3];
+            padded[0] = String.format("%04d", num1);
+            padded[1] = String.format("%04d", num2);
+            padded[2] = String.format("%04d", num3);
+            StringBuilder sb = new StringBuilder();
+            for (int i = 0; i < padded[0].length(); i++) {
+                sb.append(
+                        Math.min(
+                                Character.getNumericValue(padded[0].charAt(i)),
+                                Math.min(
+                                        Character.getNumericValue(padded[1].charAt(i)),
+                                        Character.getNumericValue(padded[2].charAt(i)))));
+            }
+            return Integer.parseInt(sb.toString());
+        }
+    }
+}

paginated_contents/database/README.md

@@ -0,0 +1,25 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _3274 {
+    public static class Solution1 {
+        public boolean checkTwoChessboards(String coordinate1, String coordinate2) {
+            return isBlack(coordinate2) == isBlack(coordinate1);
+        }
+
+        private boolean isBlack(String coordinate) {
+            Set<Character> blackColsWithOddRows = new HashSet<>();
+            blackColsWithOddRows.add('a');
+            blackColsWithOddRows.add('c');
+            blackColsWithOddRows.add('e');
+            blackColsWithOddRows.add('g');
+            if (blackColsWithOddRows.contains(coordinate.charAt(0))) {
+                return Character.getNumericValue(coordinate.charAt(1)) % 2 == 1;
+            } else {
+                return Character.getNumericValue(coordinate.charAt(1)) % 2 == 0;
+            }
+        }
+    }
+}

python3/2879.py

@@ -0,0 +1,16 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3280 {
+    public static class Solution1 {
+        public String convertDateToBinary(String date) {
+            String[] parts = date.split("-");
+            StringBuilder sb = new StringBuilder();
+            for (String part : parts) {
+                sb.append(Integer.toBinaryString(Integer.parseInt(part)));
+                sb.append("-");
+            }
+            sb.setLength(sb.length() - 1);
+            return sb.toString();
+        }
+    }
+}

src/main/java/com/fishercoder/solutions/fourththousand/_3270.java

@@ -0,0 +1,18 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _3285 {
+    public static class Solution1 {
+        public List<Integer> stableMountains(int[] height, int threshold) {
+            List<Integer> ans = new ArrayList<>();
+            for (int i = 1; i < height.length; i++) {
+                if (height[i - 1] > threshold) {
+                    ans.add(i);
+                }
+            }
+            return ans;
+        }
+    }
+}