TCS Codevita 2024: Registration Opens- Apply Now

Competition Dates

• Zone 1: November 15 – November 16, 2024 (Global, Chennai, Indore, Nagpur, Mumbai, Ahmedabad, Pune, Trivandrum)
• Zone 2: November 29 – November 30, 2024 (Hyderabad, Delhi, Bengaluru, Lucknow, Kolkata)

Registration Deadline
Complete your registration by November 11, 2024, 12 PM IST (UTC 6:30 AM) to participate.

Competition Duration
Participants will have 6 hours to showcase their coding skills.

Prize Money
Total prize pool of USD 20,000 for top coders.

Global Ranking
All participants compete for positions in a global ranking list.

Benefits for Participants

• Top Prizes: Total prize pool of USD 20,000 for top 3 coders.
• Emerging Talent Awards: Special awards for 1st and 2nd-year undergraduate students.
• Top Women Coders: Recognizing exceptional women coders in the competition.
• Exclusive Internships: Opportunities with the CTO Research Team (applicable to certain regions).
• Internships for Pre-Final Year Students: Unique opportunities to gain industry experience.
• Job Offers for Final Year Students: Potential job opportunities for outstanding performers.
• Grand Finale in India: Finalists get the chance to attend the grand finale in India.

Eligibility Criteria

• Current Students: Open to undergraduate and postgraduate students in science or engineering streams.
• Graduation Years: Students expecting to graduate in 2025, 2026, 2027, or 2028.
• Global Participation: Any student from a recognized institute worldwide is eligible.

Journey to CodeVita Success

• Registration: Sign up on the TCS CodeVita portal and complete your profile to start the journey.
• MockVitas: Participate in mock rounds to get familiar with the contest structure and types of questions.
• Actual Rounds: Progress through the competition by successfully clearing the rounds.
• Finale: Compete in the grand finale for a chance to win the prize money and global recognition.

Sample Problem Overview: “On A Cube”

Problem Statement
A beetle moves across a cube (10 cm x 10 cm x 10 cm) in search of honey spots located at various points on the cube’s surface. Starting at a specific point, it navigates to each honey spot, using the shortest path on the cube’s surface (excluding the bottom face). The beetle rounds off each distance it travels between points to two decimal places.

• Input:
  • N: Number of points to visit, including the starting point.
  • Coordinates (x, y, z) of each point.
• Output: Total rounded distance traveled, to two decimal places.

Example
Input:

Output: