VOOZH about

URL: https://www.geeksforgeeks.org/contest-experiences/contest-experience-geeksforgeeks-mega-job-a-thon/

⇱ Contest Experience | GeeksforGeeks Mega Job-A-Thon - GeeksforGeeks


  • Courses
  • Tutorials
  • Interview Prep

Contest Experience | GeeksforGeeks Mega Job-A-Thon

Last Updated : 27 Sep, 2023

About the contest: GeeksforGeeks Mega Job-A-Thon

The GeeksforGeeks Mega Job-A-Thon was a highly anticipated coding contest aimed at freshers looking to kickstart their careers in the tech industry. It was a competitive challenge hosted on the GeeksforGeeks platform, known for its rigorous coding assessments and high-caliber participants.

The contest comprised three challenging coding questions that tested a wide range of skills, including problem-solving, algorithmic thinking, and coding proficiency. Each question was assigned a specific time limit, and participants were required to submit efficient solutions within these constraints.

  • Problem 1 - Array Manipulation: This problem involved manipulating an array based on a series of queries. It required careful consideration of data structures and optimization to solve efficiently. I initially struggled with understanding the problem statement but eventually managed to devise an algorithm that performed well.
  • Problem 2 - String Queries: This problem revolved around string manipulation and pattern matching. It was less complex than the first problem, but it demanded attention to detail and precision in implementing the algorithm. I found this problem relatively straightforward and solved it quickly.
  • Problem 3 - Tree Traversal: The third problem was the most challenging. It required traversing a tree and finding the longest path without repeating nodes. This problem pushed the limits of my tree traversal skills, and I spent a significant amount of time devising an efficient algorithm to tackle it.
  1. For Problem 1, I used a prefix sum technique to optimize the array manipulation process, significantly reducing the time complexity.
  2. Problem 2 was solved using a sliding window approach, which allowed me to efficiently search for patterns in the given strings.
  3. Problem 3 required a depth-first search (DFS) on the tree to find the longest path. I used a recursive DFS approach to tackle this problem.

Despite the challenges, I managed to successfully solve all three problems within the given time limits. I submitted my solutions and anxiously awaited the results. After a few days of anticipation, I received the exciting news that I had secured a position in the top 10% of participants in the GeeksforGeeks Mega Job-A-Thon. This achievement not only boosted my confidence but also opened up opportunities for interviews with top tech companies participating in the hiring challenge.

Overall, my coding contest experience in the GeeksforGeeks Mega Job-A-Thon was both challenging and rewarding. It reaffirmed my passion for coding and problem-solving while providing me with valuable exposure to real-world coding challenges and the opportunity to showcase my skills to potential employers.

Comment