Input: queries = [[1,2],[2,3,3],[2,3,1],[2,2,2]]
\n\nOutput: [false,true,true]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/22/example0block.png\")
For query 0, place an obstacle at x = 2. A block of size at most 2 can be placed before x = 3.
Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]employee-task-duration-and-concurrent-tasks.json b/leetcode/originData/[no content]employee-task-duration-and-concurrent-tasks.json new file mode 100644 index 00000000..25684027 --- /dev/null +++ b/leetcode/originData/[no content]employee-task-duration-and-concurrent-tasks.json @@ -0,0 +1,60 @@ +{ + "data": { + "question": { + "questionId": "3465", + "questionFrontendId": "3156", + "boundTopicId": null, + "title": "Employee Task Duration and Concurrent Tasks", + "titleSlug": "employee-task-duration-and-concurrent-tasks", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"Tasks\":[\"task_id\",\"employee_id\",\"start_time\",\"end_time\"]},\"rows\":{\"Tasks\":[[1,1001,\"2023-05-01 08:00:00\",\"2023-05-01 09:00:00\"],[2,1001,\"2023-05-01 08:30:00\",\"2023-05-01 10:30:00\"],[3,1001,\"2023-05-01 11:00:00\",\"2023-05-01 12:00:00\"],[7,1001,\"2023-05-01 13:00:00\",\"2023-05-01 15:30:00\"],[4,1002,\"2023-05-01 09:00:00\",\"2023-05-01 10:00:00\"],[5,1002,\"2023-05-01 09:30:00\",\"2023-05-01 11:30:00\"],[6,1003,\"2023-05-01 14:00:00\",\"2023-05-01 16:00:00\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"217\", \"totalSubmission\": \"337\", \"totalAcceptedRaw\": 217, \"totalSubmissionRaw\": 337, \"acRate\": \"64.4%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Tasks\":[\"task_id\",\"employee_id\",\"start_time\",\"end_time\"]},\"rows\":{\"Tasks\":[[1,1001,\"2023-05-01 08:00:00\",\"2023-05-01 09:00:00\"],[2,1001,\"2023-05-01 08:30:00\",\"2023-05-01 10:30:00\"],[3,1001,\"2023-05-01 11:00:00\",\"2023-05-01 12:00:00\"],[7,1001,\"2023-05-01 13:00:00\",\"2023-05-01 15:30:00\"],[4,1002,\"2023-05-01 09:00:00\",\"2023-05-01 10:00:00\"],[5,1002,\"2023-05-01 09:30:00\",\"2023-05-01 11:30:00\"],[6,1003,\"2023-05-01 14:00:00\",\"2023-05-01 16:00:00\"]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE if Not exists Tasks (\\n task_id INT ,\\n employee_id INT,\\n start_time DATETIME,\\n end_time DATETIME\\n);\"], \"mssql\": [\"CREATE TABLE Tasks (\\n task_id INT PRIMARY KEY,\\n employee_id INT,\\n start_time DATETIME,\\n end_time DATETIME\\n);\\n\"], \"oraclesql\": [\"CREATE TABLE Tasks (\\n task_id int ,\\n employee_id int,\\n start_time DATE,\\n end_time DATE\\n)\\n\\n\\n\\n\\n\\n\\n\", \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"], \"postgresql\": [\"CREATE TABLE IF NOT EXISTS Tasks (\\n task_id INT,\\n employee_id INT,\\n start_time TIMESTAMP,\\n end_time TIMESTAMP\\n);\\n\"], \"pythondata\": [\"Tasks = pd.DataFrame([], columns=['task_id', 'employee_id', 'start_time', 'end_time']).astype({\\n 'task_id': 'Int64',\\n 'employee_id': 'Int64',\\n 'start_time': 'datetime64[ns]',\\n 'end_time': 'datetime64[ns]'\\n})\"], \"database\": true, \"name\": \"find_total_duration\", \"database_schema\": {\"Tasks\": {\"task_id\": \"INT\", \"employee_id\": \"INT\", \"start_time\": \"DATETIME\", \"end_time\": \"DATETIME\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE if Not exists Tasks (\n task_id INT ,\n employee_id INT,\n start_time DATETIME,\n end_time DATETIME\n);", + "Truncate table Tasks", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('1', '1001', '2023-05-01 08:00:00', '2023-05-01 09:00:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('2', '1001', '2023-05-01 08:30:00', '2023-05-01 10:30:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('3', '1001', '2023-05-01 11:00:00', '2023-05-01 12:00:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('7', '1001', '2023-05-01 13:00:00', '2023-05-01 15:30:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('4', '1002', '2023-05-01 09:00:00', '2023-05-01 10:00:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('5', '1002', '2023-05-01 09:30:00', '2023-05-01 11:30:00')", + "insert into Tasks (task_id, employee_id, start_time, end_time) values ('6', '1003', '2023-05-01 14:00:00', '2023-05-01 16:00:00')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]equalize-strings-by-adding-or-removing-characters-at-ends.json b/leetcode/originData/[no content]equalize-strings-by-adding-or-removing-characters-at-ends.json new file mode 100644 index 00000000..3314a4f8 --- /dev/null +++ b/leetcode/originData/[no content]equalize-strings-by-adding-or-removing-characters-at-ends.json @@ -0,0 +1,74 @@ +{ + "data": { + "question": { + "questionId": "3441", + "questionFrontendId": "3135", + "boundTopicId": null, + "title": "Equalize Strings by Adding or Removing Characters at Ends", + "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 9, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "\"abcde\"\n\"cdef\"\n\"axxy\"\n\"yabx\"\n\"xyz\"\n\"xyz\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Search", + "slug": "binary-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sliding Window", + "slug": "sliding-window", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Function", + "slug": "hash-function", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"439\", \"totalSubmission\": \"748\", \"totalAcceptedRaw\": 439, \"totalSubmissionRaw\": 748, \"acRate\": \"58.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "\"abcde\"\n\"cdef\"", + "metaData": "{\n \"name\": \"minOperations\",\n \"params\": [\n {\n \"name\": \"initial\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"target\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]maximum-hamming-distances.json b/leetcode/originData/[no content]maximum-hamming-distances.json new file mode 100644 index 00000000..8ec71d1d --- /dev/null +++ b/leetcode/originData/[no content]maximum-hamming-distances.json @@ -0,0 +1,68 @@ +{ + "data": { + "question": { + "questionId": "3449", + "questionFrontendId": "3141", + "boundTopicId": null, + "title": "Maximum Hamming Distances", + "titleSlug": "maximum-hamming-distances", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 10, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[9,12,9,11]\n4\n[3,4,6,10]\n4", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Breadth-First Search", + "slug": "breadth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"320\", \"totalSubmission\": \"427\", \"totalAcceptedRaw\": 320, \"totalSubmissionRaw\": 427, \"acRate\": \"74.9%\"}", + "hints": [ + "For eachnums[i], complement it (for each bit, if it is 1, it becomes 0 and vice-versa).",
+ "Instead of finding the maximum Hamming distance from x = nums[i], let's think of finding the minimum Hamming distance from the complement of x to any element of the array.",
+ "Create a graph with V = {0, 1, ..., 2m - 1}. Put an edge between two vertices if they differ in exactly one bit.",
+ "Run a multi-source BFS from elements of nums.",
+ "Now for each x, to find its minimum Hamming distance from elements of the array, simply calculate its shortest path from array elements."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[9,12,9,11]\n4",
+ "metaData": "{\n \"name\": \"maxHammingDistances\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"m\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]second-day-verification.json b/leetcode/originData/[no content]second-day-verification.json new file mode 100644 index 00000000..76f157e0 --- /dev/null +++ b/leetcode/originData/[no content]second-day-verification.json @@ -0,0 +1,61 @@ +{ + "data": { + "question": { + "questionId": "3481", + "questionFrontendId": "3172", + "boundTopicId": null, + "title": "Second Day Verification", + "titleSlug": "second-day-verification", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"emails\":[\"email_id\",\"user_id\",\"signup_date\"],\"texts\":[\"text_id\",\"email_id\",\"signup_action\",\"action_date\"]},\"rows\":{\"emails\":[[125,7771,\"2022-06-14 09:30:00\"],[433,1052,\"2022-07-09 08:15:00\"],[234,7005,\"2022-08-20 10:00:00\"]],\"texts\":[[1,125,\"Verified\",\"2022-06-15 08:30:00\"],[2,433,\"Not Verified\",\"2022-07-10 10:45:00\"],[4,234,\"Verified\",\"2022-08-21 09:30:00\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"144\", \"totalSubmission\": \"169\", \"totalAcceptedRaw\": 144, \"totalSubmissionRaw\": 169, \"acRate\": \"85.2%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"emails\":[\"email_id\",\"user_id\",\"signup_date\"],\"texts\":[\"text_id\",\"email_id\",\"signup_action\",\"action_date\"]},\"rows\":{\"emails\":[[125,7771,\"2022-06-14 09:30:00\"],[433,1052,\"2022-07-09 08:15:00\"],[234,7005,\"2022-08-20 10:00:00\"]],\"texts\":[[1,125,\"Verified\",\"2022-06-15 08:30:00\"],[2,433,\"Not Verified\",\"2022-07-10 10:45:00\"],[4,234,\"Verified\",\"2022-08-21 09:30:00\"]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE If not exists emails (\\n email_id INT,\\n user_id INT,\\n signup_date DATETIME\\n);\", \"CREATE TABLE If not exists texts (\\n text_id INT,\\n email_id INT,\\n signup_action ENUM('Verified', 'Not Verified'),\\n action_date DATETIME\\n);\"], \"mssql\": [\"CREATE TABLE emails (\\n email_id INT,\\n user_id INT,\\n signup_date DATETIME\\n);\", \"CREATE TABLE texts (\\n text_id INT,\\n email_id INT,\\n signup_action VARCHAR(12),\\n action_date DATETIME\\n);\"], \"oraclesql\": [\"CREATE TABLE emails (\\n email_id NUMBER,\\n user_id NUMBER,\\n signup_date DATE\\n)\\n\", \"CREATE TABLE texts (\\n text_id NUMBER,\\n email_id NUMBER,\\n signup_action VARCHAR(32),\\n action_date DATE\\n)\", \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"], \"database\": true, \"name\": \"find_second_day_signups\", \"postgresql\": [\"CREATE TABLE emails (\\n email_id INTEGER,\\n user_id INTEGER,\\n signup_date DATE\\n);\\n\", \"CREATE TABLE texts (\\n text_id INTEGER,\\n email_id INTEGER,\\n signup_action VARCHAR(32),\\n action_date DATE\\n);\\n\", \"SELECT to_char(action_date, 'YYYY-MM-DD HH24:MI:SS') FROM texts;\\n\"], \"pythondata\": [\"emails = pd.DataFrame([], columns=['email_id', 'user_id', 'signup_date']).astype({\\n 'email_id': 'Int64', # Nullable integer type\\n 'user_id': 'Int64', # Nullable integer type\\n 'signup_date': 'datetime64[ns]' # DateTime type for signup date\\n})\", \"texts = pd.DataFrame([], columns=['text_id', 'email_id', 'signup_action', 'action_date']).astype({\\n 'text_id': 'Int64', # Nullable integer type for text_id\\n 'email_id': 'Int64', # Nullable integer type for email_id\\n 'signup_action': 'object', # Using 'object' to store string values for ENUM\\n 'action_date': 'datetime64[ns]' # DateTime type for action_date\\n})\"], \"database_schema\": {\"emails\": {\"email_id\": \"INT\", \"user_id\": \"INT\", \"signup_date\": \"DATETIME\"}, \"texts\": {\"text_id\": \"INT\", \"email_id\": \"INT\", \"signup_action\": \"ENUM('Verified', 'Not Verified')\", \"action_date\": \"DATETIME\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE If not exists emails (\n email_id INT,\n user_id INT,\n signup_date DATETIME\n);", + "CREATE TABLE If not exists texts (\n text_id INT,\n email_id INT,\n signup_action ENUM('Verified', 'Not Verified'),\n action_date DATETIME\n);", + "Truncate table emails", + "insert into emails (email_id, user_id, signup_date) values ('125', '7771', '2022-06-14 09:30:00')", + "insert into emails (email_id, user_id, signup_date) values ('433', '1052', '2022-07-09 08:15:00')", + "insert into emails (email_id, user_id, signup_date) values ('234', '7005', '2022-08-20 10:00:00')", + "Truncate table texts", + "insert into texts (text_id, email_id, signup_action, action_date) values ('1', '125', 'Verified', '2022-06-15 08:30:00')", + "insert into texts (text_id, email_id, signup_action, action_date) values ('2', '433', 'Not Verified', '2022-07-10 10:45:00')", + "insert into texts (text_id, email_id, signup_action, action_date) values ('4', '234', 'Verified', '2022-08-21 09:30:00')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]server-utilization-time.json b/leetcode/originData/[no content]server-utilization-time.json new file mode 100644 index 00000000..4e16ae60 --- /dev/null +++ b/leetcode/originData/[no content]server-utilization-time.json @@ -0,0 +1,169 @@ +{ + "data": { + "question": { + "questionId": "3440", + "questionFrontendId": "3126", + "boundTopicId": null, + "title": "Server Utilization Time", + "titleSlug": "server-utilization-time", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 6, + "dislikes": 12, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\": {\"Servers\": [\"server_id\", \"status_time\", \"session_status\"]}, \"rows\": {\"Servers\": [[4, \"2023-11-29 20:22:50\", \"start\"], [4, \"2023-11-30 04:19:50\", \"stop\"], [2, \"2023-11-18 21:23:09\", \"start\"], [2, \"2023-11-19 00:38:09\", \"stop\"], [5, \"2023-11-27 18:38:16\", \"start\"], [5, \"2023-11-28 02:46:16\", \"stop\"], [4, \"2023-11-27 06:46:42\", \"start\"], [4, \"2023-11-27 08:23:42\", \"stop\"], [5, \"2023-11-11 05:09:45\", \"start\"], [5, \"2023-11-11 06:42:45\", \"stop\"], [5, \"2023-11-27 23:05:58\", \"start\"], [5, \"2023-11-27 23:48:58\", \"stop\"], [5, \"2023-11-14 16:29:34\", \"start\"], [5, \"2023-11-14 19:11:34\", \"stop\"], [1, \"2023-11-02 19:14:15\", \"start\"], [1, \"2023-11-02 20:19:15\", \"stop\"], [5, \"2023-11-03 06:55:30\", \"start\"], [5, \"2023-11-03 11:03:30\", \"stop\"], [4, \"2023-11-02 16:53:28\", \"start\"], [4, \"2023-11-02 22:28:28\", \"stop\"], [2, \"2023-11-20 07:06:41\", \"start\"], [2, \"2023-11-20 15:58:41\", \"stop\"], [1, \"2023-11-22 10:42:35\", \"start\"], [1, \"2023-11-22 19:14:35\", \"stop\"], [3, \"2023-11-23 03:05:39\", \"start\"], [3, \"2023-11-23 10:54:39\", \"stop\"], [3, \"2023-11-15 20:04:15\", \"start\"], [3, \"2023-11-15 21:30:15\", \"stop\"], [3, \"2023-11-12 08:21:42\", \"start\"], [3, \"2023-11-12 17:07:42\", \"stop\"], [1, \"2023-11-02 02:33:24\", \"start\"], [1, \"2023-11-02 12:10:24\", \"stop\"], [4, \"2023-11-14 03:55:29\", \"start\"], [4, \"2023-11-14 08:53:29\", \"stop\"], [2, \"2023-11-04 00:36:53\", \"start\"], [2, \"2023-11-04 00:37:53\", \"stop\"], [4, \"2023-11-08 01:54:18\", \"start\"], [4, \"2023-11-08 09:56:18\", \"stop\"], [1, \"2023-11-24 14:28:11\", \"start\"], [1, \"2023-11-24 21:38:11\", \"stop\"], [3, \"2023-11-20 22:55:03\", \"start\"], [3, \"2023-11-21 02:19:03\", \"stop\"], [3, \"2023-11-12 03:10:22\", \"start\"], [3, \"2023-11-12 08:29:22\", \"stop\"], [2, \"2023-11-02 14:55:46\", \"start\"], [2, \"2023-11-02 16:56:46\", \"stop\"], [1, \"2023-11-09 03:40:44\", \"start\"], [1, \"2023-11-09 03:52:44\", \"stop\"], [5, \"2023-11-16 17:43:28\", \"start\"], [5, \"2023-11-16 20:45:28\", \"stop\"], [2, \"2023-11-08 16:17:24\", \"start\"], [2, \"2023-11-09 00:59:24\", \"stop\"], [4, \"2023-11-25 04:46:06\", \"start\"], [4, \"2023-11-25 11:56:06\", \"stop\"], [2, \"2023-11-05 14:22:34\", \"start\"], [2, \"2023-11-05 21:33:34\", \"stop\"], [1, \"2023-11-02 09:49:22\", \"start\"], [1, \"2023-11-02 15:01:22\", \"stop\"], [5, \"2023-11-08 06:49:10\", \"start\"], [5, \"2023-11-08 13:33:10\", \"stop\"], [1, \"2023-11-22 21:00:23\", \"start\"], [1, \"2023-11-22 22:43:23\", \"stop\"], [3, \"2023-11-06 07:45:50\", \"start\"], [3, \"2023-11-06 15:18:50\", \"stop\"], [3, \"2023-11-02 22:13:17\", \"start\"], [3, \"2023-11-03 03:50:17\", \"stop\"], [1, \"2023-11-14 02:40:20\", \"start\"], [1, \"2023-11-14 03:57:20\", \"stop\"], [1, \"2023-11-08 21:13:00\", \"start\"], [1, \"2023-11-09 01:22:00\", \"stop\"], [5, \"2023-11-21 13:25:22\", \"start\"], [5, \"2023-11-21 19:46:22\", \"stop\"], [5, \"2023-11-16 04:37:55\", \"start\"], [5, \"2023-11-16 12:53:55\", \"stop\"], [2, \"2023-11-06 14:03:26\", \"start\"], [2, \"2023-11-06 17:11:26\", \"stop\"], [2, \"2023-11-11 08:18:54\", \"start\"], [2, \"2023-11-11 12:34:54\", \"stop\"], [2, \"2023-11-07 22:54:01\", \"start\"], [2, \"2023-11-08 08:22:01\", \"stop\"], [5, \"2023-11-23 14:08:03\", \"start\"], [5, \"2023-11-23 22:23:03\", \"stop\"], [1, \"2023-11-04 15:20:41\", \"start\"], [1, \"2023-11-04 16:09:41\", \"stop\"], [3, \"2023-11-05 01:24:32\", \"start\"], [3, \"2023-11-05 10:09:32\", \"stop\"], [4, \"2023-11-09 14:15:29\", \"start\"], [4, \"2023-11-09 18:39:29\", \"stop\"], [3, \"2023-11-28 21:43:00\", \"start\"], [3, \"2023-11-29 06:06:00\", \"stop\"], [2, \"2023-11-18 06:23:14\", \"start\"], [2, \"2023-11-18 07:34:14\", \"stop\"], [5, \"2023-11-09 17:27:02\", \"start\"], [5, \"2023-11-10 03:00:02\", \"stop\"], [2, \"2023-11-21 02:41:57\", \"start\"], [2, \"2023-11-21 07:28:57\", \"stop\"], [3, \"2023-11-08 00:36:12\", \"start\"], [3, \"2023-11-08 01:47:12\", \"stop\"], [1, \"2023-11-15 16:13:39\", \"start\"], [1, \"2023-11-15 20:29:39\", \"stop\"], [3, \"2023-11-03 06:25:01\", \"start\"], [3, \"2023-11-03 11:14:01\", \"stop\"], [1, \"2023-11-18 20:49:55\", \"start\"], [1, \"2023-11-18 23:04:55\", \"stop\"], [3, \"2023-11-13 05:02:21\", \"start\"], [3, \"2023-11-13 12:44:21\", \"stop\"], [2, \"2023-11-23 19:00:11\", \"start\"], [2, \"2023-11-24 04:59:11\", \"stop\"], [4, \"2023-11-20 01:16:38\", \"start\"], [4, \"2023-11-20 01:35:38\", \"stop\"], [1, \"2023-11-13 11:21:08\", \"start\"], [1, \"2023-11-13 11:56:08\", \"stop\"], [4, \"2023-11-21 23:09:45\", \"start\"], [4, \"2023-11-22 00:26:45\", \"stop\"], [2, \"2023-11-04 11:19:31\", \"start\"], [2, \"2023-11-04 16:46:31\", \"stop\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"522\", \"totalSubmission\": \"1.1K\", \"totalAcceptedRaw\": 522, \"totalSubmissionRaw\": 1090, \"acRate\": \"47.9%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Servers\": [\"server_id\", \"status_time\", \"session_status\"]}, \"rows\": {\"Servers\": [[4, \"2023-11-29 20:22:50\", \"start\"], [4, \"2023-11-30 04:19:50\", \"stop\"], [2, \"2023-11-18 21:23:09\", \"start\"], [2, \"2023-11-19 00:38:09\", \"stop\"], [5, \"2023-11-27 18:38:16\", \"start\"], [5, \"2023-11-28 02:46:16\", \"stop\"], [4, \"2023-11-27 06:46:42\", \"start\"], [4, \"2023-11-27 08:23:42\", \"stop\"], [5, \"2023-11-11 05:09:45\", \"start\"], [5, \"2023-11-11 06:42:45\", \"stop\"], [5, \"2023-11-27 23:05:58\", \"start\"], [5, \"2023-11-27 23:48:58\", \"stop\"], [5, \"2023-11-14 16:29:34\", \"start\"], [5, \"2023-11-14 19:11:34\", \"stop\"], [1, \"2023-11-02 19:14:15\", \"start\"], [1, \"2023-11-02 20:19:15\", \"stop\"], [5, \"2023-11-03 06:55:30\", \"start\"], [5, \"2023-11-03 11:03:30\", \"stop\"], [4, \"2023-11-02 16:53:28\", \"start\"], [4, \"2023-11-02 22:28:28\", \"stop\"], [2, \"2023-11-20 07:06:41\", \"start\"], [2, \"2023-11-20 15:58:41\", \"stop\"], [1, \"2023-11-22 10:42:35\", \"start\"], [1, \"2023-11-22 19:14:35\", \"stop\"], [3, \"2023-11-23 03:05:39\", \"start\"], [3, \"2023-11-23 10:54:39\", \"stop\"], [3, \"2023-11-15 20:04:15\", \"start\"], [3, \"2023-11-15 21:30:15\", \"stop\"], [3, \"2023-11-12 08:21:42\", \"start\"], [3, \"2023-11-12 17:07:42\", \"stop\"], [1, \"2023-11-02 02:33:24\", \"start\"], [1, \"2023-11-02 12:10:24\", \"stop\"], [4, \"2023-11-14 03:55:29\", \"start\"], [4, \"2023-11-14 08:53:29\", \"stop\"], [2, \"2023-11-04 00:36:53\", \"start\"], [2, \"2023-11-04 00:37:53\", \"stop\"], [4, \"2023-11-08 01:54:18\", \"start\"], [4, \"2023-11-08 09:56:18\", \"stop\"], [1, \"2023-11-24 14:28:11\", \"start\"], [1, \"2023-11-24 21:38:11\", \"stop\"], [3, \"2023-11-20 22:55:03\", \"start\"], [3, \"2023-11-21 02:19:03\", \"stop\"], [3, \"2023-11-12 03:10:22\", \"start\"], [3, \"2023-11-12 08:29:22\", \"stop\"], [2, \"2023-11-02 14:55:46\", \"start\"], [2, \"2023-11-02 16:56:46\", \"stop\"], [1, \"2023-11-09 03:40:44\", \"start\"], [1, \"2023-11-09 03:52:44\", \"stop\"], [5, \"2023-11-16 17:43:28\", \"start\"], [5, \"2023-11-16 20:45:28\", \"stop\"], [2, \"2023-11-08 16:17:24\", \"start\"], [2, \"2023-11-09 00:59:24\", \"stop\"], [4, \"2023-11-25 04:46:06\", \"start\"], [4, \"2023-11-25 11:56:06\", \"stop\"], [2, \"2023-11-05 14:22:34\", \"start\"], [2, \"2023-11-05 21:33:34\", \"stop\"], [1, \"2023-11-02 09:49:22\", \"start\"], [1, \"2023-11-02 15:01:22\", \"stop\"], [5, \"2023-11-08 06:49:10\", \"start\"], [5, \"2023-11-08 13:33:10\", \"stop\"], [1, \"2023-11-22 21:00:23\", \"start\"], [1, \"2023-11-22 22:43:23\", \"stop\"], [3, \"2023-11-06 07:45:50\", \"start\"], [3, \"2023-11-06 15:18:50\", \"stop\"], [3, \"2023-11-02 22:13:17\", \"start\"], [3, \"2023-11-03 03:50:17\", \"stop\"], [1, \"2023-11-14 02:40:20\", \"start\"], [1, \"2023-11-14 03:57:20\", \"stop\"], [1, \"2023-11-08 21:13:00\", \"start\"], [1, \"2023-11-09 01:22:00\", \"stop\"], [5, \"2023-11-21 13:25:22\", \"start\"], [5, \"2023-11-21 19:46:22\", \"stop\"], [5, \"2023-11-16 04:37:55\", \"start\"], [5, \"2023-11-16 12:53:55\", \"stop\"], [2, \"2023-11-06 14:03:26\", \"start\"], [2, \"2023-11-06 17:11:26\", \"stop\"], [2, \"2023-11-11 08:18:54\", \"start\"], [2, \"2023-11-11 12:34:54\", \"stop\"], [2, \"2023-11-07 22:54:01\", \"start\"], [2, \"2023-11-08 08:22:01\", \"stop\"], [5, \"2023-11-23 14:08:03\", \"start\"], [5, \"2023-11-23 22:23:03\", \"stop\"], [1, \"2023-11-04 15:20:41\", \"start\"], [1, \"2023-11-04 16:09:41\", \"stop\"], [3, \"2023-11-05 01:24:32\", \"start\"], [3, \"2023-11-05 10:09:32\", \"stop\"], [4, \"2023-11-09 14:15:29\", \"start\"], [4, \"2023-11-09 18:39:29\", \"stop\"], [3, \"2023-11-28 21:43:00\", \"start\"], [3, \"2023-11-29 06:06:00\", \"stop\"], [2, \"2023-11-18 06:23:14\", \"start\"], [2, \"2023-11-18 07:34:14\", \"stop\"], [5, \"2023-11-09 17:27:02\", \"start\"], [5, \"2023-11-10 03:00:02\", \"stop\"], [2, \"2023-11-21 02:41:57\", \"start\"], [2, \"2023-11-21 07:28:57\", \"stop\"], [3, \"2023-11-08 00:36:12\", \"start\"], [3, \"2023-11-08 01:47:12\", \"stop\"], [1, \"2023-11-15 16:13:39\", \"start\"], [1, \"2023-11-15 20:29:39\", \"stop\"], [3, \"2023-11-03 06:25:01\", \"start\"], [3, \"2023-11-03 11:14:01\", \"stop\"], [1, \"2023-11-18 20:49:55\", \"start\"], [1, \"2023-11-18 23:04:55\", \"stop\"], [3, \"2023-11-13 05:02:21\", \"start\"], [3, \"2023-11-13 12:44:21\", \"stop\"], [2, \"2023-11-23 19:00:11\", \"start\"], [2, \"2023-11-24 04:59:11\", \"stop\"], [4, \"2023-11-20 01:16:38\", \"start\"], [4, \"2023-11-20 01:35:38\", \"stop\"], [1, \"2023-11-13 11:21:08\", \"start\"], [1, \"2023-11-13 11:56:08\", \"stop\"], [4, \"2023-11-21 23:09:45\", \"start\"], [4, \"2023-11-22 00:26:45\", \"stop\"], [2, \"2023-11-04 11:19:31\", \"start\"], [2, \"2023-11-04 16:46:31\", \"stop\"]]}}", + "metaData": "{\"mysql\": [\"Create table if not exists Servers ( server_id int, status_time timestamp, session_status ENUM ('start','stop'))\"], \"mssql\": [\"Create table Servers (server_id int, status_time datetime, session_status varchar(20) NOT NULL CHECK (session_status in ('start','stop')))\"], \"oraclesql\": [\"Create table Servers (server_id int, status_time date, session_status varchar(20) NOT NULL CHECK (session_status in ('start','stop')))\", \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"], \"database\": true, \"name\": \"server_utilization_time\", \"postgresql\": [\"Create table Servers (server_id int, status_time timestamp, session_status varchar(20) NOT NULL CHECK (session_status in ('start','stop')))\"], \"pythondata\": [\"Servers = pd.DataFrame(columns=['server_id', 'status_time', 'session_status'], dtype={'server_id': 'int', 'status_time': 'datetime64[ns]', 'session_status': pd.CategoricalDtype(categories=['start', 'stop'])})\\n\"], \"database_schema\": {\"Servers\": {\"server_id\": \"INT\", \"status_time\": \"TIMESTAMP\", \"session_status\": \"ENUM('start', 'stop')\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table if not exists Servers ( server_id int, status_time timestamp, session_status ENUM ('start','stop'))", + "Truncate table Servers", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-29 20:22:50', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-30 04:19:50', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-18 21:23:09', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-19 00:38:09', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-27 18:38:16', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-28 02:46:16', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-27 06:46:42', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-27 08:23:42', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-11 05:09:45', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-11 06:42:45', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-27 23:05:58', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-27 23:48:58', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-14 16:29:34', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-14 19:11:34', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 19:14:15', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 20:19:15', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-03 06:55:30', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-03 11:03:30', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-02 16:53:28', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-02 22:28:28', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-20 07:06:41', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-20 15:58:41', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-22 10:42:35', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-22 19:14:35', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-23 03:05:39', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-23 10:54:39', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-15 20:04:15', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-15 21:30:15', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-12 08:21:42', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-12 17:07:42', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 02:33:24', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 12:10:24', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-14 03:55:29', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-14 08:53:29', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-04 00:36:53', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-04 00:37:53', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-08 01:54:18', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-08 09:56:18', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-24 14:28:11', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-24 21:38:11', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-20 22:55:03', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-21 02:19:03', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-12 03:10:22', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-12 08:29:22', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-02 14:55:46', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-02 16:56:46', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-09 03:40:44', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-09 03:52:44', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-16 17:43:28', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-16 20:45:28', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-08 16:17:24', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-09 00:59:24', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-25 04:46:06', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-25 11:56:06', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-05 14:22:34', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-05 21:33:34', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 09:49:22', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-02 15:01:22', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-08 06:49:10', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-08 13:33:10', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-22 21:00:23', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-22 22:43:23', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-06 07:45:50', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-06 15:18:50', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-02 22:13:17', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-03 03:50:17', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-14 02:40:20', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-14 03:57:20', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-08 21:13:00', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-09 01:22:00', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-21 13:25:22', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-21 19:46:22', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-16 04:37:55', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-16 12:53:55', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-06 14:03:26', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-06 17:11:26', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-11 08:18:54', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-11 12:34:54', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-07 22:54:01', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-08 08:22:01', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-23 14:08:03', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-23 22:23:03', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-04 15:20:41', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-04 16:09:41', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-05 01:24:32', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-05 10:09:32', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-09 14:15:29', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-09 18:39:29', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-28 21:43:00', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-29 06:06:00', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-18 06:23:14', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-18 07:34:14', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-09 17:27:02', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('5', '2023-11-10 03:00:02', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-21 02:41:57', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-21 07:28:57', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-08 00:36:12', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-08 01:47:12', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-15 16:13:39', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-15 20:29:39', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-03 06:25:01', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-03 11:14:01', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-18 20:49:55', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-18 23:04:55', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-13 05:02:21', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('3', '2023-11-13 12:44:21', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-23 19:00:11', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-24 04:59:11', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-20 01:16:38', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-20 01:35:38', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-13 11:21:08', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('1', '2023-11-13 11:56:08', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-21 23:09:45', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('4', '2023-11-22 00:26:45', 'stop')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-04 11:19:31', 'start')", + "insert into Servers (server_id, status_time, session_status) values ('2', '2023-11-04 16:46:31', 'stop')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/block-placement-queries.json b/leetcode/originData/block-placement-queries.json new file mode 100644 index 00000000..978695c5 --- /dev/null +++ b/leetcode/originData/block-placement-queries.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3435", + "questionFrontendId": "3161", + "boundTopicId": null, + "title": "Block Placement Queries", + "titleSlug": "block-placement-queries", + "content": "There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis.
\n\nYou are given a 2D array queries, which contains two types of queries:
queries[i] = [1, x]. Build an obstacle at distance x from the origin. It is guaranteed that there is no obstacle at distance x when the query is asked.queries[i] = [2, x, sz]. Check if it is possible to place a block of size sz anywhere in the range [0, x] on the line, such that the block entirely lies in the range [0, x]. A block cannot be placed if it intersects with any obstacle, but it may touch it. Note that you do not actually place the block. Queries are separate.Return a boolean array results, where results[i] is true if you can place the block specified in the ith query of type 2, and false otherwise.
\n
Example 1:
\n\nInput: queries = [[1,2],[2,3,3],[2,3,1],[2,2,2]]
\n\nOutput: [false,true,true]
\n\nExplanation:
\n\n
For query 0, place an obstacle at x = 2. A block of size at most 2 can be placed before x = 3.
Example 2:
\n\nInput: queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]
\n\nOutput: [true,true,false]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/22/example1block.png\")
x = 7 for query 0. A block of size at most 7 can be placed before x = 7.x = 2 for query 2. Now, a block of size at most 5 can be placed before x = 7, and a block of size at most 2 before x = 2.\n
Constraints:
\n\n1 <= queries.length <= 15 * 1042 <= queries[i].length <= 31 <= queries[i][0] <= 21 <= x, sz <= min(5 * 104, 3 * queries.length)x when the query is asked.d[x] be the distance of the next obstacle after x.",
+ "For each query of type 2, we just need to check if max(d[0], d[1], d[2], …d[x - sz]) > sz.",
+ "Use segment tree to maintain d[x]."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[[1,2],[2,3,3],[2,3,1],[2,2,2]]",
+ "metaData": "{\n \"name\": \"getResults\",\n \"params\": [\n {\n \"name\": \"queries\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"listCompiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-days-without-meetings.json b/leetcode/originData/count-days-without-meetings.json new file mode 100644 index 00000000..25ff3890 --- /dev/null +++ b/leetcode/originData/count-days-without-meetings.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3430", + "questionFrontendId": "3169", + "boundTopicId": null, + "title": "Count Days Without Meetings", + "titleSlug": "count-days-without-meetings", + "content": "You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive).
Return the count of days when the employee is available for work but no meetings are scheduled.
\n\nNote: The meetings may overlap.
\n\n\n
Example 1:
\n\nInput: days = 10, meetings = [[5,7],[1,3],[9,10]]
\n\nOutput: 2
\n\nExplanation:
\n\nThere is no meeting scheduled on the 4th and 8th days.
\nExample 2:
\n\nInput: days = 5, meetings = [[2,4],[1,3]]
\n\nOutput: 1
\n\nExplanation:
\n\nThere is no meeting scheduled on the 5th day.
\nExample 3:
\n\nInput: days = 6, meetings = [[1,6]]
\n\nOutput: 0
\n\nExplanation:
\n\nMeetings are scheduled for all working days.
\n\n
Constraints:
\n\n1 <= days <= 1091 <= meetings.length <= 105meetings[i].length == 21 <= meetings[i][0] <= meetings[i][1] <= daysCompiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-subarray-with-bitwise-and-closest-to-k.json b/leetcode/originData/find-subarray-with-bitwise-and-closest-to-k.json new file mode 100644 index 00000000..7ccab7b8 --- /dev/null +++ b/leetcode/originData/find-subarray-with-bitwise-and-closest-to-k.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3436", + "questionFrontendId": "3171", + "boundTopicId": null, + "title": "Find Subarray With Bitwise AND Closest to K", + "titleSlug": "find-subarray-with-bitwise-and-closest-to-k", + "content": "You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise AND of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] AND nums[l + 1] ... AND nums[r])| is minimum.
Return the minimum possible value of the absolute difference.
\n\nA subarray is a contiguous non-empty sequence of elements within an array.
\n\n\n
Example 1:
\n\nInput: nums = [1,2,4,5], k = 3
\n\nOutput: 1
\n\nExplanation:
\n\nThe subarray nums[2..3] has AND value 4, which gives the minimum absolute difference |3 - 4| = 1.
Example 2:
\n\nInput: nums = [1,2,1,2], k = 2
\n\nOutput: 0
\n\nExplanation:
\n\nThe subarray nums[1..1] has AND value 2, which gives the minimum absolute difference |2 - 2| = 0.
Example 3:
\n\nInput: nums = [1], k = 10
\n\nOutput: 9
\n\nExplanation:
\n\nThere is a single subarray with AND value 1, which gives the minimum absolute difference |10 - 1| = 9.
\n
Constraints:
\n\n1 <= nums.length <= 1051 <= nums[i] <= 1091 <= k <= 109dp[i] be the set of all the bitwise AND of all the subarrays ending at index i.",
+ "We start from nums[i], taking the bitwise AND result by including elements one by one from i towards left. Notice that only set bits can become unset on adding a element, and unset bits never become set again.",
+ "Hence dp[i] can contain at most 30 elements."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,4,5]\n3",
+ "metaData": "{\n \"name\": \"minimumDifference\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-median-of-the-uniqueness-array.json b/leetcode/originData/find-the-median-of-the-uniqueness-array.json new file mode 100644 index 00000000..ed8399fb --- /dev/null +++ b/leetcode/originData/find-the-median-of-the-uniqueness-array.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3362", + "questionFrontendId": "3134", + "boundTopicId": null, + "title": "Find the Median of the Uniqueness Array", + "titleSlug": "find-the-median-of-the-uniqueness-array", + "content": "You are given an integer array nums. The uniqueness array of nums is the sorted array that contains the number of distinct elements of all the subarrays of nums. In other words, it is a sorted array consisting of distinct(nums[i..j]), for all 0 <= i <= j < nums.length.
Here, distinct(nums[i..j]) denotes the number of distinct elements in the subarray that starts at index i and ends at index j.
Return the median of the uniqueness array of nums.
Note that the median of an array is defined as the middle element of the array when it is sorted in non-decreasing order. If there are two choices for a median, the smaller of the two values is taken.
\n\n\n
Example 1:
\n\nInput: nums = [1,2,3]
\n\nOutput: 1
\n\nExplanation:
\n\nThe uniqueness array of nums is [distinct(nums[0..0]), distinct(nums[1..1]), distinct(nums[2..2]), distinct(nums[0..1]), distinct(nums[1..2]), distinct(nums[0..2])] which is equal to [1, 1, 1, 2, 2, 3]. The uniqueness array has a median of 1. Therefore, the answer is 1.
Example 2:
\n\nInput: nums = [3,4,3,4,5]
\n\nOutput: 2
\n\nExplanation:
\n\nThe uniqueness array of nums is [1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2.
Example 3:
\n\nInput: nums = [4,3,5,4]
\n\nOutput: 2
\n\nExplanation:
\n\nThe uniqueness array of nums is [1, 1, 1, 1, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2.
\n
Constraints:
\n\n1 <= nums.length <= 1051 <= nums[i] <= 105x, you need to check if x is the median, to the left of the median, or to the right of the median. You can do that by counting the number of sub-arrays nums[i…j] such that distinct(num[i…j]) <= x.",
+ "Use the sliding window to solve the counting problem in the hint above."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,3]",
+ "metaData": "{\n \"name\": \"medianOfUniquenessArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-minimum-cost-array-permutation.json b/leetcode/originData/find-the-minimum-cost-array-permutation.json new file mode 100644 index 00000000..346fe7d9 --- /dev/null +++ b/leetcode/originData/find-the-minimum-cost-array-permutation.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3431", + "questionFrontendId": "3149", + "boundTopicId": null, + "title": "Find the Minimum Cost Array Permutation", + "titleSlug": "find-the-minimum-cost-array-permutation", + "content": "You are given an array nums which is a permutation of [0, 1, 2, ..., n - 1]. The score of any permutation of [0, 1, 2, ..., n - 1] named perm is defined as:
score(perm) = |perm[0] - nums[perm[1]]| + |perm[1] - nums[perm[2]]| + ... + |perm[n - 1] - nums[perm[0]]|
Return the permutation perm which has the minimum possible score. If multiple permutations exist with this score, return the one that is lexicographically smallest among them.
\n
Example 1:
\n\nInput: nums = [1,0,2]
\n\nOutput: [0,1,2]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/04/example0gif.gif\")
The lexicographically smallest permutation with minimum cost is [0,1,2]. The cost of this permutation is |0 - 0| + |1 - 2| + |2 - 1| = 2.
Example 2:
\n\nInput: nums = [0,2,1]
\n\nOutput: [0,2,1]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/04/example1gif.gif\")
The lexicographically smallest permutation with minimum cost is [0,2,1]. The cost of this permutation is |0 - 1| + |2 - 2| + |1 - 0| = 2.
\n
Constraints:
\n\n2 <= n == nums.length <= 14nums is a permutation of [0, 1, 2, ..., n - 1].perm[0] = 0 for the smallest lexical order.",
+ "It’s similar to the Traveling Salesman Problem. Use Dynamic Programming.",
+ "Use a bitmask to track which elements have been assigned to perm."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,0,2]",
+ "metaData": "{\n \"name\": \"findPermutation\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-number-of-distinct-colors-among-the-balls.json b/leetcode/originData/find-the-number-of-distinct-colors-among-the-balls.json new file mode 100644 index 00000000..32bcf797 --- /dev/null +++ b/leetcode/originData/find-the-number-of-distinct-colors-among-the-balls.json @@ -0,0 +1,179 @@ +{ + "data": { + "question": { + "questionId": "3434", + "questionFrontendId": "3160", + "boundTopicId": null, + "title": "Find the Number of Distinct Colors Among the Balls", + "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", + "content": "You are given an integer limit and a 2D array queries of size n x 2.
There are limit + 1 balls with distinct labels in the range [0, limit]. Initially, all balls are uncolored. For every query in queries that is of the form [x, y], you mark ball x with the color y. After each query, you need to find the number of distinct colors among the balls.
Return an array result of length n, where result[i] denotes the number of distinct colors after ith query.
Note that when answering a query, lack of a color will not be considered as a color.
\n\n\n
Example 1:
\n\nInput: limit = 4, queries = [[1,4],[2,5],[1,3],[3,4]]
\n\nOutput: [1,2,2,3]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/17/ezgifcom-crop.gif\")
Example 2:
\n\nInput: limit = 4, queries = [[0,1],[1,2],[2,2],[3,4],[4,5]]
\n\nOutput: [1,2,2,3,4]
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/17/ezgifcom-crop2.gif\")
\n
Constraints:
\n\n1 <= limit <= 1091 <= n == queries.length <= 105queries[i].length == 20 <= queries[i][0] <= limit1 <= queries[i][1] <= 109Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-number-of-good-pairs-ii.json b/leetcode/originData/find-the-number-of-good-pairs-ii.json new file mode 100644 index 00000000..0dbe8d6a --- /dev/null +++ b/leetcode/originData/find-the-number-of-good-pairs-ii.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "3444", + "questionFrontendId": "3164", + "boundTopicId": null, + "title": "Find the Number of Good Pairs II", + "titleSlug": "find-the-number-of-good-pairs-ii", + "content": "You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
Return the total number of good pairs.
\n\n\n
Example 1:
\n\nInput: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\nOutput: 5
\n\nExplanation:
\nThe 5 good pairs are(0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:
\n\nInput: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\nOutput: 2
\n\nExplanation:
\n\nThe 2 good pairs are (3, 0) and (3, 1).
\n
Constraints:
\n\n1 <= n, m <= 1051 <= nums1[i], nums2[j] <= 1061 <= k <= 103f[v] be the number of occurrences of v/k in nums2.",
+ "For each value v in nums1, enumerating all its factors d (in sqrt(v) time) and sum up all the f[d] to get the final answer.",
+ "It is also possible to improve the complexity from v * sqrt(v) to v * log(v) - How?"
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,3,4]\n[1,3,4]\n1",
+ "metaData": "{\n \"name\": \"numberOfPairs\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/lexicographically-minimum-string-after-removing-stars.json b/leetcode/originData/lexicographically-minimum-string-after-removing-stars.json new file mode 100644 index 00000000..65ad9f56 --- /dev/null +++ b/leetcode/originData/lexicographically-minimum-string-after-removing-stars.json @@ -0,0 +1,189 @@ +{ + "data": { + "question": { + "questionId": "3445", + "questionFrontendId": "3170", + "boundTopicId": null, + "title": "Lexicographically Minimum String After Removing Stars", + "titleSlug": "lexicographically-minimum-string-after-removing-stars", + "content": "You are given a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.
While there is a '*', do the following operation:
'*' and the smallest non-'*' character to its left. If there are several smallest characters, you can delete any of them.Return the lexicographically smallest resulting string after removing all '*' characters.
\n
Example 1:
\n\nInput: s = "aaba*"
\n\nOutput: "aab"
\n\nExplanation:
\n\nWe should delete one of the 'a' characters with '*'. If we choose s[3], s becomes the lexicographically smallest.
Example 2:
\n\nInput: s = "abc"
\n\nOutput: "abc"
\n\nExplanation:
\n\nThere is no '*' in the string.
\n
Constraints:
\n\n1 <= s.length <= 105s consists only of lowercase English letters and '*'.'*' characters.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-cost-to-equalize-array.json b/leetcode/originData/minimum-cost-to-equalize-array.json new file mode 100644 index 00000000..284a1aba --- /dev/null +++ b/leetcode/originData/minimum-cost-to-equalize-array.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "3402", + "questionFrontendId": "3139", + "boundTopicId": null, + "title": "Minimum Cost to Equalize Array", + "titleSlug": "minimum-cost-to-equalize-array", + "content": "You are given an integer array nums and two integers cost1 and cost2. You are allowed to perform either of the following operations any number of times:
i from nums and increase nums[i] by 1 for a cost of cost1.i, j, from nums and increase nums[i] and nums[j] by 1 for a cost of cost2.Return the minimum cost required to make all elements in the array equal.
\n\nSince the answer may be very large, return it modulo 109 + 7.
\n
Example 1:
\n\nInput: nums = [4,1], cost1 = 5, cost2 = 2
\n\nOutput: 15
\n\nExplanation:
\n\nThe following operations can be performed to make the values equal:
\n\nnums[1] by 1 for a cost of 5. nums becomes [4,2].nums[1] by 1 for a cost of 5. nums becomes [4,3].nums[1] by 1 for a cost of 5. nums becomes [4,4].The total cost is 15.
\nExample 2:
\n\nInput: nums = [2,3,3,3,5], cost1 = 2, cost2 = 1
\n\nOutput: 6
\n\nExplanation:
\n\nThe following operations can be performed to make the values equal:
\n\nnums[0] and nums[1] by 1 for a cost of 1. nums becomes [3,4,3,3,5].nums[0] and nums[2] by 1 for a cost of 1. nums becomes [4,4,4,3,5].nums[0] and nums[3] by 1 for a cost of 1. nums becomes [5,4,4,4,5].nums[1] and nums[2] by 1 for a cost of 1. nums becomes [5,5,5,4,5].nums[3] by 1 for a cost of 2. nums becomes [5,5,5,5,5].The total cost is 6.
\nExample 3:
\n\nInput: nums = [3,5,3], cost1 = 1, cost2 = 3
\n\nOutput: 4
\n\nExplanation:
\n\nThe following operations can be performed to make the values equal:
\n\nnums[0] by 1 for a cost of 1. nums becomes [4,5,3].nums[0] by 1 for a cost of 1. nums becomes [5,5,3].nums[2] by 1 for a cost of 1. nums becomes [5,5,4].nums[2] by 1 for a cost of 1. nums becomes [5,5,5].The total cost is 4.
\n\n
Constraints:
\n\n1 <= nums.length <= 1051 <= nums[i] <= 1061 <= cost1 <= 1061 <= cost2 <= 106cost2 > cost1 * 2, we should just use cost1 to change all the values to the maximum one.",
+ "Otherwise, it's optimal to choose the smallest two values and use cost2 to increase both of them.",
+ "Since the maximum value is known, calculate the required increases to equalize all values, instead of naively simulating the operations.",
+ "There are not a lot of candidates for the maximum; we can try all of them and choose which uses the minimum number of operations."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[4,1]\n5\n2",
+ "metaData": "{\n \"name\": \"minCostToEqualizeArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"cost1\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"cost2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-length-of-anagram-concatenation.json b/leetcode/originData/minimum-length-of-anagram-concatenation.json new file mode 100644 index 00000000..d3c16908 --- /dev/null +++ b/leetcode/originData/minimum-length-of-anagram-concatenation.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3395", + "questionFrontendId": "3138", + "boundTopicId": null, + "title": "Minimum Length of Anagram Concatenation", + "titleSlug": "minimum-length-of-anagram-concatenation", + "content": "You are given a string s, which is known to be a concatenation of anagrams of some string t.
Return the minimum possible length of the string t.
An anagram is formed by rearranging the letters of a string. For example, "aab", "aba", and, "baa" are anagrams of "aab".
\n\n\n
Example 1:
\n\nInput: s = "abba"
\n\nOutput: 2
\n\nExplanation:
\n\nOne possible string t could be "ba".
Example 2:
\n\nInput: s = "cdef"
\n\nOutput: 4
\n\nExplanation:
\n\nOne possible string t could be "cdef", notice that t can be equal to s.
\n
Constraints:
\n\n1 <= s.length <= 105s consist only of lowercase English letters.s.length.",
+ "Check each candidate naively."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "\"abba\"",
+ "metaData": "{\n \"name\": \"minAnagramLength\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-substring-partition-of-equal-character-frequency.json b/leetcode/originData/minimum-substring-partition-of-equal-character-frequency.json new file mode 100644 index 00000000..24d68bd9 --- /dev/null +++ b/leetcode/originData/minimum-substring-partition-of-equal-character-frequency.json @@ -0,0 +1,186 @@ +{ + "data": { + "question": { + "questionId": "3403", + "questionFrontendId": "3144", + "boundTopicId": null, + "title": "Minimum Substring Partition of Equal Character Frequency", + "titleSlug": "minimum-substring-partition-of-equal-character-frequency", + "content": "Given a string s, you need to partition it into one or more balanced substrings. For example, if s == "ababcc" then ("abab", "c", "c"), ("ab", "abc", "c"), and ("ababcc") are all valid partitions, but ("a", "bab", "cc"), ("aba", "bc", "c"), and ("ab", "abcc") are not. The unbalanced substrings are bolded.
Return the minimum number of substrings that you can partition s into.
Note: A balanced string is a string where each character in the string occurs the same number of times.
\n\n\n
Example 1:
\n\nInput: s = "fabccddg"
\n\nOutput: 3
\n\nExplanation:
\n\nWe can partition the string s into 3 substrings in one of the following ways: ("fab, "ccdd", "g"), or ("fabc", "cd", "dg").
Example 2:
\n\nInput: s = "abababaccddb"
\n\nOutput: 2
\n\nExplanation:
\n\nWe can partition the string s into 2 substrings like so: ("abab", "abaccddb").
\n
Constraints:
\n\n1 <= s.length <= 1000s consists only of English lowercase letters.dp[i] be the minimum number of partitions for the prefix ending at index i + 1.",
+ "dp[i] can be calculated as the min(dp[j]) over all j such that j < i and word[j+1…i] is valid."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "\"fabccddg\"",
+ "metaData": "{\n \"name\": \"minimumSubstringsInPartition\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/special-array-ii.json b/leetcode/originData/special-array-ii.json new file mode 100644 index 00000000..0bc0518b --- /dev/null +++ b/leetcode/originData/special-array-ii.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3427", + "questionFrontendId": "3152", + "boundTopicId": null, + "title": "Special Array II", + "titleSlug": "special-array-ii", + "content": "An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
\n\nYou are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [fromi, toi] your task is to check that subarray nums[fromi..toi] is special or not.
Return an array of booleans answer such that answer[i] is true if nums[fromi..toi] is special.
\n
Example 1:
\n\nInput: nums = [3,4,1,2,6], queries = [[0,4]]
\n\nOutput: [false]
\n\nExplanation:
\n\nThe subarray is [3,4,1,2,6]. 2 and 6 are both even.
Example 2:
\n\nInput: nums = [4,3,1,6], queries = [[0,2],[2,3]]
\n\nOutput: [false,true]
\n\nExplanation:
\n\n[4,3,1]. 3 and 1 are both odd. So the answer to this query is false.[1,6]. There is only one pair: (1,6) and it contains numbers with different parity. So the answer to this query is true.\n
Constraints:
\n\n1 <= nums.length <= 1051 <= nums[i] <= 1051 <= queries.length <= 105queries[i].length == 20 <= queries[i][0] <= queries[i][1] <= nums.length - 1Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/string-compression-iii.json b/leetcode/originData/string-compression-iii.json new file mode 100644 index 00000000..d57990a6 --- /dev/null +++ b/leetcode/originData/string-compression-iii.json @@ -0,0 +1,167 @@ +{ + "data": { + "question": { + "questionId": "3451", + "questionFrontendId": "3163", + "boundTopicId": null, + "title": "String Compression III", + "titleSlug": "string-compression-iii", + "content": "Given a string word, compress it using the following algorithm:
comp. While word is not empty, use the following operation:\n\n\tword made of a single character c repeating at most 9 times.c to comp.Return the string comp.
\n
Example 1:
\n\nInput: word = "abcde"
\n\nOutput: "1a1b1c1d1e"
\n\nExplanation:
\n\nInitially, comp = "". Apply the operation 5 times, choosing "a", "b", "c", "d", and "e" as the prefix in each operation.
For each prefix, append "1" followed by the character to comp.
Example 2:
\n\nInput: word = "aaaaaaaaaaaaaabb"
\n\nOutput: "9a5a2b"
\n\nExplanation:
\n\nInitially, comp = "". Apply the operation 3 times, choosing "aaaaaaaaa", "aaaaa", and "bb" as the prefix in each operation.
"aaaaaaaaa", append "9" followed by "a" to comp."aaaaa", append "5" followed by "a" to comp."bb", append "2" followed by "b" to comp.\n
Constraints:
\n\n1 <= word.length <= 2 * 105word consists only of lowercase English letters.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. Adding an item to a hash.\\r\\n
\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n2. Looking up an item in a hash:\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n\\r\\n\\r\\n\\r\\n3. Deleting an item in a hash:\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n\\r\\n\"], \"csharp\": [\"C#\", \"C# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.
\\r\\n\\r\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/problem/block-placement-queries.html b/leetcode/problem/block-placement-queries.html new file mode 100644 index 00000000..7cd6ffc4 --- /dev/null +++ b/leetcode/problem/block-placement-queries.html @@ -0,0 +1,54 @@ +There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis.
+ +You are given a 2D array queries, which contains two types of queries:
queries[i] = [1, x]. Build an obstacle at distance x from the origin. It is guaranteed that there is no obstacle at distance x when the query is asked.queries[i] = [2, x, sz]. Check if it is possible to place a block of size sz anywhere in the range [0, x] on the line, such that the block entirely lies in the range [0, x]. A block cannot be placed if it intersects with any obstacle, but it may touch it. Note that you do not actually place the block. Queries are separate.Return a boolean array results, where results[i] is true if you can place the block specified in the ith query of type 2, and false otherwise.
+
Example 1:
+ +Input: queries = [[1,2],[2,3,3],[2,3,1],[2,2,2]]
+ +Output: [false,true,true]
+ +Explanation:
+ +
For query 0, place an obstacle at x = 2. A block of size at most 2 can be placed before x = 3.
Example 2:
+ +Input: queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]
+ +Output: [true,true,false]
+ +Explanation:
+ +
x = 7 for query 0. A block of size at most 7 can be placed before x = 7.x = 2 for query 2. Now, a block of size at most 5 can be placed before x = 7, and a block of size at most 2 before x = 2.+
Constraints:
+ +1 <= queries.length <= 15 * 1042 <= queries[i].length <= 31 <= queries[i][0] <= 21 <= x, sz <= min(5 * 104, 3 * queries.length)x when the query is asked.You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive).
Return the count of days when the employee is available for work but no meetings are scheduled.
+ +Note: The meetings may overlap.
+ ++
Example 1:
+ +Input: days = 10, meetings = [[5,7],[1,3],[9,10]]
+ +Output: 2
+ +Explanation:
+ +There is no meeting scheduled on the 4th and 8th days.
+Example 2:
+ +Input: days = 5, meetings = [[2,4],[1,3]]
+ +Output: 1
+ +Explanation:
+ +There is no meeting scheduled on the 5th day.
+Example 3:
+ +Input: days = 6, meetings = [[1,6]]
+ +Output: 0
+ +Explanation:
+ +Meetings are scheduled for all working days.
++
Constraints:
+ +1 <= days <= 1091 <= meetings.length <= 105meetings[i].length == 21 <= meetings[i][0] <= meetings[i][1] <= daysYou are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise AND of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] AND nums[l + 1] ... AND nums[r])| is minimum.
Return the minimum possible value of the absolute difference.
+ +A subarray is a contiguous non-empty sequence of elements within an array.
+ ++
Example 1:
+ +Input: nums = [1,2,4,5], k = 3
+ +Output: 1
+ +Explanation:
+ +The subarray nums[2..3] has AND value 4, which gives the minimum absolute difference |3 - 4| = 1.
Example 2:
+ +Input: nums = [1,2,1,2], k = 2
+ +Output: 0
+ +Explanation:
+ +The subarray nums[1..1] has AND value 2, which gives the minimum absolute difference |2 - 2| = 0.
Example 3:
+ +Input: nums = [1], k = 10
+ +Output: 9
+ +Explanation:
+ +There is a single subarray with AND value 1, which gives the minimum absolute difference |10 - 1| = 9.
+
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 1091 <= k <= 109You are given an integer array nums. The uniqueness array of nums is the sorted array that contains the number of distinct elements of all the subarrays of nums. In other words, it is a sorted array consisting of distinct(nums[i..j]), for all 0 <= i <= j < nums.length.
Here, distinct(nums[i..j]) denotes the number of distinct elements in the subarray that starts at index i and ends at index j.
Return the median of the uniqueness array of nums.
Note that the median of an array is defined as the middle element of the array when it is sorted in non-decreasing order. If there are two choices for a median, the smaller of the two values is taken.
+ ++
Example 1:
+ +Input: nums = [1,2,3]
+ +Output: 1
+ +Explanation:
+ +The uniqueness array of nums is [distinct(nums[0..0]), distinct(nums[1..1]), distinct(nums[2..2]), distinct(nums[0..1]), distinct(nums[1..2]), distinct(nums[0..2])] which is equal to [1, 1, 1, 2, 2, 3]. The uniqueness array has a median of 1. Therefore, the answer is 1.
Example 2:
+ +Input: nums = [3,4,3,4,5]
+ +Output: 2
+ +Explanation:
+ +The uniqueness array of nums is [1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2.
Example 3:
+ +Input: nums = [4,3,5,4]
+ +Output: 2
+ +Explanation:
+ +The uniqueness array of nums is [1, 1, 1, 1, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2.
+
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 105You are given an array nums which is a permutation of [0, 1, 2, ..., n - 1]. The score of any permutation of [0, 1, 2, ..., n - 1] named perm is defined as:
score(perm) = |perm[0] - nums[perm[1]]| + |perm[1] - nums[perm[2]]| + ... + |perm[n - 1] - nums[perm[0]]|
Return the permutation perm which has the minimum possible score. If multiple permutations exist with this score, return the one that is lexicographically smallest among them.
+
Example 1:
+ +Input: nums = [1,0,2]
+ +Output: [0,1,2]
+ +Explanation:
+ +
The lexicographically smallest permutation with minimum cost is [0,1,2]. The cost of this permutation is |0 - 0| + |1 - 2| + |2 - 1| = 2.
Example 2:
+ +Input: nums = [0,2,1]
+ +Output: [0,2,1]
+ +Explanation:
+ +
The lexicographically smallest permutation with minimum cost is [0,2,1]. The cost of this permutation is |0 - 1| + |2 - 2| + |1 - 0| = 2.
+
Constraints:
+ +2 <= n == nums.length <= 14nums is a permutation of [0, 1, 2, ..., n - 1].You are given an integer limit and a 2D array queries of size n x 2.
There are limit + 1 balls with distinct labels in the range [0, limit]. Initially, all balls are uncolored. For every query in queries that is of the form [x, y], you mark ball x with the color y. After each query, you need to find the number of distinct colors among the balls.
Return an array result of length n, where result[i] denotes the number of distinct colors after ith query.
Note that when answering a query, lack of a color will not be considered as a color.
+ ++
Example 1:
+ +Input: limit = 4, queries = [[1,4],[2,5],[1,3],[3,4]]
+ +Output: [1,2,2,3]
+ +Explanation:
+ +
Example 2:
+ +Input: limit = 4, queries = [[0,1],[1,2],[2,2],[3,4],[4,5]]
+ +Output: [1,2,2,3,4]
+ +Explanation:
+ +
+
Constraints:
+ +1 <= limit <= 1091 <= n == queries.length <= 105queries[i].length == 20 <= queries[i][0] <= limit1 <= queries[i][1] <= 109You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
Return the total number of good pairs.
+ ++
Example 1:
+ +Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
+ +Output: 5
+ +Explanation:
+The 5 good pairs are(0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:
+ +Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
+ +Output: 2
+ +Explanation:
+ +The 2 good pairs are (3, 0) and (3, 1).
+
Constraints:
+ +1 <= n, m <= 1051 <= nums1[i], nums2[j] <= 1061 <= k <= 103You are given a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.
While there is a '*', do the following operation:
'*' and the smallest non-'*' character to its left. If there are several smallest characters, you can delete any of them.Return the lexicographically smallest resulting string after removing all '*' characters.
+
Example 1:
+ +Input: s = "aaba*"
+ +Output: "aab"
+ +Explanation:
+ +We should delete one of the 'a' characters with '*'. If we choose s[3], s becomes the lexicographically smallest.
Example 2:
+ +Input: s = "abc"
+ +Output: "abc"
+ +Explanation:
+ +There is no '*' in the string.
+
Constraints:
+ +1 <= s.length <= 105s consists only of lowercase English letters and '*'.'*' characters.You are given an integer array nums and two integers cost1 and cost2. You are allowed to perform either of the following operations any number of times:
i from nums and increase nums[i] by 1 for a cost of cost1.i, j, from nums and increase nums[i] and nums[j] by 1 for a cost of cost2.Return the minimum cost required to make all elements in the array equal.
+ +Since the answer may be very large, return it modulo 109 + 7.
+
Example 1:
+ +Input: nums = [4,1], cost1 = 5, cost2 = 2
+ +Output: 15
+ +Explanation:
+ +The following operations can be performed to make the values equal:
+ +nums[1] by 1 for a cost of 5. nums becomes [4,2].nums[1] by 1 for a cost of 5. nums becomes [4,3].nums[1] by 1 for a cost of 5. nums becomes [4,4].The total cost is 15.
+Example 2:
+ +Input: nums = [2,3,3,3,5], cost1 = 2, cost2 = 1
+ +Output: 6
+ +Explanation:
+ +The following operations can be performed to make the values equal:
+ +nums[0] and nums[1] by 1 for a cost of 1. nums becomes [3,4,3,3,5].nums[0] and nums[2] by 1 for a cost of 1. nums becomes [4,4,4,3,5].nums[0] and nums[3] by 1 for a cost of 1. nums becomes [5,4,4,4,5].nums[1] and nums[2] by 1 for a cost of 1. nums becomes [5,5,5,4,5].nums[3] by 1 for a cost of 2. nums becomes [5,5,5,5,5].The total cost is 6.
+Example 3:
+ +Input: nums = [3,5,3], cost1 = 1, cost2 = 3
+ +Output: 4
+ +Explanation:
+ +The following operations can be performed to make the values equal:
+ +nums[0] by 1 for a cost of 1. nums becomes [4,5,3].nums[0] by 1 for a cost of 1. nums becomes [5,5,3].nums[2] by 1 for a cost of 1. nums becomes [5,5,4].nums[2] by 1 for a cost of 1. nums becomes [5,5,5].The total cost is 4.
++
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 1061 <= cost1 <= 1061 <= cost2 <= 106You are given a string s, which is known to be a concatenation of anagrams of some string t.
Return the minimum possible length of the string t.
An anagram is formed by rearranging the letters of a string. For example, "aab", "aba", and, "baa" are anagrams of "aab".
+ ++
Example 1:
+ +Input: s = "abba"
+ +Output: 2
+ +Explanation:
+ +One possible string t could be "ba".
Example 2:
+ +Input: s = "cdef"
+ +Output: 4
+ +Explanation:
+ +One possible string t could be "cdef", notice that t can be equal to s.
+
Constraints:
+ +1 <= s.length <= 105s consist only of lowercase English letters.Given a string s, you need to partition it into one or more balanced substrings. For example, if s == "ababcc" then ("abab", "c", "c"), ("ab", "abc", "c"), and ("ababcc") are all valid partitions, but ("a", "bab", "cc"), ("aba", "bc", "c"), and ("ab", "abcc") are not. The unbalanced substrings are bolded.
Return the minimum number of substrings that you can partition s into.
Note: A balanced string is a string where each character in the string occurs the same number of times.
+ ++
Example 1:
+ +Input: s = "fabccddg"
+ +Output: 3
+ +Explanation:
+ +We can partition the string s into 3 substrings in one of the following ways: ("fab, "ccdd", "g"), or ("fabc", "cd", "dg").
Example 2:
+ +Input: s = "abababaccddb"
+ +Output: 2
+ +Explanation:
+ +We can partition the string s into 2 substrings like so: ("abab", "abaccddb").
+
Constraints:
+ +1 <= s.length <= 1000s consists only of English lowercase letters.An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
+ +You are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [fromi, toi] your task is to check that subarray nums[fromi..toi] is special or not.
Return an array of booleans answer such that answer[i] is true if nums[fromi..toi] is special.
+
Example 1:
+ +Input: nums = [3,4,1,2,6], queries = [[0,4]]
+ +Output: [false]
+ +Explanation:
+ +The subarray is [3,4,1,2,6]. 2 and 6 are both even.
Example 2:
+ +Input: nums = [4,3,1,6], queries = [[0,2],[2,3]]
+ +Output: [false,true]
+ +Explanation:
+ +[4,3,1]. 3 and 1 are both odd. So the answer to this query is false.[1,6]. There is only one pair: (1,6) and it contains numbers with different parity. So the answer to this query is true.+
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 1051 <= queries.length <= 105queries[i].length == 20 <= queries[i][0] <= queries[i][1] <= nums.length - 1Given a string word, compress it using the following algorithm:
comp. While word is not empty, use the following operation:
+
+ word made of a single character c repeating at most 9 times.c to comp.Return the string comp.
+
Example 1:
+ +Input: word = "abcde"
+ +Output: "1a1b1c1d1e"
+ +Explanation:
+ +Initially, comp = "". Apply the operation 5 times, choosing "a", "b", "c", "d", and "e" as the prefix in each operation.
For each prefix, append "1" followed by the character to comp.
Example 2:
+ +Input: word = "aaaaaaaaaaaaaabb"
+ +Output: "9a5a2b"
+ +Explanation:
+ +Initially, comp = "". Apply the operation 3 times, choosing "aaaaaaaaa", "aaaaa", and "bb" as the prefix in each operation.
"aaaaaaaaa", append "9" followed by "a" to comp."aaaaa", append "5" followed by "a" to comp."bb", append "2" followed by "b" to comp.+
Constraints:
+ +1 <= word.length <= 2 * 105word consists only of lowercase English letters.