JobsJob TrackerJob alerts

Fanatics · 17 questions

All 17Coding 15
  • Max Level Sum in Binary TreeCoding
  • Rotting OrangesCoding
  • N-Meetings in Two RoomsCoding
  • Container With Most WaterCoding
  • Tree manipulation for optimal time and space complexityCoding
  • Implement Quick SortCoding
  • Hashing coding problemCoding
  • Implement a queue using the minimum number of stacksCoding
  • Data structure for undo and redo operationsCoding
  • Find the middle element in a Linked ListCoding
  • Next greater elementCoding
  • Add 1 to a number represented by a linked listCoding
  • OS Fundamentals
  • OOP Concepts
  • Linked List Palindrome CheckCoding
  • Search in sorted matrixCoding
  • Boundary Traversal of binary treeCoding
← Fanatics questions
  1. Interview questions
  2. Fanatics
  3. Max Level Sum in Binary Tree
Coding

Max Level Sum in Binary Tree

Filed under Fanatics

The question

Find and return the tree level that has the maximum sum of its node values.

No write-up yet. Related questions below have one.

Related Fanatics questions

  • N-Meetings in Two Rooms
  • Tree manipulation for optimal time and space complexity
  • Hashing coding problem
  • Implement a queue using the minimum number of stacks
  • Data structure for undo and redo operations
Rotting Oranges →

Collected from public candidate posts and coding forums. Updated Nov 2026.