Skip to content

Commit 0945671

Browse files
chanpreet3000chanpreet3000
committed
Added more problems
1 parent 8ea1c22 commit 0945671

23 files changed

+135
-0
lines changed

‎index.js

+3
Original file line numberDiff line numberDiff line change
@@ -27,6 +27,9 @@ const question = (query) => {
2727
} else if (type === '2') {
2828
await LeetcoderAuthenticator.loginUser();
2929
await LeetcoderScraper.scrapeAcceptedSolutions();
30+
} else if (type === '3') {
31+
await LeetcoderAuthenticator.loginUser();
32+
await LeetcoderScraper.scrapeAcceptedSolutionsGlobally();
3033
}
3134
} catch (err) {
3235
Logger.error('Something went wrong!', err);

‎leetcoder/LeetcoderScraper.js

+27
Original file line numberDiff line numberDiff line change
@@ -19,6 +19,10 @@ class LeetcoderScraper {
1919
waitUntil: "networkidle2",
2020
});
2121

22+
const statusDiv = await getElementByXPath(page, "//*[@id='result_state']", 3, 0);
23+
const textContent = await statusDiv[0].evaluate((el) => el.textContent);
24+
if (textContent !== 'Accepted') return;
25+
2226
// Get name from the link in the name href
2327
const nameDiv = await getElementByXPath(page, SCRAPER_SUBMITTED_CODE_NAME_XPATH, 3, 0);
2428
const hrefHandle = await nameDiv[0].getProperty("href");
@@ -89,6 +93,29 @@ class LeetcoderScraper {
8993
await this.#scrapeCodeFromAllSubmissions();
9094
Logger.error('<<<< Exiting Leetcoder Scrapper >>>>');
9195
}
96+
97+
/**
98+
* This is only for testing and scraping global solutions not relevant to the users.
99+
*/
100+
static async scrapeAcceptedSolutionsGlobally() {
101+
Logger.error('<<<< Starting Leetcoder Scrapper >>>>');
102+
const {browser} = getBrowserDetails();
103+
try {
104+
let id_no = 700000285
105+
while (id_no > 0) {
106+
const promises = [];
107+
for (let idx = 0; idx < 15; idx++) {
108+
promises.push(this.#scrapeAndSaveCodeFromSubmissionId(id_no, browser));
109+
id_no++;
110+
}
111+
await Promise.all(promises);
112+
promises.length = 0;
113+
}
114+
} catch (e) {
115+
Logger.error(e);
116+
}
117+
Logger.error('<<<< Exiting Leetcoder Scrapper >>>>');
118+
}
92119
}
93120

94121
export default LeetcoderScraper;

‎problems/android-unlock-patterns.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "android-unlock-patterns",
3+
"language": "javascript",
4+
"code": "let jumps = Array.from(new Array(10), () => new Array(10))\n\njumps[1][3] = jumps[3][1] = 2;\njumps[4][6] = jumps[6][4] = 5;\njumps[7][9] = jumps[9][7] = 8;\njumps[1][7] = jumps[7][1] = 4;\njumps[2][8] = jumps[8][2] = 5;\njumps[3][9] = jumps[9][3] = 6;\njumps[1][9] = jumps[9][1] = jumps[3][7] = jumps[7][3] = 5;\n\nvar numberOfPatterns = function(m, n) {\n let count = 0\n buildPattern()\n return count\n \n function buildPattern(curr = '', used = new Set) {\n if (curr.length >= m) {\n count++\n }\n if (curr.length === n) {\n return\n }\n for (let i = 1; i < 10; i++) {\n if (used.has(i)) continue\n let jumping = jumps[i][curr[curr.length - 1]]\n if (jumping) {\n if (!used.has(jumping)) continue\n }\n used.add(i)\n buildPattern(curr + i, used)\n used.delete(i)\n }\n }\n};"
5+
}

‎problems/block-placement-queries.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "block-placement-queries",
3+
"language": "cpp",
4+
"code": "int const N = 5 * 1e4 + 10;\nint seg[4 * N];\n\n\n\nclass Solution {\npublic:\n void update(int ind, int ss, int se, int idx, int val){\n if(ss == se){\n seg[ind] = val;\n return;\n }\n int mid = (ss + se)/2;\n if(idx <= mid){\n update(2 * ind + 1, ss, mid, idx, val);\n }else{\n update(2 * ind + 2, mid + 1, se, idx, val);\n }\n seg[ind] = max(seg[2 * ind + 1], seg[2 * ind + 2]);\n }\n\n int query(int ind, int ss ,int se, int qs, int qe){\n if(se < qs || ss > qe){\n return 0;\n }\n if(ss >= qs && se <= qe){\n return seg[ind];\n }\n int mid = (ss + se)/2;\n int l = query(2 * ind + 1, ss, mid, qs, qe);\n int r = query(2 * ind + 2, mid + 1, se, qs, qe);\n return max(l, r);\n }\n vector<bool> getResults(vector<vector<int>>& queries) {\n memset(seg, 0, sizeof seg);\n set<int> st;\n st.insert(0);\n st.insert(N - 1);\n \n //\n update(0, 0, N - 1, N - 1, (N - 1) - 0);\n //\n vector<bool> ans;\n for (const auto& i : queries) {\n if (i[0] == 1) {\n int x = i[1];\n auto it = st.upper_bound(x);\n update(0, 0, N - 1, *it, *it - x);\n it--;\n update(0, 0, N - 1, x, x - *it);\n st.insert(x);\n } else {\n int x = i[1];\n int sz = i[2];\n int t = query(0, 0, N - 1, 0, x);\n auto it = st.lower_bound(x);\n it--;\n bool f = false;\n if(t >= sz || x - *it >= sz){\n f = true;\n }\n ans.push_back(f);\n }\n }\n return ans;\n }\n};"
5+
}

‎problems/capital-gainloss.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "capital-gainloss",
3+
"language": "mssql",
4+
"code": "SELECT stock_name , sum(price) as capital_gain_loss FROM (\nSELECT stock_name,\nCASE WHEN operation = 'Sell' then price\nWHEN operation = 'Buy' then (-1 * price)\nEND AS price\nFROM Stocks) as tb \nGROUP BY stock_name"
5+
}

‎problems/car-pooling.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "car-pooling",
3+
"language": "python3",
4+
"code": "class Solution:\n def carPooling(self, trips: List[List[int]], capacity: int) -> bool:\n trips.sort(key=lambda x: x[1])\n heap = []\n for p, f, t in trips:\n while heap and heap[0][0] <= f:\n _, num = heapq.heappop(heap)\n capacity += num\n capacity -= p\n if capacity < 0:\n return False\n heapq.heappush(heap, [t, p])\n return True\n "
5+
}

‎problems/check-if-number-is-a-sum-of-powers-of-three.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "check-if-number-is-a-sum-of-powers-of-three",
3+
"language": "python3",
4+
"code": "class Solution:\n def checkPowersOfThree(self, n: int) -> bool:\n bits = []\n while n > 0:\n if n%3 == 2:\n return False\n bits.append(n%3)\n n //= 3\n return True\n "
5+
}

‎problems/find-minimum-operations-to-make-all-elements-divisible-by-three.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "find-minimum-operations-to-make-all-elements-divisible-by-three",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n int minimumOperations(vector<int>& nums) {\n int ans = 0;\n for(auto i : nums){\n if(i%3)ans++;\n }\n return ans;\n }\n};"
5+
}

‎problems/find-occurrences-of-an-element-in-an-array.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "find-occurrences-of-an-element-in-an-array",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n vector<int> occurrencesOfElement(vector<int>& nums, vector<int>& queries, int x) {\n vector<int> temp, ans;\n for(int i = 0; i < nums.size(); i++){\n if(nums[i] == x){\n temp.push_back(i);\n }\n }\n for(auto i : queries){\n if(i <= temp.size()){\n ans.push_back(temp[i - 1]);\n }else{\n ans.push_back(-1);\n }\n }\n return ans;\n }\n};"
5+
}

‎problems/find-the-number-of-distinct-colors-among-the-balls.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "find-the-number-of-distinct-colors-among-the-balls",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n vector<int> queryResults(int limit, vector<vector<int>>& queries) {\n vector<int> ans;\n map<int, int> mp;\n map<int, int> arr;\n for(auto i : queries){\n int x = i[0], y = i[1];\n if(arr.find(x) != arr.end()){\n mp[arr[x]]--;\n if(mp[arr[x]] == 0)mp.erase(arr[x]);\n }\n mp[y]++;\n arr[x] = y;\n ans.push_back(mp.size());\n }\n return ans;\n }\n};"
5+
}

‎problems/find-the-xor-of-numbers-which-appear-twice.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "find-the-xor-of-numbers-which-appear-twice",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n int duplicateNumbersXOR(vector<int>& nums) {\n map<int, int> mp;\n for(auto i : nums)mp[i]++;\n int x = 0;\n for(auto i : mp)if(i.second == 2)x ^= i.first;\n return x;\n }\n};"
5+
}

‎problems/integer-to-roman.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "integer-to-roman",
3+
"language": "java",
4+
"code": "class Solution {\n public String intToRoman(int num) {\n String result = \"\";\n int[] values = {1000,900,500,400,100,90,50,40,10,9,5,4,1};\n String[] romanLiterals = {\"M\", \"CM\",\"D\", \"CD\",\"C\", \"XC\",\"L\", \"XL\", \"X\", \"IX\",\"V\", \"IV\",\"I\"};\n for(int i=0; i< values.length; i++){\n while(num >= values[i]){\n num = num - values[i];\n result = result + romanLiterals[i];\n }\n \n }\n \n \n \n return result;\n }\n \n}"
5+
}

‎problems/logger-rate-limiter.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "logger-rate-limiter",
3+
"language": "java",
4+
"code": "class Logger {\n \n Map<String, Integer> map;\n\n public Logger() {\n this.map = new HashMap<>();\n }\n \n public boolean shouldPrintMessage(int timestamp, String message) {\n if(this.map.containsKey(message) && timestamp - map.get(message) <10){\n return false;\n }\n map.put(message, timestamp);\n return true;\n }\n}\n\n/**\n * Your Logger object will be instantiated and called as such:\n * Logger obj = new Logger();\n * boolean param_1 = obj.shouldPrintMessage(timestamp,message);\n */"
5+
}

‎problems/maximum-length-of-subarray-with-positive-product.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "maximum-length-of-subarray-with-positive-product",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n #define ll int\n ll fun(ll n){\n if(n<0)return -1;\n else return 1;\n }\n int getMaxLen(vector<int>& v) {\n vector<ll>a;\n ll ans=0;\n ll mul=1;\n for(ll i=0;i<v.size();i++){\n if(v[i]!=0){\n a.push_back(fun(v[i]));\n mul*=fun(v[i]);\n if(mul==1)ans=max(ans,(ll)a.size());\n }\n else{\n mul=1;\n for(ll j=(ll)a.size()-1;j>=0;j--){\n mul*=a[j];\n if(mul==1)ans=max(ans,(ll)a.size()-j);\n }\n a.clear();\n mul=1;\n \n }\n }\n mul=1;\n for(ll j=(ll)a.size()-1;j>=0;j--){\n mul*=a[j];\n if(mul==1)ans=max(ans,(ll)a.size()-j);\n }\n return ans;\n \n }\n};"
5+
}

‎problems/maximum-subarray-sum-with-one-deletion.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "maximum-subarray-sum-with-one-deletion",
3+
"language": "python3",
4+
"code": "class Solution:\n def maximumSum(self, arr: List[int]) -> int:\n #dp=[[0]*2 for _ in range(len(arr))]\n maxi=arr[0]\n #dp[0][0]=arr[0]\n prevwoutdrop=arr[0]\n prevwdrop=-1\n prevprevwoutdrop=-1\n for i in range(1,len(arr)):\n #dp[i][0]=max(dp[i-1][0]+arr[i],arr[i])\n a=max(prevwoutdrop+arr[i],arr[i])\n #dp[i][1]=max(dp[i-1][1]+arr[i],dp[i-2][0]+arr[i]) if i>1 else arr[i]\n b=max(prevwdrop+arr[i],prevprevwoutdrop+arr[i]) if i>1 else arr[i]\n maxi=max(maxi,a,b)\n prevprevwoutdrop= prevwoutdrop\n prevwoutdrop=a\n prevwdrop=b\n \n return maxi"
5+
}

‎problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "minimum-operations-to-make-binary-array-elements-equal-to-one-i",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n int minOperations(vector<int>& nums) {\n int ans = 0;\n for(int i = 0; i < nums.size() - 2; i++){\n if(nums[i] == 0){\n nums[i] ^= 1;\n nums[i + 1] ^= 1;\n nums[i + 2] ^= 1;\n ans++;\n }\n }\n for(auto i : nums){\n if(i == 0)return -1;\n }\n return ans;\n }\n};"
5+
}

‎problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii",
3+
"language": "cpp",
4+
"code": "class Solution {\npublic:\n int minOperations(vector<int>& nums) {\n int ans = 0, tot = 0;\n for(int i = 0; i < nums.size(); i++){\n nums[i] ^= tot;\n if(nums[i] == 0){\n // cout<<i<<\" \";\n nums[i] = 1;\n tot++;\n tot %= 2;\n ans++;\n }\n }\n for(auto i : nums){\n if(i == 0)return -1;\n }\n // cout<<endl;\n return ans;\n }\n};"
5+
}

‎problems/number-of-distinct-islands.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "number-of-distinct-islands",
3+
"language": "python3",
4+
"code": "class Solution:\n def dfs(self, i, j, visited, island, grid):\n r, c = len(grid), len(grid[0])\n visited.add((i, j))\n \n # up\n if i > 0 and (i-1, j) not in visited and grid[i-1][j] == 1:\n island.append(\"U\")\n self.dfs(i-1, j, visited, island, grid)\n island.append(\"D\")\n \n # down\n if i < r-1 and (i+1, j) not in visited and grid[i+1][j] == 1:\n island.append(\"D\")\n self.dfs(i+1, j, visited, island, grid)\n island.append(\"U\")\n \n # left\n if j > 0 and (i, j-1) not in visited and grid[i][j-1] == 1:\n island.append(\"L\")\n self.dfs(i, j-1, visited, island, grid)\n island.append(\"R\")\n \n # right\n if j < c-1 and (i, j+1) not in visited and grid[i][j+1] == 1:\n island.append(\"R\")\n self.dfs(i, j+1, visited, island, grid)\n island.append(\"L\")\n \n def numDistinctIslands(self, grid: List[List[int]]) -> int: \n r, c = len(grid), len(grid[0])\n \n islands = set()\n visited = set()\n \n for i in range(r):\n for j in range(c):\n if (i, j) not in visited and grid[i][j] == 1:\n island = []\n self.dfs(i, j, visited, island, grid)\n islands.add(\"\".join(island))\n \n return len(islands)\n"
5+
}

‎problems/primary-department-for-each-employee.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "primary-department-for-each-employee",
3+
"language": "mysql",
4+
"code": "# Write your MySQL query statement below\nselect employee_id, department_id from Employee where primary_flag = 'Y' \nunion\nselect employee_id, department_id from Employee \ngroup by employee_id having count(department_id) = 1; \n\n"
5+
}

‎problems/read-n-characters-given-read4-ii-call-multiple-times.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "read-n-characters-given-read4-ii-call-multiple-times",
3+
"language": "java",
4+
"code": "/**\n * The read4 API is defined in the parent class Reader4.\n * int read4(char[] buf4); \n */\n\npublic class Solution extends Reader4 {\n private String data;\n\n private int dataSize;\n\n private int currentPointer = 0;\n\n /**\n * @param buf Destination buffer\n * @param n Number of characters to read\n * @return The number of actual characters read\n */\n public int read(char[] buf, int n) {\n if (data == null) {\n data = readData();\n dataSize = data.length();\n }\n\n if (currentPointer > data.length()) {\n return 0;\n }\n\n int startIndex = currentPointer;\n int endIndex = currentPointer + n;\n \n if (endIndex > dataSize) {\n endIndex = dataSize;\n }\n \n String readData = data.substring(startIndex, endIndex);\n int readSize = readData.length();\n \n int i = 0;\n for (;i<readSize;i++) {\n buf[i] = readData.charAt(i);\n }\n\n currentPointer = currentPointer + n;\n\n return readSize;\n\n }\n\n private String readData() {\n StringBuilder dataBuilder = new StringBuilder();\n\n int currentRead = 0;\n\n char tempBuf[] = new char[4];\n\n int i;\n\n while (true) {\n currentRead = read4(tempBuf);\n\n for (i=0;i<currentRead;i++) {\n dataBuilder.append(tempBuf[i]);\n }\n\n if (currentRead < 4) {\n break;\n }\n }\n\n return dataBuilder.toString();\n }\n}"
5+
}

‎problems/sum-of-beauty-in-the-array.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "sum-of-beauty-in-the-array",
3+
"language": "rust",
4+
"code": "use std::collections::*;\n\nimpl Solution {\npub fn sum_of_beauties(nums: Vec<i32>) -> i32 {\n let n = nums.len();\n let mut count = 0;\n let mut btreemap = BTreeMap::new();\n for i in 1..n {\n *btreemap.entry(nums[i]).or_insert(0) += 1;\n }\n\n let mut max = nums[0];\n for i in 1..n-1 {\n let v = nums[i];\n\n let entry = btreemap.entry(v).or_insert(0);\n if *entry == 1 {\n btreemap.remove(&v);\n } else {\n *entry -= 1;\n }\n let min = btreemap.iter().next().unwrap();\n\n if max < v && v < *min.0 {\n count += 2;\n } else if nums[i-1] < v && v < nums[i+1] {\n count += 1;\n }\n max = max.max(v);\n }\n \n count\n}\n}"
5+
}

‎problems/swim-in-rising-water.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "swim-in-rising-water",
3+
"language": "python3",
4+
"code": "class Solution:\n def swimInWater(self, grid: List[List[int]]) -> int:\n ROWS, COLS = len(grid), len(grid[0])\n \n minHeap = [[grid[0][0], 0, 0]] # maxHeight, r, c\n visit = set([0, 0])\n \n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n \n while minHeap:\n maxHeight, r, c = heappop(minHeap)\n if (r, c) in visit:\n continue\n if r == ROWS - 1 and c == COLS - 1:\n return maxHeight\n visit.add((r, c))\n for dr, dc in directions:\n row, col = r + dr, c + dc \n if row < 0 or col < 0 or row == ROWS or col == COLS or (row, col) in visit:\n continue\n heappush(minHeap, [max(maxHeight, grid[row][col]), row, col])\n "
5+
}

‎problems/top-travellers.json

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
{
2+
"problemName": "top-travellers",
3+
"language": "mysql",
4+
"code": "# Write your MySQL query statement below\n\n-- name | travelled_distance \nSELECT u.name,\n IFNULL(SUM(distance),0) AS travelled_distance\nFROM Users u\nLEFT JOIN Rides r\nON u.id = r.user_id\nGROUP BY u.id\nORDER BY travelled_distance DESC, name; "
5+
}

0 commit comments

Comments
 (0)