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 파일 다운로드
크롬 확장 프로그램을 crx 형식으로 다운로드하여 브라우저에 수동으로 설치하거나 crx 파일을 친구들과 공유하여 쉽게 크롬 확장 프로그램을 설치하세요.
확장 프로그램 사용 설명서
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 |
| 이메일 | [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
} | |
