How I Won the APL Problem Solving Competition - Student Winner's Experience
Offered By: Dyalog User Meetings via YouTube
Course Description
Overview
Explore a conference talk by Andrea Piseri, the grand prize winner of the 15th annual APL Problem Solving Competition. Delve into Piseri's experiences with APL and Dyalog as he discusses his solutions to the "open reading frames" and "time for a change" problems from phase 2 of the competition. Learn about his personal journey with APL and array programming, and gain insights into his problem-solving approaches. Discover the intricacies of working with FASTA format, implementing flat map and array-oriented solutions, and tackling recursive and dynamic programming challenges. Gain valuable lessons from Piseri's experience in the competition and his insights into APL programming.
Syllabus
About me
My journey with APL and array programming
Introducing the competition problems
Phase 2 problem 1 task 5 FASTA format and output
Solution overview
crf function to extract proteins
Flat map implementation of crf
Array-oriented approach with interval-index
Phase 2 problem 2 task 3 makeChange
Recursive solution by induction with pruning
Live coding dynamic programming solution
What I learned from APL and the problem solving competition
Taught by
Dyalog User Meetings
Related Courses
Algorithms: Design and Analysis, Part 2Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera