All Projects → upupming → algorithm

upupming / algorithm

Licence: MIT license
acwing, leetcode, kickstart, 算法模板, PAT 等等

Programming Languages

C++
36643 projects - #6 most used programming language
javascript
184084 projects - #8 most used programming language
typescript
32286 projects
java
68154 projects - #9 most used programming language

Projects that are alternatives of or similar to algorithm

Competitive Programming
Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.
Stars: ✭ 65 (-59.88%)
Mutual labels:  leetcode, interview, competitive-programming
competitive-programming
Solutions of some problems in competitive programming
Stars: ✭ 23 (-85.8%)
Mutual labels:  leetcode, interview, competitive-programming
python-cp-cheatsheet
Python3 interview prep cheatsheet and examples
Stars: ✭ 407 (+151.23%)
Mutual labels:  leetcode, interview, competitive-programming
learning-computer-science
Learning data structures, algorithms, machine learning and various computer science constructs by programming practice from resources around the web.
Stars: ✭ 28 (-82.72%)
Mutual labels:  leetcode, interview, competitive-programming
InterviewPrep
A repository containing link of good interview questions
Stars: ✭ 54 (-66.67%)
Mutual labels:  leetcode, competitive-programming
Cs Notes
📚 技术面试必备基础知识、Leetcode、计算机操作系统、计算机网络、系统设计
Stars: ✭ 143,620 (+88554.32%)
Mutual labels:  leetcode, interview
CP
Competitive Coding
Stars: ✭ 25 (-84.57%)
Mutual labels:  leetcode, competitive-programming
Data-Structure-Algorithms-LLD-HLD
A Data Structure Algorithms Low Level Design and High Level Design collection of resources.
Stars: ✭ 922 (+469.14%)
Mutual labels:  leetcode, interview
Leetcode
Data structures and algorithms for interview preparation
Stars: ✭ 241 (+48.77%)
Mutual labels:  leetcode, interview
pw
Best websites a Programmer should visit
Stars: ✭ 27 (-83.33%)
Mutual labels:  interview, competitive-programming
Competitive-programing
This repository is for encouraging people in competitive programming. And making PR's on a regular basis. Through this repo, Geeks can find solutions for various programming problems and also give your code to increase the repo.
Stars: ✭ 20 (-87.65%)
Mutual labels:  leetcode, competitive-programming
Interviews
Everything you need to know to get the job.
Stars: ✭ 54,875 (+33773.46%)
Mutual labels:  leetcode, interview
Competetive programming
Contains my solutions to thousands of different CP sums and some DSA Problems(available in snippets)
Stars: ✭ 21 (-87.04%)
Mutual labels:  leetcode, competitive-programming
Coding-Practice
Coding practice, design pattern implementation in C++ and some knowledge summary.
Stars: ✭ 48 (-70.37%)
Mutual labels:  leetcode, interview
Competitive-Programming-June-Course-
Problem Solving Ability Skills Course
Stars: ✭ 24 (-85.19%)
Mutual labels:  leetcode, competitive-programming
Leetcode
Solutions to LeetCode problems; updated daily. Subscribe to my YouTube channel for more.
Stars: ✭ 3,090 (+1807.41%)
Mutual labels:  leetcode, interview
Algorithmic-Problem-Solving
Solutions of algorithmic type of programming problems from sites like LeetCode.com, HackerRank.com, LeetCode.com, Codility.com, CodeForces.com, etc. using Java.
Stars: ✭ 20 (-87.65%)
Mutual labels:  leetcode, interview
Leetcode-Solution-All
1000篇通俗易懂且高质量的 LeetCode 解析,动画题解,套路分析,模板分享
Stars: ✭ 73 (-54.94%)
Mutual labels:  leetcode, interview
Interviewroom
Contains all important data structure and algorithms problems asked in interviews
Stars: ✭ 207 (+27.78%)
Mutual labels:  leetcode, interview
Nycsde
公众号【码农田小齐】的分类合集
Stars: ✭ 208 (+28.4%)
Mutual labels:  leetcode, interview

algorithm

Forked from liuchuo/PAT.

主要存放训练刷题时的代码,有些有 README,有些源代码里面有注释可以看。

关于算法复杂度

在竞赛中,一般算机一秒能运行5 x 10^8次汁算,如果题目給出的时间限制カ1s,那么你选择的算法执行的计算次数最多应该在10^8量级オ有可能解决这个题目。一般 O(n)的算法能解决的数据范围在n < 10^8。

  • O(n*logn)的算法能解决的数据范围在n <= 10^6。
  • O(n*sqrt(n) )的算法能解决的数据范围在n < 10^5。
  • O(n^2)的算法能解决的数据范围在n<5000。
  • O(n^3)的算法能解决的数据范围在n <300。
  • O(2^n)的算法能解决的数据范围在n < 25。
  • O(n!)的算法能解决的数据范围在n < 11。

以上范围仅供参考,实际中还要考虑每种算法的常数。

推荐一些优质的资源

Stargazers over time

Stargazers over time

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].