June 11, 2020
23 minimum Heap - merge k sorted lists
Merge k sorted lists to one sorted linked list.
23 minimum Heap - merge k sorted lists
Merge k sorted lists to one sorted linked list.
The algorithm is challenge to work on. The linked list is important data structure and it takes me a lot of practice. I solved over 30 linked list algorithms in my 2018 practice on Leetcode, and also on Hackerrank. Here is the blog to show my practice of linkedlist.
Merge sort is also popular algorithm in data structure and algorithm course. The master theorem is not tough for me since I have math bachelor degree from 1984 to 1988.
How to design a minimum heap using C# SortedDictionary<int, Queue<List>>? It is interesting to review the code written in 2018 and 2019.
What I missed from 2015 to 2019 is to write down a case study, and explain the thing from problem statement, idea to solve, go over a case study, explain the solution step by step. I like this case study method from Harvard business school teaching The HBS Case Method. I like to apply my practice as well, and I will be expert to write case study for algorithms in short future.
I also like to take some time to review how to write a showcase class with good object-oriented design, and also review those C# interface IEnumerable etc.
2015 August
C# merge two lists idea practice in August 2015
August 11, 2018
C# solution using minimum heap
July 14, 2019
C# using SortedDictionary
C# merge two lists idea practice in August 2015
August 11, 2018
C# solution using minimum heap
July 14, 2019
C# using SortedDictionary
"23 merge k sorted lists" is a hard level algorithm. Please take a look my related showcase of easy level, medium level algorithm using minimum heap.
- Third Maximum Number, link is here.
No comments:
Post a Comment