Truong Nhu Khang[DS-for dummies] Graph algorithms you should know (2)Welcome back to my series, today we will discover the edge classification, and Topological sorting, Articulation points, and bridges…Jul 3, 20202Jul 3, 20202
Truong Nhu Khang[DS-for dummies] Graph algorithms you should know (1)Welcome back to the data structure for dummies series, Today we will explore the Graph data structure that is a really tough and popular…Apr 9, 20201Apr 9, 20201
Truong Nhu KhangWhy merge sort’s time complexity is O(NlogN)? Explain by mathematicIn this article, I will explain why merge sort time complexity is O(nLogn) by mathematic.Mar 28, 20201Mar 28, 20201
Truong Nhu Khang[DS-For Dummies] hash function implementationJust some simple hash function implementationSep 8, 2019Sep 8, 2019
Truong Nhu Khang[DS-For Dummies] Heap 2This article describes the Heap Data structure in an easy way and some use case of Heap Data structure. It suits for beginner or developer…Aug 2, 2019Aug 2, 2019
Truong Nhu KhangSome classical sub-array ProblemJust for algorithm practicing.Jul 15, 2019Jul 15, 2019
Truong Nhu KhangThe way I detect out of memory error in a spring boot + spring data web application.I join a freelance project as a part-time job recently. As usual, it hasn’t any special features. Just a simple flowJul 4, 20194Jul 4, 20194
![[DS-for dummies] Graph algorithms you should know (2)](https://miro.medium.com/v2/resize:fill:160:106/1*HlPRXDOFtBdfvE4y2V6dbQ.png)
![[DS-for dummies] Graph algorithms you should know (2)](https://miro.medium.com/v2/resize:fill:320:214/1*HlPRXDOFtBdfvE4y2V6dbQ.png)
![[DS-for dummies] Graph algorithms you should know (1)](https://miro.medium.com/v2/resize:fill:160:106/1*W0VCMw0WqXsk3VsACzUYAw.png)
![[DS-for dummies] Graph algorithms you should know (1)](https://miro.medium.com/v2/resize:fill:320:214/1*W0VCMw0WqXsk3VsACzUYAw.png)
![[DS-For Dummies] hash function implementation](https://miro.medium.com/v2/da:true/resize:fill:160:106/1*oTaIMBCVLeur45kMTP0AdA.gif)
![[DS-For Dummies] hash function implementation](https://miro.medium.com/v2/da:true/resize:fill:320:214/1*oTaIMBCVLeur45kMTP0AdA.gif)
![[DS-For Dummies] Heap 2](https://miro.medium.com/v2/resize:fill:160:106/1*7-ODefBZ_ilRQtna9h-DfQ.jpeg)
![[DS-For Dummies] Heap 2](https://miro.medium.com/v2/resize:fill:320:214/1*7-ODefBZ_ilRQtna9h-DfQ.jpeg)
![[DS-For Dummies] Heap](https://miro.medium.com/v2/resize:fill:160:106/1*fvgzmsxvAzMQaXjs58izdg.png)
![[DS-For Dummies] Heap](https://miro.medium.com/v2/resize:fill:320:214/1*fvgzmsxvAzMQaXjs58izdg.png)
![OS note [Process]](https://miro.medium.com/v2/resize:fill:160:106/1*pplsGMeRKFcc0IHr1j3YwA.jpeg)
![OS note [Process]](https://miro.medium.com/v2/resize:fill:320:214/1*pplsGMeRKFcc0IHr1j3YwA.jpeg)
