A complete computer science study plan to become a software engineer.
-
Updated
Nov 23, 2019
Algorithm
Algorithms are detailed sets of guidelines created for a computer program to complete tasks efficiently and thoroughly.
- Sign up for GitHub or sign in to edit this page
Here are 7,463 public repositories matching this topic...
All Algorithms implemented in Python
-
Updated
Nov 23, 2019 - Python
📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
-
Updated
Nov 23, 2019 - JavaScript
Everything you need to know to get the job.
-
Updated
Nov 23, 2019 - Java
💯 Materials to help you rock your next coding interview
-
Updated
Nov 23, 2019 - JavaScript
:fireworks:Interactive Online Platform that Visualizes Algorithms from Code
-
Updated
Nov 23, 2019 - JavaScript
👨🎓 Java Core Sprout : basic, concurrent, algorithm
-
Updated
Nov 23, 2019 - Java
120+ interactive Python coding interview challenges (algorithms and data structures). Includes Anki flashcards.
-
Updated
Nov 23, 2019 - Python
Minimal examples of data structures and algorithms in Python
-
Updated
Nov 23, 2019 - Python
Bitmap & tilemap generation from a single example with the help of ideas from quantum mechanics.
-
Updated
Nov 23, 2019 - C#
🤖 Python examples of popular machine learning algorithms with interactive Jupyter demos and math being explained
-
Updated
Nov 23, 2019 - Jupyter Notebook
FR4NKESTI3N
commented
Feb 1, 2019
there is data_structures/src/list/singly_linked_list, but there is also a code for same problem in data_structures/linked_list/
One of them ought to be removed.
📚 C/C++ 技术面试基础知识总结，包括语言、程序库、数据结构、算法、系统、网络、链接装载库等知识及面试经验、招聘、内推等信息。
-
Updated
Nov 23, 2019 - C++
:crown: LeetCode of algorithms with java solution(updating).
-
Updated
Nov 23, 2019 - Java
Bug-tracking for Jeff's algorithms book, notes, etc.
-
Updated
Nov 23, 2019
JavaScript implementation of different computer science algorithms.
-
Updated
Nov 23, 2019 - JavaScript
:gem: A curated list of awesome Competitive Programming, Algorithm and Data Structure resources
-
Updated
Nov 23, 2019 - HTML
laggardkernel
commented
Oct 1, 2019
🚀 Feature Proposal
Adding leading zero in the question number will be an awesome feature for file explorer to sort files by the name.
PizzaBrandon
commented
Jan 2, 2019
A short (3 point) closed linestring (rare, but does happen) throws an exception in clean-coords due to the code assuming it's a polygon.
Problem occurs due to https://github.com/Turfjs/turf/blob/master/packages/turf-clean-coords/index.ts#L118 assuming the first and last points matching means it's a polygon.
This can also happen with a linestring that is cleaned to < 4 points. Discovered thi
A python library built to empower developers to build applications and systems with self-contained Computer Vision capabilities
-
Updated
Nov 23, 2019 - Python
Byte7
commented
Oct 4, 2018
Some of the resource list under different topic have missing hyperlinks for the different subsections of resources. Say, books links are given but hyperlink for table of content for books is missing. Similarly, add return to top hyperlink for resource pages after each subsection. Even missing section names can be added. This issue is opened for enhancement of the repository. Everyone can contribut
一本关于排序算法的 GitBook 在线书籍 《十大经典排序算法》，多语言实现。
-
Updated
Nov 21, 2019 - Java
Learn about algorithm
- Wikipedia
- Wikipedia
数轴上放置了一些筹码，每个筹码的位置存在数组 chips 当中。
你可以对 任何筹码 执行下面两种操作之一（不限操作次数，0 次也可以）：
将第 i 个筹码向左或者右移动 2 个单位，代价为 0。
将第 i 个筹码向左或者右移动 1 个单位，代价为 1。
最开始的时候，同一位置上也可能放着两个或者更多的筹码。
返回将所有筹码移动到同一位置（任意位置）上所需要的最小代价。
示例 1：
输入：chips = [1,2,3]
输出：1
解释：第二个筹码移动到位置三的代价是 1，第一个筹码移动到位置三的代价是 0，总代价为 1。
示例 2：
输入：chips = [2,2,2,3,3]
输出：2
解释：第四和第五个筹码移动到位置二的代价都是 1，所以最小总代价为 2。
提示：
1 <= chips.length <= 1