JobsJob TrackerJob alerts

LG Soft · 14 questions

All 14Coding 7Low-Level Design 3Behavioral 1
  • Minimum Time to Reach Championship VenuesCoding
  • Virtual Functions and V-tables in C++Low-Level Design
  • Mutex and Semaphore ImplementationLow-Level Design
  • First Repeating Character and Array RotationCoding
  • Reverse a string and count character frequencyCoding
  • Find Good NumberCoding
  • Water bucket puzzle
  • Cake cutting puzzle
  • Refrigerator light puzzle
  • C++ OOPs and core concepts online testCoding
  • Discussion on C++, OS, and CN conceptsLow-Level Design
  • Aptitude, Reasoning and Data Structures AssessmentCoding
  • Interfaces and Inheritance in JavaCoding
  • Background and Goals DiscussionBehavioral
← LG Soft questions
  1. Interview questions
  2. LG Soft
  3. Minimum Time to Reach Championship Venues
Coding

Minimum Time to Reach Championship Venues

Filed under LG Soft

The question

Given an array of N numbers where two numbers host a championship and the rest must reach either venue via bidirectional flights with unit travel time, find the total minimum time taken for all non-hosting nodes to reach their nearest hosting venue.

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

Related LG Soft questions

  • First Repeating Character and Array Rotation
  • Reverse a string and count character frequency
  • Find Good Number
  • C++ OOPs and core concepts online test
  • Aptitude, Reasoning and Data Structures Assessment
Virtual Functions and V-tables in C++ →

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