# 10k

- 美国往事-追尾记 —
- 睡前唠嗑 —
- 《逃不开的经济周期》 —
- 210. Course Schedule II —
- 253. Meeting Rooms II —
- 1248. Count Number of Nice Subarrays —
- 721. Accounts Merge —
- 721. Accounts Merge —
- Use The Index Luke Note1 —
- 1293. Shortest Path in a Grid with Obstacles Elimination —
- 716. Max Stack —
- 317. Shortest Distance from All Buildings —
- Spring Cookbook2 - Self Injection —
- DDIA-Chapter10, 11,12-Notes —
- DDIA-Chapter9-Note —
- DDIA-Chapter8-Note —
- DDIA-Chapter7 Note —
- Spring cookbook - Field injection? Constructor injection? Or setter injection? —
- DDIA-Chapter6-Note —
- DDIA-Chapter5-Note —
- DDIA-Chapter4-Note —
- DDIA-Chapter3-Note —
- DDIA-Chapter2-Note —
- DDIA-Chapter1-Note —
- System Design Interview and beyond Note11 - Protect clients from server —
- JPA/Hibernate optimistic lock not working —
- System Design Interview and beyond Note11 - Protect server from client —
- System Design Interview and beyond 10 - Deliver Data at large scale —
- System Design Interview and beyond Note9 - Deliver Data quickly —
- System Design Interview and beyond Note8 - Deliver Data Reliably —
- System Design Interview and beyond Note7 - Efficient Communication —
- System Design Interview and beyond Note6 - Data store Internals —
- 125. Valid Palindrome —
- System Design Interview and beyond Note5 - Queues —
- System Design Interview and beyound Note4 - Caching —
- System Design Interview and beyond Note3 - Reliable, Scalable and fast communication —
- 340. Longest Substring with At Most K Distinct Characters —
- 3. Longest Substring Without Repeating Characters —
- System Design Interview and beyound Note2 - Hardware resources —
- 76. Minimum Window Substring —
- 157. Read N Characters Given read4 & 158. Call Multiple Times —
- 12. Integer to Roman —
- 13. Roman to Integer —
- System Design Interview and beyound Note1 - Requirements —
- 171. Excel Sheet Column Number —
- 168. Excel Sheet Column Title —
- 354. Russian Doll Envelopes —
- 300. Longest Increasing Subsequence —
- 280. Wiggle Sort —
- 376. Wiggle Subsequence —
- 283. Move Zeroes —
- 75. Sort Colors —
- 88. Merge Sorted Array —
- 163. Missing Ranges —
- 228. Summary Ranges —
- 152. Maximum Product Subarray —
- 325. Maximum Size Subarray Sum Equals k —
- 277. Find the Celebrity —
- 11. Container With Most Water —
- 238. Product of Array Except Self —
- 209. Minimum Size Subarray Sum —
- 243. Shortest Word Distance —
- 2023复盘 —
- 设计模式之美-课程笔记53-项目实战3-设计实现一个支持自定义规则的灰度发布组件 —
- 设计模式之美-课程笔记52-项目实战2-设计实现一个通用的接口幂等框架 —
- 设计模式之美-课程笔记51-项目实战1-设计实现一个支持各种算法的限流框架 —
- 设计模式之美-课程笔记50-开源实战5-从MyBatis学 —
- 设计模式之美-课程笔记49-开源实战4-从Spring框架学习经典设计思想/原则 —
- 设计模式之美-课程笔记48-开源实战3-从Guava学习开发通用模块 —
- 53. Maximum Subarray —
- 设计模式之美-课程笔记47-开源实战2-从UNIX上学习大型复杂项目开发 —
- 设计模式之美-课程笔记46-开源实战1-JDK —
- 设计模式之美-课程笔记45-中介模式 —
- 设计模式之美-课程笔记44-解释器模式 —
- 设计模式之美-课程笔记43-命令模式 —
- 设计模式之美-课程笔记43备忘录模式 —
- 设计模式之美-课程笔记42-访问者模式 —
- 设计模式之美-课程笔记41-迭代器模式 —
- 设计模式之美-课程笔记40-状态模式 —
- 271. Encode and Decode Strings —
- 设计模式之美-课程笔记39-职责链模式 —
- Spring Cookbook3 - Circular Dependency —
- 316. Remove Duplicate Letters —
- 设计模式之美-课程笔记38-策略模式 —
- 38. Count and Say —
- 161. One Edit Distance —
- 设计模式之美-课程笔记37-模板模式 —
- 249. Group Shifted Strings —
- 49. Group Anagrams —
- 263. Ugly Number & 264. Ugly Number II —
- 202. Happy Number —
- 231. Power of Two —
- 19. 4Sum —
- 15. 3Sum —
- 设计模式之美-课程笔记36-观察者模式 —
- 204. Count Primes —
- 367. Valid Perfect Square —
- 50. Pow(x, n) —
- Self Injection —
- 69. Sqrt(x) —
- 43. Multiply Strings —
- 67. Add Binary —
- 设计模式之美-课程笔记35-享元模式 —
- 设计模式之美-课程笔记34-组合模式 —
- 设计模式之美-课程笔记33-门面模式 —
- 1. Two Sum —
- 设计模式之美-课程笔记32-适配器模式 —
- 设计模式之美-课程笔记31-装饰器模式 —
- 设计模式之美-课程笔记30-桥接模式 —
- 7. Reverse Integer —
- 设计模式之美-课程笔记29-代理模式 —
- 314. Binary Tree Vertical Order Traversal —
- 96. Unique Binary Search Trees —
- 设计模式之美-课程笔记27-原型模式 —
- 设计模式之美-课程笔记26-建造者模式 —
- 设计模式之美-课程笔记25-工厂模式 —
- 116. Populating Next Right Pointers in Each Node 117. Populating Next Right Pointers in Each Node II —
- 270. Closest Binary Search Tree Value —
- 285. Inorder Successor in BST —
- 297. Serialize and Deserialize Binary Tree —
- 230. Kth Smallest Element in a BST —
- 173. Binary Search Tree Iterator —
- 94. Binary Tree Inorder Traversal —
- 108. Convert Sorted Array to Binary Search Tree —
- 124. Binary Tree Maximum Path Sum —
- 337. House Robber III —
- 设计模式之美-课程笔记25-单例模式 —
- 设计模式之美-课程笔记24-规范与重构实战-信息统计框架 —
- 236. Lowest Common Ancestor of a Binary Tree —
- 设计模式之美-课程笔记23-编程规范&代码质量实战（ID生成器）2 - 异常处理 —
- 设计模式之美-课程笔记22-编程规范&代码质量实战（ID生成器） —
- 235. Lowest Common Ancestor of a Binary Search Tree —
- 98. Validate Binary Search Tree —
- 设计模式之美-课程笔记21-编程规范20则 —
- 110. Balanced Binary Tree —
- 104. Maximum Depth of Binary Tree —
- 111. Minimum Depth of Binary Tree —
- 298. Binary Tree Longest Consecutive Sequence —
- 112. Path Sum & 113. Path Sum —
- 257. Binary Tree Paths —
- 226. Invert Binary Tree —
- 101. Symmetric Tree —
- 设计模式之美-课程笔记20-规范与重构4 —
- 设计模式之美-课程笔记19-规范与重构3 —
- 141. Linked List Cycle & 142. Linked List Cycle II —
- 83. Remove Duplicates from Sorted List —
- 设计模式之美-课程笔记18-规范与重构2 —
- 设计模式之美-课程笔记17-规范与重构1 —
- 设计模式之美-课程笔记16-设计原则实战2-接口调用信息统计框架 —
- 350. Intersection of Two Arrays II —
- 34. Find First and Last Position of Element in Sorted Array —
- 162. Find Peak Element —
- 153. Find Minimum in Rotated Sorted Array && 154. Find Minimum in Rotated Sorted Array || —
- 33. Search in Rotated Sorted Array& 81. Search in Rotated Sorted Array II —
- How to stay motivated when your goal is far away? —
- 针对业务系统的开发，如何做需求分析和设计？ —
- 35. Search Insert Position —
- 278. First Bad Version —
- How to solve "org.hibernate.LazyInitializationException: failed to lazily initialize a collection of role: xxx, no session or session was closed" —
- 设计模式之美-课程笔记14-设计原则8-迪米特法则LOD —
- 设计模式之美-课程笔记13-设计原则7-DIY —
- 361. Bomb Enemy —
- 296. Best Meeting Point —
- 设计模式之美-课程笔记12-设计原则6-KISS&YAGNI —
- 设计模式之美-课程笔记11-设计原则5-依赖反转 —
- 设计模式之美-课程笔记10-设计原则4-接口隔离 —
- 79. Word Search —
- 设计模式之美-课程笔记8-设计原则2-开闭原则(OCP) —
- 设计模式之美-课程笔记7-设计原则3-里氏替换（LSP) —
- 240. Search a 2D Matrix II —
- 设计模式之美-课程笔记7-设计原则1-单一职责(SRP) —
- 74. Search a 2D Matrix —
- 378. Kth Smallest Element in a Sorted Matrix —
- 329. Longest Increasing Path in a Matrix —
- 311. Sparse Matrix Multiplication —
- 设计模式之美-课程笔记5-贫血模型案例（虚拟钱包） —
- 设计模式之美-课程笔记6-接口鉴权功能案例分析 —
- 59. Spiral Matrix II —
- 设计模式之美-课程笔记4-继承与组合 —
- 54. Spiral Matrix —
- 48. Rotate Image —
- 设计模式之美-课程笔记3-接口与抽象类 —
- 341. Flatten Nested List Iterator —
- 374. Guess Number Higher or Lower —
- 84. Largest Rectangle in Histogram —
- 设计模式之美-课程笔记2-面向对象与面向过程 —
- 227. Basic Calculator II —
- 设计模式之美-课程笔记1-面向对象概念们 —
- 《褚时健传》读后 —
- OOD, Design Patterns, Design Principles —
- 224. Basic Calculator —
- 394. Decode String —
- 71. Simplify Path —
- Using Exception In Java —
- An Introduction to ThreadLocal in Java —
- 150. Evaluate Reverse Polish Notation —
- 232. Implement Queue using Stacks —
- 225. Implement Stack using Queues —
- 155. Min Stack —
- 56. Merge Intervals —
- 23.Merge k Sorted Lists —
- 338.Counting Bits —
- 318. Maximum Product of Word Lengths —
- 268. Missing Number —
- 215. Kth Largest Element in an Array —
- 201. Bitwise AND of Numbers Range —
- 191. Number of 1 Bits —
- 41. First Missing Positive —
- 389. Find the Difference —
- 743. Network Delay Time —
- 1135. Connecting Cities With Minimum Cost —
- 323. Number of Connected Components in an Undirected Graph —
- 305. Number of Islands II —
- a-note-of-union-find —
- 261. Graph Valid Tree —
- 269. Alien Dictionary —
- System Design Case Study 7 - Design A Notification System —
- 207. Course Schedule & 210. Course Schedule II —
- 254. Factor Combinations —
- Hibernate getter and setter for enum value —
- 377. Combination Sum IV —
- 216. Combination Sum III —
- 77. Combinations —
- 40. Combination Sum II —
- 39. Combination Sum —
- 31. Next Permutation —
- 46. Subsets & 90 Subsets II —
- DFS vs Backtracking —
- A Daily Issue in Docker-No Space Availbale on VM Due to too many binlog —
- 52. N-Queens II & 51. N-Queens —
- 46. Permutations —
- A Daily Issue in Docker-No Space Availbale on VM Due to too many binlog —
- PMD Violation: Chained Append vs Calling Consecutively —
- 127. Word Ladder —
- System Design Case Study 6 - Design A Web Crawler —
- 339. Nested List Weight Sum & 364.Nested List Weight Sum II —
- System Design Case Study 5 - Design A URL shortener —
- 130. Surrounded Regions —
- 286. Walls and Gates —
- 200. Number of Islands —
- 133. Clone Graph —
- System Design Case Study 4 - Design A Unique ID Generator In Distributed System —
- Random All In One - 398. Random Pick Index&384. Shuffle an Array&382. Linked List Random Node&380. Insert Delete GetRandom O(1)&138. Copy List with Random Pointer —
- 212. Word Search II —
- 211. Design Add and Search Words Data Structure —
- A Quick Note of Trie —
- 208. Implement Trie (Prefix Tree) —
- A quick note on difference of key and index in MySQL —
- 134. Gas Station —
- 45. Jump Game II —
- System Design Case Study 3 - Design A Key Value Store —
- A Quick Note of Dynamic Programming and Greedy Algorithm —
- A Quick Note of Binary Index Tree —
- 55. Jump Game —
- System Desin Case Study 2 - Consistent Hashing —
- 452. Minimum Number of Arrows to Burst Balloons —
- A Quick Note of Segment Tree —
- 353. Design Snake Game —
- System Design Case Study - 1 Design A Rate Limiter —
- 348. Design Tic-Tac-Toe —
- 288. Unique Word Abbreviation —
- 251. Flatten 2D Vector —
- System Design Basic 4 - The Framework to breakdown system design questions —
- 284. Peeking Iterator —
- 362. Design Hit Counter —
- System Design Basic 3 - Estimation —
- 346. Moving Average from Data Stream —
- Systen Design Basic 1 - The First Glance —
- System Design Basic 2 - A Single System Example' —
- httpservelet&Servelt&Thread-per-request' —
- 359. Logger Rate Limiter —
- Optimal substructure & Overlapping subproblems —
- 322. Coin Change —
- 265. Paint House II && 256. Paint House —
- 221. Maximal Square —
- 72. Edit Distance —
- 64. Minimum Path Sum —
- 279. Perfect Squares —
- 62. Unique Paths —
- Best Time to Buy and Sell Stock Serie —
- 139. Word Break —
- 70. Climbing Stairs —
- 887. Egg Drop —
- 198. House Robbery & 213. House Robbery II & 337. House Robbery III —
- 10. Regular Expression Matching —
- a-new-way-to-thinking —
- Most Inspired Quote Starting 2023 —
- 2022 —
- Newton Method —
- Intro to Iterator in Java —
- Static in Java —
- JMockit Basic —
- Mockito Basic —
- Grafana 101 —
- Grafana Alerts —
- Google Code Review Practice —
- Wavefront Migration —
- Spring实战(第四版)- part4(Spring集成) —
- 墨问西东的一次聚会 —
- Spring实战(第四版)- part3(后端部分) —
- Spring实战(第四版)- part2(SpringMVC构建Web应用实例) —
- Spring实战(第四版)- part1(基础部分) —
- Date in Java Java中的日期 —
- 如何做性能测试 How To Do Performance Test —
- 思考 —
- 我的2017-2022 —
- A tool - web page processing —