We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #67: Maximum path sum II
  4. Discussions

Project Euler #67: Maximum path sum II

Problem
Submissions
Leaderboard
Discussions

    You are viewing a single comment's thread. Return to all comments →

  • PrashantUnity
    10 months ago+ 0 comments

    Solution in c#

    static void Main(String[] args) 
    {
        var tt = Convert.ToInt32(Console.ReadLine());
        for(int i=0; i<tt; i++)
        {
            var list = new List<List<int>>();
            var loop = Convert.ToInt32(Console.ReadLine());
            
            for(int j=0; j<loop;j++)
            {
                var current = Console
                                .ReadLine()
                                .Trim()
                                .ToString()
                                .Split(' ')
                                .Select(x=>Convert.ToInt32(x))
                                .ToList();
                list.Add(current);
            }
            for (var m = list.Count - 2; m >= 0; m--)
            {
                for (var n = 0; n <= m; n++)
                {
                    list[m][n] += 
                    Math.Max(list[m + 1][n], list[m + 1][n + 1]);
                }
            }
            Console.WriteLine(list[0][0]);
        }
    }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy