Table of Contents
◾️ What Are Function Challenges
Applicants choose any supported programming language and implement a function that returns the correct output for the given input—no standard input/output required.
This format measures foundational coding ability as well as skills in data manipulation, modeling, and algorithmic thinking.
Difference from Algorithm Style:
Algorithm challenges follow competitive-programming conventions and rely on standard I/O, whereas Function challenges are solved entirely through function arguments and return values.
◾️ Difficulty Levels
Easy
Focuses on basic structured programming (conditionals, loops) and simple data operations (maps, sets, etc.). Demonstrates the everyday coding skills expected of a Systems Engineer or Programmer.
Medium
Requires implementation of more advanced algorithms—sorting, graph traversal, simple dynamic programming, queues, binary search, and similar topics. Shows the ability to write efficient, low-overhead code and potential in areas such as data analytics, image processing, and machine learning.
Hard
Demands mathematical insight, complex data structures, and heavy implementation. Applicants must efficiently handle large datasets and high-complexity operations—skills needed for high-performance engineering.
◾️ Scoring Method
Automated unit tests supply text or file inputs and verify the function’s output.
Test cases cover:
Basic functionality
• Error handling for invalid input
• Edge cases
• Large-scale I/O that only optimized solutions can pass
Scores reflect how many requirements the submission satisfies.
◾️ Viewing Answers in Detail
Click the applicant’s name to open Exam Results, where you can review the challenge title, score, elapsed time, and submission timeline.