A complete computer science study plan to become a software engineer.
-
Updated
Jul 8, 2022
{{ message }}
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
A complete computer science study plan to become a software engineer.
刷算法全靠套路,认准 labuladong 就够了!English version supported! Crack LeetCode, not only how, but also why.
LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解,记录自己的leetcode解题之路。)
Algorithms and data structures in Swift, with explanations!
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.
Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
Algorithms implemented in Go for beginners, following best practices.
Cracking the Coding Interview 6th Ed. Solutions
All Algorithms implemented in Rust
This repository contains all the DSA (Data-Structures, Algorithms, 450 DSA by Love Babbar Bhaiya, FAANG Questions), Technical Subjects (OS + DBMS + SQL + CN + OOPs) Theory+Questions, FAANG Interview questions, and Miscellaneous Stuff (Programming MCQs, Puzzles, Aptitude, Reasoning). The Programming languages used for demonstration are C++, Python, and Java.
This repository consists of the code samples, assignments, and notes for the Java Data Structures & Algorithms bootcamp of Community Classroom.
A curated list of leetcode questions grouped by their common patterns
LeetCode 101:和你一起你轻松刷题(C++)
Most comprehensive list
Provide all my solutions and explanations in Chinese for all the Leetcode coding problems.
In the following file we have already ported some tests from Go to Rust:
https://github.com/crossbeam-rs/crossbeam-channel/blob/master/tests/golang.rs
The idea is to blindly port all the tests for Go channels line by line, which will give us additional confidence in the correctness of crossbeam-channel.
In the test file, you can find stubs with links to the original tests written in Go and
Write a loop, from 1 to 80000, each time add a random int to the max heap.
In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.
I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.
180+ Algorithm & Data Structure Problems using C++
An Open-Source Collection of 200+ Algorithmic Flash Cards to Help you Preparing your Algorithm & Data Structure Interview
A Python module for learning all major algorithms
Solutions to LeetCode by Swift
All algorithms implemented in C#.
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:
Stacktrace: