Question

I have a dictionary like so –

public static Dictionary<int, List<int>> pegMap = new Dictionary<int, List<int>>();

Now I have populated the dictionary like say –

Key: 1 => Value: [3,2]
Key: 2 => Value: []
Key: 3 => Value: [6,7]

Now I want to find the key which has the highest value in the list.

Like in this case the the lambda should return 3 which denotes the key-value pair where key is 3 because the number 7 is present in the list in the dictionary where key happens to be 3.

Answer 1

Its a bit hacky but should work.

var dict = new Dictionary<int, List<int>>();

    dict.Add(1, new List<int>() { 1, 2 });
    dict.Add(2, new List<int>() { 4, 5 });
    dict.Add(3, new List<int>() { 1, 7 });

    var max = dict.Select(x => new { Key = x.Key, Value = x.Value.Max() }).OrderByDescending(x => x.Value).First().Key;  
// returns 3
        // Other sample input 
        dict.Add(1, new List<int>() { 1, 2 });
        dict.Add(2, new List<int>() { 4, 7 });
        dict.Add(3, new List<int>() { 1, 2 });
        // returns 2
        dict.Add(1, new List<int>() { 1, 2 });
        dict.Add(2, new List<int>() { 4, 7 });
        dict.Add(3, new List<int>() { 1, 7 });
        // returns 2
        dict.Add(1, new List<int>() { 1,10 });
        dict.Add(2, new List<int>() { 4, 7 });
        dict.Add(3, new List<int>() { 1, 7 });
        // returns 1

Edit: to the smallest value in the list with the largest value:

 var min_value_in_maxList = dict.Select(x => new { Key = x.Key, ValueMax = x.Value.Max(), ValueMin = x.Value.Min() }).OrderByDescending(x => x.ValueMax).First().ValueMin;