Constraints Blocker (Leetcode, Codechef, BS)
Chrome Extension will hide the constraints of the given problem as constraints reveal major hints to solve the given problem.
Constraints Blocker (Leetcode, Codechef, BS)とは何ですか？
Constraints Blocker (Leetcode, Codechef, BS)はSumanto Palによって開発されたChromeの拡張機能で、その主な機能は「Chrome Extension will hide the constraints of the given problem as constraints reveal major hints to solve the given problem.」です。
拡張機能のスクリーンショット
Constraints Blocker (Leetcode, Codechef, BS)拡張機能のCRXファイルをダウンロード
Constraints Blocker (Leetcode, Codechef, BS)拡張子のファイルをcrx形式でダウンロードし、ブラウザにChrome拡張機能を手動でインストールするか、crxファイルを友達と共有して簡単にChrome拡張機能をインストールします。
拡張機能の使用方法
Chrome Extension will hide the constraints of the given problem as constraints reveal major hints to solve the given problem. This helps to simulate real interview experience practice as in an interview you won't be revealed the constraints. The constraints give major hints of how to solve the problem. For example, if n<=20 then it's obvious the problem will be solved using some brute-force approach.
Supported Platform for now are leetcode.com and binarysearch.com 拡張機能の基本情報
| 名前 |  Constraints Blocker (Leetcode, Codechef, BS) |
| ID | poadlijigkkehhbfnmdabgecngbmoaho |
| 公式URL | https://chromewebstore.google.com/detail/constraints-blocker-leetc/poadlijigkkehhbfnmdabgecngbmoaho |
| 説明 | Chrome Extension will hide the constraints of the given problem as constraints reveal major hints to solve the given problem. |
| ファイルサイズ | 1.66 MB |
| インストール数 | 37 |
| 現在のバージョン | 1.2.0.1 |
| 最終更新日 | 2021-07-26 |
| 公開日 | 2021-07-10 |
| 開発者 | Sumanto Pal |
| Eメール | [email protected] |
| 支払い方法 | free |
| 拡張機能のウェブサイト | https://github.com/sumantopal07/Constraints-Blocker-Chrome-Extension |
| ヘルプページのURL | https://github.com/sumantopal07/Constraints-Blocker-Chrome-Extension |
| 対応言語 | en |
| manifest.json | |
{
"update_url": "https:\/\/clients2.google.com\/service\/update2\/crx",
"name": "Constraints Blocker (Leetcode, Codechef, BS)",
"description": "Chrome Extension will hide the constraints of the given problem as constraints reveal major hints to solve the given problem.",
"version": "1.2.0.1",
"manifest_version": 3,
"permissions": [
"storage"
],
"background": {
"service_worker": "background.js"
},
"action": {
"default_popup": "popup\/popup.html",
"default_icon": {
"16": "logo.png",
"32": "logo.png",
"48": "logo.png",
"128": "logo.png"
}
},
"icons": {
"16": "logo.png",
"32": "logo.png",
"48": "logo.png",
"128": "logo.png"
},
"content_scripts": [
{
"matches": [
"*:\/\/*.binarysearch.com\/*"
],
"js": [
"binarysearch.js"
],
"run_at": "document_end"
},
{
"matches": [
"*:\/\/*.leetcode.com\/*"
],
"js": [
"leetcode.js"
],
"run_at": "document_end"
},
{
"matches": [
"*:\/\/*.codechef.com\/*"
],
"js": [
"codechef.js"
],
"run_at": "document_end"
}
],
"offline_enabled": true
} | |
