Kakao Code Festival 2018 Preliminary Round Problem Explanations and Results Released

Kakao announced the results of the 'Code Festival 2019' preliminary round, stating that 64 participants with excellent scores among over 6,000 participants advanced to the finals. The list of finalists will be published on the homepage.

The released problem explanations for the preliminary round presented solution strategies for a total of six problems. The 'Short Coding' problem required conditional implementation, and the 'Dolls' problem introduced an O(N^2) optimization technique considering floating-point precision (float vs double) to minimize standard deviation. 'Short Coding' was a logical expression simplification problem, and 'Booster' was a graph search problem minimizing travel distance between checkpoints, with efficient approaches using Union-Find explained. The 'Prodo's 100 Days' problem involved finding the widest L-shaped rectilinear polygon in a histogram, presenting an algorithm combining Convex Hull Trick and stack. The 'Dolls' problem also released a solution utilizing parallel binary search and segment trees.