This coding challenge consists of 20 problems categorized under the following categories:
- Category 1: Language basics (4 questions)
- Category 2: Working with databases (4 questions)
- Category 3: HTTP Client support (5 questions)
- Category 4: HTTP RESTful services (1 question)
- Category 5: GraphQL (2 questions)
- Category 6: WebSocket (2 questions)
- Category 7: WebSub (2 questions)
The model for this challenge is to “Climb the Ladder”.
All code must be written using Ballerina.
You have 72 hours to complete your solutions, starting Thursday, 22 September, 2022 at 12.00 a.m. (GMT). We recommend you look at the Ballerina Learn page to familiarize yourself with the language.
As shown above, there will be 20 problems covering the main features of Ballerina. Each problem is worth 100 points. Whoever gets the most points with the best code quality will be declared the winner.
We will take the top 20 (by points obtained) and hand them over to a group of expert judges to choose the top 3 winners.
The judges will consider the correctness, authenticity, and how well you have utilizedBallerina's strengths when selecting the top 3.
You can participate even if you know a WSO2 contributor or one of the judges - we will do our best to ensure that nepotism does not occur.
You retain the ownership of all submitted code after the competition.
Entry to the competition is FREE.
Your account details must be complete and accurate

Judging Criteria

A set of test cases that are different from the sample test cases will be executed once you submit your code and you will be able to see your score out of 100 once the evaluation is completed.
For each submission, you will receive a test score (test_score) based on the number of test cases that passed. The maximum test score for a submission is 100.
Top 50 participants who meet the eligibility criteria for consolation prizes (50 USD) will receive the prize. In case of a tie (by score), the total time (the lower the better) taken to complete the challenge will be considered.
Top 20 participants with the highest score who meet the eligibility criteria for the main prizes will be picked for judges to evaluate their submissions for the main prizes.
Our judges will review the code based on correctness, authenticity and how well they showcase Ballerina's strengths. Based on this, they will assign a code review score (code_review_score). The maximum code review score for a submission is 100.
The final score (submission_score) of a submission will be calculated as follows:

submission_score = test_score * 0.8 + code_review_score * 0.2

The total score of the 20 participants will be adjusted with the submission score as calculated above.
The participant with the highest total score will receive the 1st prize (5000 USD).
The participant with the second-highest total score will receive the 2nd prize (2500 USD).
The participant with the third-highest total score will receive the 3rd prize (1000 USD).
Out of the candidates who fulfills the above criteria, top 50 by the overall score will be selected for the consolation prizes.

The hackathon is not open to officers, directors, employees, and advisory board members (and their immediate families and members of the same household) of WSO2, and its subsidiaries, interns, contractors, agents, judges, advertising and promotion agencies, and respective affiliates. The right to disqualify your submissions (within reason) remains with the judges.

Important!

The built-in web IDE of the HackerEarth platform has limited support for Ballerina, thus we recommend you set up Ballerina locally. You can download VSCode and install the Ballerina VSCode Extension from the marketplace. For each problem, you can download the package folder locally, implement the solution, test it, and then copy your solution into the web IDE in HackerEarth for submission. To download the problem folder from the online IDE:

right-click on the main folder and select download

Before you work on hackathon questions locally run this command to use the correct Ballerina version:

bal dist pull 2201.2.0

For any support on a specific question please ask on our `challenge-help` forum channel.