Leetcode Biweekly Contest 29
I have recently started to attend the online coding contest. Leetcode has held weekly contests on Sunday early mornings - which isn't ideal for coders living in Europe.
However, they have biweekly contests, which is run the Sat 3:30 to 5:30 (BST) every two weeks.
Today's contest: https://leetcode.com/contest/biweekly-contest-29
I have finished the four puzzles using around 1 hour.
The programming language I choose is C++. I have 1 Wrong Answer submission for Problem 2 and 4 - which adds total 10 minutes time penalization
Average Salary Excluding the Minimum and Maximum Salary
https://leetcode.com/contest/biweekly-contest-29/problems/average-salary-excluding-the-minimum-and-maximum-salary
Simple - use std::accumulate to get sum, min_element and max_element to get the min and max value, then compute the average without them
The kth Factor of n
https://leetcode.com/contest/biweekly-contest-29/problems/the-kth-factor-of-n
Again, easy, straightforward.
Longest Subarray of 1's After Deleting One Element
https://leetcode.com/contest/biweekly-contest-29/problems/longest-subarray-of-1s-after-deleting-one-element
Use two arrays to hold the maximum continuous 1's in the left and right direction. The answer is thus max(left[i] + right[i])
Parallel Courses II
https://leetcode.com/contest/biweekly-contest-29/problems/parallel-courses-ii/
Topology sorting? Greedy... I use DFS.
I'll share the solutions on the blog in more details soon.
Although the contest has ended, you can try to participate on the virtual contest.
Every little helps! I hope this helps!
Steem On!~
If you like my work, please consider voting for me, thanks!
https://steemit.com/~witnesses type in justyy and click VOTE
Alternatively, you could proxy to me if you are too lazy to vote!
Also: you can vote me at the tool I made: https://steemyy.com/witness-voting/?witness=justyy