A complete computer science study plan to become a software engineer.
-
Updated
Jul 9, 2022
{{ message }}
Algorithms are detailed sets of guidelines created for a computer program to complete tasks efficiently and thoroughly.
A complete computer science study plan to become a software engineer.
Everything you need to know to get the job.
LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解,记录自己的leetcode解题之路。)
MinHeap and MaxHeap implementation are broken.
Instance of these heaps couldn't be instanciated with any not empty list of elements.
Here is a test code to reproduce:
@Test
void createFromList() {
var elements = List.of(
new HeapElement(5)
);
MaxHeap heap = new MaxHeap(elements);
//similar with MinHeap
}Stacktrace:
java.lang.IndexOut
《代码随想录》LeetCode 刷题攻略:200道经典题目刷题顺序,共60w字的详细图解,视频难点剖析,50余张思维导图,支持C++,Java,Python,Go,JavaScript等多语言版本,从此算法学习不再迷茫!
120+ interactive Python coding interview challenges (algorithms and data structures). Includes Anki flashcards.
Minimal examples of data structures and algorithms in Python
Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
Collection of various algorithms in mathematics, machine learning, computer science and physics implemented in C++ for educational purposes.
Bitmap & tilemap generation from a single example with the help of ideas from quantum mechanics
Python sample codes for robotics algorithms.
You may use this guide to make quality contributions at Hacktoberfest 2020: Hacktoberfest 2020 guide
To begin contributing, you shall get a quick overview of how Cosmos is used today. Cosmos is one of the most extensive code database and is used as:
A collection of algorithms and data structures
✍🏻 这里是写博客的地方 —— Halfrost-Field 冰霜之地
ApacheCN 数据结构与算法译文集
안녕하세요
자료 보면서 공부하다가 counting sort 코드가 이상한 부분이 있어서 수정했습니다
arr.length -> counting.lengthcounting[arr[i]] -> counting[arr[i]] - 1좋은자료 항상 감사합니다 :)
Bug-tracking for Jeff's algorithms book, notes, etc.
Adding leading zero in the question number will be an awesome feature for file explorer to sort files by the name.
We have a lot of
is_prime(or similar) functions: https://github.com/TheAlgorithms/Python/search?p=4&q=is_prime, https://github.com/TheAlgorithms/Python/search?q=isPrime, data_structures/hashing/number_theory/prime_numbers, etc. Shall we use one common function for that exactly identical