repo_name stringclasses 25
values | repo_full_name stringclasses 25
values | owner stringclasses 25
values | stars int64 117k 496k | license stringclasses 7
values | repo_description stringclasses 25
values | filepath stringlengths 9 75 | file_type stringclasses 3
values | language stringclasses 2
values | content stringlengths 24 383k | size_bytes int64 25 387k | num_lines int64 2 4.44k |
|---|---|---|---|---|---|---|---|---|---|---|---|
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.ko-KO.md | readme | Markdown | # Trie
_Read this in other languages:_
[_简体中文_](README.zh-CN.md),
[_Русский_](README.ru-RU.md),
[_Português_](README.pt-BR.md),
[_Українська_](README.uk-UA.md),
[_한국어_](README.ko-KO.md)
컴퓨터 과학에서 **트라이**는 디지털 트리라고도 불리며 때로는 기수 트리 또는 접두사 트리(접두사로 검색할 수 있기 때문에)라고도 불리며 일종의 검색 트리입니다. 키가 보통 문자열인 동적 집합 또는 연관 배열을 저장하는 데 사용되는 순... | 1,543 | 20 |
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.md | readme | Markdown | # Trie
_Read this in other languages:_
[_简体中文_](README.zh-CN.md),
[_Русский_](README.ru-RU.md),
[_Português_](README.pt-BR.md),
[_Українська_](README.uk-UA.md),
[_한국어_](README.ko-KO.md)
In computer science, a **trie**, also called digital tree and sometimes
radix tree or prefix tree (as they can be searched by prefix... | 1,349 | 33 |
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.pt-BR.md | readme | Markdown | # Árvore de Prefixos (Trie)
Na ciência da computação, uma **trie**, também chamada de árvore digital (digital tree)
e algumas vezes de _radix tree_ ou _prefix tree_ (tendo em vista que eles
podem ser pesquisados por prefixos), é um tipo de árvore de pesquisa, uma
estrutura de dados de árvore ordenada que é usado para... | 1,376 | 28 |
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.ru-RU.md | readme | Markdown | # Префиксное дерево
**Префиксное дерево** (также бор, луч, нагруженное или суффиксное дерево) в информатике - упорядоченная древовидная
структура данных, которая используется для хранения динамических множеств или ассоциативных массивов, где
ключом обычно выступают строки. Дерево называется префиксным, потому что поис... | 3,027 | 29 |
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.uk-UA.md | readme | Markdown | # Префіксне дерево
**Префіксне дерево** (Також промінь, навантажене або суфіксне дерево) в інформатиці - впорядкована деревоподібна
структура даних, яка використовується для зберігання динамічних множин або асоціативних масивів, де
ключем зазвичай виступають рядки. Дерево називається префіксним, тому що пошук здійснює... | 2,839 | 28 |
javascript-algorithms | trekhleb/javascript-algorithms | trekhleb | 195,878 | MIT | 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings | src\data-structures\trie\README.zh-CN.md | readme | Markdown | # 字典树
在计算机科学中, **字典树(trie,中文又被称为”单词查找树“或 ”键树“)**, 也称为数字树,有时候也被称为基数树或前缀树（因为它们可以通过前缀搜索）,它是一种搜索树--一种已排序的数据结构,通常用于存储动态集或键为字符串的关联数组。
与二叉搜索树不同, 树上没有节点存储与该节点关联的键; 相反,节点在树上的位置定义了与之关联的键。一个节点的全部后代节点都有一个与该节点关联的通用的字符串前缀, 与根节点关联的是空字符串。
值对于字典树中关联的节点来说,不是必需的,相反,值往往和相关的叶子相关,以及与一些键相关的内部节点相关。
有关字典树的空间优化示意,请参阅紧凑前缀树
 ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 36,404 | 522 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-de.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 44,885 | 606 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-el.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 78,714 | 586 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-es.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 38,575 | 554 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-fr.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 51,259 | 754 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-id.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 42,817 | 592 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-it.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 35,632 | 537 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-ja.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 48,978 | 618 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-ko.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 50,642 | 598 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-pl.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 51,210 | 625 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-pt.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 29,001 | 448 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-ro.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 42,513 | 597 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-ru.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 61,750 | 578 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-sl.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 43,848 | 620 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-uk.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 55,068 | 385 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-zh-Hant.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 32,702 | 537 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README-zh.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 41,168 | 614 |
the-art-of-command-line | jlevy/the-art-of-command-line | jlevy | 160,777 | null | Master the command line, in one page | README.md | readme | Markdown | 🌍
*[Čeština](README-cs.md) ∙ [Deutsch](README-de.md) ∙ [Ελληνικά](README-el.md) ∙ [English](README.md) ∙ [Español](README-es.md) ∙ [Français](README-fr.md) ∙ [Indonesia](README-id.md) ∙ [Italiano](README-it.md) ∙ [日本語](README-ja.md) ∙ [한국어](README-ko.md) ∙ [polski](README-pl.md) ∙ [Português](README-pt.md) ∙ [Română](... | 41,530 | 625 |
awesome-go | avelino/awesome-go | avelino | 171,039 | MIT | A curated list of awesome Go frameworks, libraries and software | README.md | readme | Markdown | # Awesome Go
<a href="https://awesome-go.com/"><img align="right" src="https://github.com/avelino/awesome-go/raw/main/tmpl/assets/logo.png" alt="awesome-go" title="awesome-go" /></a>
[](https://github.com/avelino/... | 387,446 | 3,904 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | README.md | readme | Markdown | <p align="center">
<img src="https://raw.githubusercontent.com/521xueweihan/img_logo/master/logo/readme.gif"/>
<br>中文 | <a href="README_en.md">English</a> | <a href="README_ja.md">日本語</a>
<br>分享 GitHub 上有趣、入门级的开源项目。
<br>兴趣是最好的老师，HelloGitHub 帮你找到开源的乐趣！
</p>
<p align="center">
<a href="https://hellogithub.com/... | 6,481 | 85 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | README_en.md | readme | Markdown | <p align="center">
<img src="https://cdn.jsdelivr.net/gh/521xueweihan/img_logo@main/logo/readme.gif"/>
<br><a href="README.md">中文</a> | English | <a href="README_ja.md">日本語</a>
<br>Sharing interesting, beginner-friendly open-source projects from GitHub.
<br>Interest is the best teacher—HelloGitHub helps you dis... | 4,657 | 40 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | README_ja.md | readme | Markdown | <p align="center">
<img src="https://cdn.jsdelivr.net/gh/521xueweihan/img_logo@main/logo/readme.gif"/>
<br><a href="README.md">中文</a> | <a href="README_en.md">English</a> | 日本語
<br>GitHub上の面白くて初心者向けのオープンソースプロジェクトを紹介します。
<br>興味は最高の先生です。HelloGitHubが、あなたのオープンソースの楽しさを見つけるお手伝いをします！
</p>
<p align="center">
<a href... | 5,381 | 40 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | script\github_bot\github_bot.py | python | Python | #!/usr/bin/env python
# -*- coding:utf-8 -*-
#
# Author : XueWeiHan
# E-mail : 595666367@qq.com
# Date : 16/8/30 下午10:43
# Desc : Github Bot
import os
import logging
import smtplib
import datetime
from operator import itemgetter
from email.mime.text import MIMEText
from email.header import Heade... | 6,843 | 214 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | script\github_bot\README.md | readme | Markdown | # GitHub Bot
>兴趣是最好的老师，[HelloGitHub](https://github.com/521xueweihan/HelloGitHub) 就是帮你找到兴趣！
<p align="center">
<img src='https://raw.githubusercontent.com/521xueweihan/img/master/hellogithub/01/img/hello-github.jpg' style="max-width:100%;"></img>
</p>
## 运行步骤
这个脚本主要用于收集 GitHub 上优秀的项目，用于编写[《HelloGitHub 月刊》](https:... | 1,652 | 58 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | script\make_content\make_content.py | python | Python | #!/usr/bin/env python
# -*- coding:utf-8 -*-
#
# Author : XueWeiHan
# E-mail : 595666367@qq.com
# Date : 16/10/21 下午1:41
# Desc : HelloGitHub项目——生成月刊脚本
"""
该脚本主要用于：生成月刊
《HelloGitHub》月刊每期内容都遵循统一格式，如果需要对通用部分的内容进行修改，需要手动修改每一
期的内容，这是不优雅的。
所以，我打算写个脚本，用于生成月刊，这样如果修改了通用内容部分，就只需要重新生成月刊，而不需要
手动修改已发布的所有期... | 2,901 | 101 |
HelloGitHub | 521xueweihan/HelloGitHub | 521xueweihan | 153,195 | null | :octocat: 分享 GitHub 上有趣、入门级的开源项目。Share interesting, entry-level open source projects on GitHub. | script\make_content\README.md | readme | Markdown | # GitHub MakeContent
>兴趣是最好的老师，[《HelloGitHub》](https://github.com/521xueweihan/HelloGitHub)就是帮你找到兴趣！
## 运行步骤
后面的月刊都通过这个脚本生成，这样如果通用内容部分需要修改，就只需要使用脚本重新生成月刊，而不需
要手动修改已发布的所有期的内容。后面还会持续开发～
```
python make_content.py 期数/all（重新生成所... | 653 | 18 |
javascript | airbnb/javascript | airbnb | 148,135 | MIT | JavaScript Style Guide | css-in-javascript\README.md | readme | Markdown | # Airbnb CSS-in-JavaScript Style Guide
*A mostly reasonable approach to CSS-in-JavaScript*
## Table of Contents
1. [Naming](#naming)
1. [Ordering](#ordering)
1. [Nesting](#nesting)
1. [Inline](#inline)
1. [Themes](#themes)
## Naming
- Use camelCase for object keys (i.e. "selectors").
> Why? We access these ... | 10,142 | 433 |
javascript | airbnb/javascript | airbnb | 148,135 | MIT | JavaScript Style Guide | packages\eslint-config-airbnb\README.md | readme | Markdown | # eslint-config-airbnb
[](https://badge.fury.io/js/eslint-config-airbnb)
This package provides Airbnb's .eslintrc as an extensible shared config.
## Usage
We export three ESLint configurations for your usage.
### eslint-config-airbnb
Our default exp... | 4,135 | 97 |
javascript | airbnb/javascript | airbnb | 148,135 | MIT | JavaScript Style Guide | packages\eslint-config-airbnb-base\README.md | readme | Markdown | # eslint-config-airbnb-base <sup>[![Version Badge][npm-version-svg]][package-url]</sup>
[][package-url]
[![github actions][actions-image]][actions-url]
[![License][license-image]][license-url]
[![Downloads][downloads-image]][downloads-url]
This pa... | 4,784 | 123 |
javascript | airbnb/javascript | airbnb | 148,135 | MIT | JavaScript Style Guide | react\README.md | readme | Markdown | # Airbnb React/JSX Style Guide
*A mostly reasonable approach to React and JSX*
This style guide is mostly based on the standards that are currently prevalent in JavaScript, although some conventions (i.e async/await or static class fields) may still be included or prohibited on a case-by-case basis. Currently, anythi... | 24,980 | 758 |
javascript | airbnb/javascript | airbnb | 148,135 | MIT | JavaScript Style Guide | README.md | readme | Markdown | # Airbnb JavaScript Style Guide() {
*A mostly reasonable approach to JavaScript*
> **Note**: this guide assumes you are using [Babel](https://babeljs.io), and requires that you use [babel-preset-airbnb](https://npmjs.com/babel-preset-airbnb) or the equivalent. It also assumes you are installing shims/polyfills in you... | 133,622 | 4,098 |
scrcpy | Genymobile/scrcpy | Genymobile | 139,036 | Apache-2.0 | Display and control your Android device | app\deps\README | readme | null | This directory (app/deps/) contains:
*.sh : shell scripts to download and build dependencies
patches/ : patches to fix dependencies (used by scripts)
work/sources/ : downloaded tarballs and extracted folders
ffmpeg-6.1.1.tar.xz
ffmpeg-6.1.1/
l... | 991 | 28 |
scrcpy | Genymobile/scrcpy | Genymobile | 139,036 | Apache-2.0 | Display and control your Android device | README.md | readme | Markdown | **This GitHub repo (<https://github.com/Genymobile/scrcpy>) is the only official
source for the project. Do not download releases from random websites, even if
their name contains `scrcpy`.**
# scrcpy (v3.3.4)
<img src="app/data/icon.svg" width="128" height="128" alt="scrcpy" align="right" />
_pronounced "**scr**een... | 7,697 | 226 |
free-for-dev | ripienaar/free-for-dev | ripienaar | 120,916 | null | A list of SaaS, PaaS and IaaS offerings that have free tiers of interest to devops and infradev | README.md | readme | Markdown | # free-for.dev
Developers and Open Source authors now have many services offering free tiers, but finding them all takes time to make informed decisions.
This is a list of software (SaaS, PaaS, IaaS, etc.) and other offerings with free developer tiers.
The scope of this particular list is limited to things that infr... | 236,031 | 1,634 |
free-programming-books-zh_CN | justjavac/free-programming-books-zh_CN | justjavac | 116,747 | GPL-3.0 | :books: 免费的计算机编程类中文书籍，欢迎投稿 | README.md | readme | Markdown | 免费的编程中文书籍索引
============================
[](https://github.com/justjavac/free-programming-books-zh_CN/issues) [](https://github.com/justjavac/free-prog... | 52,044 | 894 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | algorithms\README.md | readme | Markdown | # Algorithms
The contents have been moved to the [website](https://www.techinterviewhandbook.org/algorithms/study-cheatsheet).
<!-- TODO: Remove in future -->
| 166 | 6 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\portal\README.md | readme | Markdown | # Create T3 App
This is an app bootstrapped according to the [init.tips](https://init.tips) stack, also known as the T3-Stack.
## Why are there `.js` files in here?
As per [T3-Axiom #3](https://github.com/t3-oss/create-t3-app/tree/next#3-typesafety-isnt-optional), we take typesafety as a first class citizen. Unfortu... | 2,798 | 51 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\front-end\README.md | readme | Markdown | # Front-end Job Interview Questions
Front-end Job Interview Questions have been migrated [here](https://github.com/yangshun/front-end-interview-handbook).
| 159 | 4 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\binary_search.py | python | Python | def binary_search(arr, target):
left = 0;
right = len(arr) - 1
while left <= right:
mid = left + (right - left) // 2;
if arr[mid] == target:
return mid
elif arr[mid] < target:
left = mid + 1
else:
right = mid - 1
return -1
def bisect_l... | 2,409 | 69 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\char_prime_map.py | python | Python | # For mapping a lowercase character to a prime number.
# Useful for checking whether two strings are anagram or permutations of each other.
primes = {
'a': 2, 'b': 3, 'c': 5, 'd': 7, 'e': 11, 'f': 13,
'g': 17, 'h': 19, 'i': 23, 'j': 29, 'k': 31, 'l': 37,
'm': 41, 'n': 43, 'o': 47, 'p': 53, 'q': 59, 'r': 61,... | 641 | 20 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\graph_dfs.py | python | Python | def graph_dfs(matrix):
rows, cols = len(matrix), len(matrix[0])
visited = set()
directions = ((0, 1), (0, -1), (1, 0), (-1, 0))
def dfs(i, j):
if (i, j) in visited:
return
visited.add((i, j))
# Traverse neighbors.
for direction in directions:
next_... | 1,595 | 46 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\graph_topo_sort.py | python | Python | def graph_topo_sort(num_nodes, edges):
from collections import deque
nodes, order, queue = {}, [], deque()
for node_id in range(num_nodes):
nodes[node_id] = { 'in': 0, 'out': set() }
for node_id, pre_id in edges:
nodes[node_id]['in'] += 1
nodes[pre_id]['out'].add(node_id)
for... | 832 | 23 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\heap.py | python | Python | # Implements a min-heap. For max-heap, simply reverse all comparison orders.
#
# Note on alternate subroutine namings (used in some textbooks):
# - _bubble_up = siftdown
# - _bubble_down = siftup
def _bubble_up(heap, i):
while i > 0:
parent_i = (i - 1) // 2
if heap[i] < heap[parent_i]:
... | 2,129 | 85 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\is_subsequence.py | python | Python | def is_subsequence(s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
if len(s) > len(t):
return False
matched_s = 0
for char in t:
if matched_s < len(s) and s[matched_s] == char:
matched_s += 1
return matched_s == len(s)
| 302 | 14 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\linked_list.py | python | Python | # Singly-Linked List
#
# The linked list is passed around as a variable pointing to the
# root node of the linked list, or None if the list is empty.
class LinkedListNode:
def __init__(self, value):
self.value = value
self.next = None
def linked_list_append(linked_list, value):
'''Appends a va... | 3,352 | 110 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\quick_select.py | python | Python | ## QuickSelect -- Linear-time k-th order statistic
## (i.e. select the k-th smallest element in an unsorted array)
## https://en.wikipedia.org/wiki/Quickselect
def partition(array, start, end, pivot):
"""Partitions by a pivot value, which might not necessarily be in the array.
This variant is useful when you w... | 2,231 | 61 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\rabin_karp_hash.py | python | Python | ## Rabin-Karp Rolling Hash
## Implementation of: https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm#Hash_function_used
##
## This rolling hash function is useful when you need to compute the hash of successive substrings
## of text. E.g. note that going from 'abcd' to 'bcde', we drop the 'a' from the back and a... | 1,962 | 42 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\tree_equal.py | python | Python | def tree_equal(node1, node2):
if not node1 and not node2:
return True
if not node1 or not node2:
return False
return node1.val == node2.val and \
tree_equal(node1.left, node2.left) and \
tree_equal(node1.right, node2.right)
| 276 | 9 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\tree_mirror.py | python | Python | def tree_mirror(node):
if not node:
return
node.left, node.right = node.right, node.left
tree_mirror(node.left)
tree_mirror(node.right)
| 166 | 7 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\tree_traversal.py | python | Python | # Various iterative ways of traversing a tree.
def inorder_traversal(root):
"""
:type root: TreeNode
:rtype: List[int]
"""
if not root:
return []
result = []
stack = [root]
while len(stack) > 0:
curr_node = stack.pop()
if curr_node.left:
stack.append(cur... | 1,608 | 63 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\trie.py | python | Python | class Trie(object):
def __init__(self):
"""
Initialize your data structure here.
"""
self.d = {}
def insert(self, word):
"""
Inserts a word into the trie.
:type word: str
:rtype: void
"""
curr = self.d
for char in word:
... | 2,383 | 81 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\experimental\utilities\python\union_find.py | python | Python | ## Union-Find data structure
## https://en.wikipedia.org/wiki/Disjoint-set_data_structure
parents = [0, 1, 2, 3, 4, 5, 6] # parent[i] is the parent of i
weights = [1, 1, 1, 1, 1, 1, 1]
def find_root(parents, p):
'''Average: O(log n)'''
root = p
while parents[root] != root:
root = parents[root]
... | 1,350 | 51 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | apps\website\README.md | readme | Markdown | # Website
This website is built using Docusaurus 2, a modern static website generator. It is part of the repository's Vite+ monorepo setup.
### Installation
Vite+ manages installs through the repository's declared package manager. At the root of the repository, run `vp install` to install the monorepo dependencies.
... | 1,121 | 41 |
tech-interview-handbook | yangshun/tech-interview-handbook | yangshun | 139,031 | MIT | Curated coding interview preparation materials for busy software engineers | README.md | readme | Markdown | <h1 align="center">Tech Interview Handbook</h1>
<div align="center">
<a href="https://www.techinterviewhandbook.org/">
<img src="assets/logo.svg" alt="Tech Interview Handbook" width="400" />
</a>
<br />
<h3>
<a href="https://www.techinterviewhandbook.org/">Read on the website</a>
</h3>
<p>
Join... | 10,738 | 124 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.