All Projects → idisfkj → daily_algorithm

idisfkj / daily_algorithm

Licence: Apache-2.0 License
🔥算法进阶,由浅入深,欢迎加入一起共勉(A daily algorithm,Welcome to join and share together)

Programming Languages

kotlin
9241 projects
java
68154 projects - #9 most used programming language

Projects that are alternatives of or similar to daily algorithm

algorithm-notes
📝 一个小前端的算法笔记 / js algorithm notes
Stars: ✭ 185 (+320.45%)
Mutual labels:  leetcode
Coding-Interview-Challenges
This is a repo where I upload code for important interview questions written in Python, C++, and Swift
Stars: ✭ 13 (-70.45%)
Mutual labels:  leetcode
Leetcode Swift
Learning Swift
Stars: ✭ 29 (-34.09%)
Mutual labels:  leetcode
LeetCodeCrawler
A tool for crawling the description and accepted submitted code of problems on the LeetCode and LeetCode-Cn website.
Stars: ✭ 23 (-47.73%)
Mutual labels:  leetcode
AlgoDaily
just for fun
Stars: ✭ 118 (+168.18%)
Mutual labels:  leetcode
Algorithm-Patterns
面试常用算法框架分类总结,带你逐类击破 LeetCode 题目,培养算法思维,一通百通。Summary of Algorithm Patterns in coding interview. Cracking LeetCode and build up your algorithm thinking.
Stars: ✭ 24 (-45.45%)
Mutual labels:  leetcode
LeetCode
37337
Stars: ✭ 16 (-63.64%)
Mutual labels:  leetcode
CODINGTEST PRACTICE
1일 1문제 since 2020.02.07
Stars: ✭ 15 (-65.91%)
Mutual labels:  leetcode
leetcode
LeetCode Problems' Solutions
Stars: ✭ 233 (+429.55%)
Mutual labels:  leetcode
LeetCode-with-JavaScript
Solutions collection of my LeetCode submissions in JavaScript (LeetCode 解题集之 JavaScript 版)
Stars: ✭ 104 (+136.36%)
Mutual labels:  leetcode
datastructures-and-algorithms
Repository for studying/practicing Data Structures, Algorithms and Code Interview Problems.
Stars: ✭ 30 (-31.82%)
Mutual labels:  leetcode
codeforces-go
Golang 算法竞赛模板库 | Solutions to Codeforces by Go 💭💡🎈
Stars: ✭ 842 (+1813.64%)
Mutual labels:  leetcode
Daily-question-of-Leetcode
整理LeetCode上的每日一题,欢迎小伙伴加入🔥🔥🔥
Stars: ✭ 46 (+4.55%)
Mutual labels:  leetcode
myleetcode
♨️ Detailed Java & Python solution of LeetCode.
Stars: ✭ 34 (-22.73%)
Mutual labels:  leetcode
LeetCode
Competitive coding submissions at Leetcode goes here
Stars: ✭ 14 (-68.18%)
Mutual labels:  leetcode
leetcode
Leetcode with Golang. One question on day.
Stars: ✭ 19 (-56.82%)
Mutual labels:  leetcode
LeetCode-solutions
LeetCode Solutions in Python, Java and C++
Stars: ✭ 22 (-50%)
Mutual labels:  leetcode
websites
🔗 Effective Websites Collections
Stars: ✭ 55 (+25%)
Mutual labels:  leetcode
Algorithm-Math
算法 & 数学知识 & 重拾基础知识系列文章编写和收集
Stars: ✭ 19 (-56.82%)
Mutual labels:  leetcode
leetcode-solution-curation
A one-stop repository for LeetCode solutions.
Stars: ✭ 31 (-29.55%)
Mutual labels:  leetcode

daily_algorithm

每日一算法,由浅入深,欢迎加入一起共勉(A daily algorithm,Welcome to join and share together)

算法内容包括各大厂公司与leetcode算法题,目前主要实现是Kotlin版本,后续会加入其它语言的实现版本。当然也非常期待志同道合的伙伴一起加入来完善各种语言的实现。

不妨动动小指头,右上角点个Star支持一下,让我们一起成长。

不积跬步,无以至千里;不积小流,无以成江海。👋🤔

进阶文章(持续更新中...)

算法之旅:复杂度分析

数组:面试中的疑难点

链表:由浅入深

链表

  1. LRU: 使用单链表实现LRU
  2. Palindrome: 单链表判断回文
  3. Reversal: 单链表反转
  4. Circle: 链表中环的检测
  5. OrderMerge: 两个有序链表的合并
  6. DeleteLastN: 删除链表倒数第 n 个结点
  7. MiddleNode: 求链表的中间结点

  1. ValidParenthesis: 有效的括号
  2. MinStack: 最小栈
  3. Calculate: 基本的计算器
  4. NetGreaterElement: 下一个更大元素(LeetCode 496)
  5. BaseballGame: 棒球比赛(LeetCode 682)
  6. BackSpaceCompare: 比较含退格的字符串(LeetCode 844)

队列

  1. CircleQueue: 基于数组的循环队列

递归

  1. KthGrammar: 第K个语法符号(LeetCode 779)
  2. ValidTicTacToe: 有效的井字游戏(LeetCode 794)

排序

  1. MergeSort: 归并排序
  2. QuickSort: 快速排序
  3. CountSort: 计数排序
  4. BubbleSort: 冒泡排序
  5. InsertSort: 插入排序
  6. SelectSort: 选择排序
  7. HeapSort: 堆排序

查找

  1. BinarySearch: 二分查找
  2. BinarySearchV1: 二分查找第一个等于给定的值
  3. BinarySearchV2: 二分查找最后一个等于给定的值
  4. BinarySearchV3: 二分查找第一个大于等于给定的值
  5. BinarySearchV4: 二分查找最后一个小于等于给定的值
  6. SkipList: 跳表

散列表

  1. HashTable: 散列表
  2. LRU: 基于散列表与双向链表的LRU

  1. BinarySearchTree: 二叉查找树
  2. MaxDepth: 二叉树的最大深度
  3. MinimumDifference: 二叉树的最小绝对差

  1. Graph: 图的广度与深度优先搜索
  2. TopologySort: 拓扑排序
  3. BitMap: 位图

Trie

  1. Trie: trie树,解决字符串查询
  2. ACAutoMata: AC自动机, 字符串多模式匹配

回溯

  1. 01Backpack: 01-背包
  2. 01BackpackUpgrade: 01-背包升级版
  3. MinDist: 棋盘最小路径
  4. MinEdit: 最少编辑次数

动态规划

  1. 01Backpack: 01-背包
  2. 01BackpackUpgrade: 01-背包升级版
  3. MinDist: 棋盘最小路径
  4. MinEdit: 最少编辑次数
  5. MaxSameLength: 最多公共子串长度
  6. YangHuiTriangleVer: 杨辉三角变体

LeetCode

  1. TowSum: 两数之和(1)
  2. AddTwoNumbers: 两数相加(2)
  3. MaxDepth: 二叉树的最大深度(104)
  4. HasCycle: 环形链表(141)
  5. MinimumDifference: 二叉树的最小绝对差(530)
  6. Connect: 填充每个节点的下一个右侧节点指针(116)
  7. LengthOfLongestSubstring: 无重复字符串的最长子串(3)
  8. ReorderList: 重排链表(143)
  9. RemoveKDigits: 移掉k位数字(402)
  10. NQueens: N皇后(51)
  11. SortArrayByParityII: 按奇偶排序数组 II(922)
  12. OddEvenList: 奇偶链表(328)
  13. RelativeSortArray: 数组的相对排序(1122)
  14. AllCellsDistOrder: 距离顺序排列矩阵单元格(1030)
  15. CanCompleteCircuit: 加油站(132)
  16. MoveZeroes: 移动零(283)
  17. InsertionSortList: 对链表进行插入排序(147)
  18. CountNodes: 完全二叉树的节点个数(222)
  19. LeastInterval: 任务调度器(621)
  20. PredictPartyVictory: Dota2 参议院(649)
  21. WiggleMaxLength: 摆动序列(376)
  22. ContainsDuplicate: 存在重复的元素(217)
  23. WordPattern: 单词规律(290)
  24. FindTheDifference: 找不同的数(389)
  25. CanPlaceFlowers: 种花问题(605)
  26. Partition: 分隔链表(86)
  27. SummaryRanges: 汇总区间(228)
  28. CheckStraightLine: 缀点成线(1232)
  29. AccountsMerge: 账户合并(721)
  30. MinCostConnectPoints: 连接所有点的最小费用(1584)
  31. MaximumProduct: 三个数的最大乘积(628)
  32. FindCriticalAndPseudoCriticalEdges: 找到最小生成树里的关键边和伪关键边(1489)
  33. AddToArrayForm: 数组形式的整数加法(989)
  34. RegionsBySlashes: 由斜杠划分区域(959)
  35. NumEquivDominoPairs: 等价多米诺骨牌对的数量(1128)
  36. MaxNumEdgesToRemove: 保证图可完全遍历(1579)
  37. PivotIndex: 寻找数组的中心索引(724)
  38. MinimumEffortPath: 最小体力消耗路径(1631)
  39. FairCandySwap: 公平的糖果棒交换(888)
  40. MedianSlidingWindow: 滑动窗口中位数(480)
  41. FindMaxAverage: 子数组最大平均数 I(643)
  42. EqualSubstring: 尽可能使字符串相等(1208)
  43. CheckPossibility: 非递减数列(665)
  44. MaxTurbulenceSize: 最长湍流子数组(978)
  45. SubarraysWithKDistinct: K 个不同整数的子数组(992)

公众号

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].