# Leetcode Merge k Sorted Lists problem solution in C#

Feb 25, 2023

In the Leetcode Merge k Sorted Lists problem solution in C# programming Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Example 1:

Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
[
1->4->5,
1->3->4,
2->6
]
merging them into one sorted list:
1->1->2->3->4->4->5->6

Constraints:

• k == lists.length
• 0 <= k <= 104
• 0 <= lists[i].length <= 500
• -104 <= lists[i][j] <= 104
• lists[i] is sorted in ascending order.
• The sum of lists[i].length will not exceed 104.

## Leetcode Merge k Sorted Lists problem solution in C# programming

``````public class Solution {
public ListNode MergeKLists(ListNode[] lists) {
SortedList<int, int> sl = new SortedList<int, int>();
foreach(ListNode item in lists)
{
ListNode item1 = item;
while(item1 != null)
{
if(!sl.ContainsKey(item1.val)){

}
else{
sl[item1.val]++;
}
item1 = item1.next;
}
}

ListNode sortedLL = new ListNode();
ListNode temp = sortedLL;

foreach(var item in sl){
int valTimes = item.Value;
for(int i = 0; i < valTimes; i++){
temp.next = new ListNode(item.Key);
temp = temp.next;
}

}

return sortedLL.next;
}
}``````

#### By Neha Singhal

Hi, my name is Neha singhal a software engineer and coder by profession. I like to solve coding problems that give me the power to write posts for this site.