Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

command node .vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode",show,82,-x" failed with exit code "1". #863

Open
wangyerdfz opened this issue Feb 10, 2023 · 3 comments
Open

command node .vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode",show,82,-x" failed with exit code "1". #863

wangyerdfz opened this issue Feb 10, 2023 · 3 comments

Comments

@wangyerdfz
Copy link

wangyerdfz commented Feb 10, 2023 •
edited
Loading

🐛 Bug Report

this bug showed after I updated vscode to 1.75.1

double click any problem. leet code would still work, but it says

"""

Command "node "/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode",show,76,-x" failed with exit code "1".

After running the command in bash I think there's probably an error somewhere in the script since It's running "leetcode," instead of "leetcode", which prompts the error? see the following

code-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode", show,76,-x
node:internal/modules/cjs/loader:1063
throw err;
^

Error: Cannot find module '/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode,'
at Module._resolveFilename (node:internal/modules/cjs/loader:1060:15)
at Module._load (node:internal/modules/cjs/loader:905:27)
at Function.executeUserEntryPoint [as runMain] (node:internal/modules/run_main:83:12)
at node:internal/main/run_main_module:23:47 {
code: 'MODULE_NOT_FOUND',
requireStack: []
}

"""

with 76 being the problem number. but really any number would do

To Reproduce

just click and open any problem

Expected behavior

I expect no error message

Extension Output

(node:2798) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
[76] Minimum Window Substring
[76] Minimum Window Substring

https://leetcode.com/problems/minimum-window-substring/description/

https://leetcode.com/problems/minimum-window-substring/description/

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms

  • Hard (40.65%)

  • Likes: 14232

  • Dislikes: 616

  • algorithms

  • Hard (40.65%)

  • Likes: 14232

  • Dislikes: 616

  • Total Accepted: 964.2K

  • Total Accepted: 964.2K

  • Total Submissions: 2.4M

  • Total Submissions: 2.4M

  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

(node:2805) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
(node:2804) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
[76] Minimum Window Substring

https://leetcode.com/problems/minimum-window-substring/description/

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms
  • Hard (40.65%)
  • Likes: 14232
  • Dislikes: 616
  • Total Accepted: 964.2K
  • Total Submissions: 2.4M
  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

(node:2809) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
[77] Combinations
[77] Combinations

https://leetcode.com/problems/combinations/description/

Tags: algorithms backtracking

https://leetcode.com/problems/combinations/description/

Tags: algorithms backtracking

Langs: c cpp csharp elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms

Langs: c cpp csharp elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms
  • Medium (64.10%)
  • Medium (64.10%)
  • Likes: 4685
  • Dislikes: 156
  • Likes: 4685
  • Dislikes: 156
  • Total Accepted: 562.6K
  • Total Submissions: 864.1K
  • Total Accepted: 562.6K
  • Total Submissions: 864.1K
  • Testcase Example: '4\n2'
  • Testcase Example: '4\n2'

Given two integers n and k, return all possible combinations of k numbers out of the range [1, n].

You may return the answer in any order.

 

Example 1:

Input: n = 4, k = 2
Output:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

Example 2:

Input: n = 1, k = 1
Output: [[1]]

 

Constraints:

  • 1 <= n <= 20
  • 1 <= k <= n

Given two integers n and k, return all possible combinations of k numbers out of the range [1, n].

You may return the answer in any order.

 

Example 1:

Input: n = 4, k = 2
Output:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

Example 2:

Input: n = 1, k = 1
Output: [[1]]

 

Constraints:

  • 1 <= n <= 20
  • 1 <= k <= n

(node:2811) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
(node:2810) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
undefined:1

SyntaxError: Unexpected end of JSON input
at JSON.parse ()
at cache.get (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cache.js:22:15)
at Plugin.save (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/plugin.js:57:23)
at Plugin.save (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/plugin.js:213:33)
at initPlugins (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cli.js:63:12)
at cli.run (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cli.js:100:3)
at Object. (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode:3:23)
at Module._compile (node:internal/modules/cjs/loader:1246:14)
at Module._extensions..js (node:internal/modules/cjs/loader:1300:10)
at Module.load (node:internal/modules/cjs/loader:1103:32)

Node.js v19.6.0
[82] Remove Duplicates from Sorted List II

https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/

Tags: algorithms linked-list

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms
  • Medium (45.41%)
  • Likes: 7132
  • Dislikes: 187
  • Total Accepted: 569.3K
  • Total Submissions: 1.2M
  • Testcase Example: '[1,2,3,3,4,4,5]'

Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.

 

Example 1:

Input: head = [1,2,3,3,4,4,5]
Output: [1,2,5]

Example 2:

Input: head = [1,1,1,2,3]
Output: [2,3]

 

Constraints:

  • The number of nodes in the list is in the range [0, 300].
  • -100 <= Node.val <= 100
  • The list is guaranteed to be sorted in ascending order.

(node:2813) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
[76] Minimum Window Substring

https://leetcode.com/problems/minimum-window-substring/description/

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window
[76] Minimum Window Substring

https://leetcode.com/problems/minimum-window-substring/description/

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • Hard (40.65%)

  • Likes: 14232

  • Dislikes: 616

  • algorithms

  • Hard (40.65%)

  • Likes: 14232

  • Dislikes: 616

  • Total Accepted: 964.2K

  • Total Submissions: 2.4M

  • Total Accepted: 964.2K

  • Total Submissions: 2.4M

  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

(node:2815) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
(node:2814) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)
undefined:1

SyntaxError: Unexpected end of JSON input
at JSON.parse ()
at cache.get (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cache.js:22:15)
at Plugin.save (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/plugin.js:57:23)
at Plugin.save (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/plugin.js:213:33)
at initPlugins (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cli.js:63:12)
at cli.run (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/lib/cli.js:100:3)
at Object. (/Users/[user_name]/.vscode/extensions/leetcode.vscode-leetcode-0.18.1/node_modules/vsc-leetcode-cli/bin/leetcode:3:23)
at Module._compile (node:internal/modules/cjs/loader:1246:14)
at Module._extensions..js (node:internal/modules/cjs/loader:1300:10)
at Module.load (node:internal/modules/cjs/loader:1103:32)

Node.js v19.6.0
[76] Minimum Window Substring

https://leetcode.com/problems/minimum-window-substring/description/

Tags: algorithms facebook linkedin snapchat uber hash-table two-pointers string sliding-window

Langs: c cpp csharp dart elixir erlang golang java javascript kotlin php python python3 racket ruby rust scala swift typescript

  • algorithms
  • Hard (40.65%)
  • Likes: 14232
  • Dislikes: 616
  • Total Accepted: 964.2K
  • Total Submissions: 2.4M
  • Testcase Example: '"ADOBECODEBANC"\n"ABC"'

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

The testcases will be generated such that the answer is unique.

 

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.

Example 2:

Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.

Example 3:

Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.

 

Constraints:

  • m == s.length
  • n == t.length
  • 1 <= m, n <= 105
  • s and t consist of uppercase and lowercase English letters.

 

Follow up: Could you find an algorithm that runs in O(m + n) time?

(node:2844) Warning: Accessing non-existent property 'padLevels' of module exports inside circular dependency
(Use node --trace-warnings ... to show where the warning was created)

Your Environment

  • os:

  • m1 mbp ventura 13.2

  • extension settings:
    {
    "git.ignoreLegacyWarning": true,
    "python.terminal.activateEnvironment": true,
    "python.languageServer": "Pylance",
    "python.autoComplete.extraPaths": [

    ],
    "python.analysis.extraPaths": [],
    "leetcode.workspaceFolder": "/Users/[user_name]/vsCodeProjects/python_lc",
    "leetcode.defaultLanguage": "python3",
    "leetcode.hint.commandShortcut": false,
    "leetcode.hint.configWebviewMarkdown": false,
    "[python]": {
    "editor.formatOnType": true
    },
    "leetcode.filePath": {

      "default": {
      "folder": "",
      "filename": "${id}.${kebab-case-name}.${ext}"
  }

    }

}

  • nodejs version:
    v19.6.0
  • vscode version:
  • 1.75.1
  • extension version:
  • 0.18.1

edit 1: fixed OS version.
edit 2: typo and larger font in a specific line
@wangyerdfz
Copy link
Author

wangyerdfz commented Feb 13, 2023 •
edited
Loading

Okay I just noticed that it's possible that my login expired right at that moment. After re-login I am not able to repro this issue.

Just kidding. The issue is still there. This time my login was not expired.

@ashish-pankhedkar
Copy link

same issue

1 similar comment
@Areufm
Copy link

Areufm commented Mar 13, 2024

same issue

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@wangyerdfz @Areufm @ashish-pankhedkar