APL Problem Solving Competition

Ages:Elementary, Middle School, High School, Undergraduate, Graduate, Professional

Type:Submission

Categories:Coding & Computer Science, Programming Language

Scope:International

This competition has not yet posted any deadlines.

https://contest.dyalog.com

Dyalog Ltd invites you to use the APL programming language and your problem solving skills to compete for a total of USD 6,500 in cash prizes and a paid trip to the next Dyalog user meeting.

The competition is free to enter.

APL is an array-oriented programming language that will change the way you think about problems and data. It doesn't take long to learn enough to participate in the competition. Many previous winners of the competition learned APL after they heard about the competition – APL is easy to learn and fun to use, and this is your opportunity to profit from the experience!

The competition consists of two parts:

  • Phase 1 asks you to solve 10 puzzles by writing short APL functions, allowing you to demonstrate array-oriented thinking. You can begin without registering — your solutions should be stored by your browser until you decide to register and submit them (not all browsers do this).
  • Phase 2 comprises a collection of more difficult problems, each having one or two tasks. In addition to requiring array-oriented thinking, this enables you to show off your ability to write larger amounts of well-documented, high-quality code.
Please see the competition's website for submission formatting requirements.

Phase 1 will mainly be judged based on:
  • Generality: does your function handle the given edge-cases?
  • Use of array-oriented thinking: did you write array-oriented APL or something that looks more like C# written in APL?
You should not include comments in your Phase 1 solutions. Phase 2 will mainly be judged based on:
  • Did you solve the problem?
  • Does your solution demonstrate appropriate use of array-oriented techniques? Solutions that use looping where an obvious array-based solution exists will be judged lower.
  • Did you comment your solution? It's not necessary to write a novel, or add a comment to every line, but comments describing non-trivial lines of code are advised. These help the judging committee determine your level of understanding of the problem and its solution.
  • Is your solution original? Your solution should be your own work and not a copy or near-copy of an already-published solution.
This competition has not yet listed it's awards.

Website: https://contest.dyalog.com

Managing Organization: Dyalog Ltd

Contact:

contest@dyalog.com

Entry Fee: $0

Eligibility:
The competition is open to everyone except Dyalog employees and problem set contributors. Proof of full-time primary, secondary, college or graduate enrolment is necessary to claim any of the prizes (except the non-student prize). You can be on a sabbatical as long as you will be returning to full-time student status within a year. Anybody is welcome to enter, but cash prizes are only available to full time students. There is a separate prize available for professional entrants.

This competition has not yet posted any deadlines.

Overview

Dyalog Ltd invites you to use the APL programming language and your problem solving skills to compete for a total of USD 6,500 in cash prizes and a paid trip to the next Dyalog user meeting.

The competition is free to enter.

APL is an array-oriented programming language that will change the way you think about problems and data. It doesn't take long to learn enough to participate in the competition. Many previous winners of the competition learned APL after they heard about the competition – APL is easy to learn and fun to use, and this is your opportunity to profit from the experience!

Process

The competition consists of two parts:
  • Phase 1 asks you to solve 10 puzzles by writing short APL functions, allowing you to demonstrate array-oriented thinking. You can begin without registering — your solutions should be stored by your browser until you decide to register and submit them (not all browsers do this).
  • Phase 2 comprises a collection of more difficult problems, each having one or two tasks. In addition to requiring array-oriented thinking, this enables you to show off your ability to write larger amounts of well-documented, high-quality code.
Please see the competition's website for submission formatting requirements.

Criteria

Phase 1 will mainly be judged based on:
  • Generality: does your function handle the given edge-cases?
  • Use of array-oriented thinking: did you write array-oriented APL or something that looks more like C# written in APL?
You should not include comments in your Phase 1 solutions. Phase 2 will mainly be judged based on:
  • Did you solve the problem?
  • Does your solution demonstrate appropriate use of array-oriented techniques? Solutions that use looping where an obvious array-based solution exists will be judged lower.
  • Did you comment your solution? It's not necessary to write a novel, or add a comment to every line, but comments describing non-trivial lines of code are advised. These help the judging committee determine your level of understanding of the problem and its solution.
  • Is your solution original? Your solution should be your own work and not a copy or near-copy of an already-published solution.

Awards

This competition has not yet listed it's awards.

Participate

Website: https://contest.dyalog.com

Managing Organization: Dyalog Ltd

Contact:

contest@dyalog.com

Entry Fee: 0

Eligibility:
The competition is open to everyone except Dyalog employees and problem set contributors. Proof of full-time primary, secondary, college or graduate enrolment is necessary to claim any of the prizes (except the non-student prize). You can be on a sabbatical as long as you will be returning to full-time student status within a year. Anybody is welcome to enter, but cash prizes are only available to full time students. There is a separate prize available for professional entrants.

Deadlines

This competition has not yet posted any deadlines.