IBM Canada Internship Technical Phone Screen Overview

After submitting your resume, the co-op program will send you an online assessment (OA) confirmation link. Be sure to click it! Then you'll get this HackerRank question, two questions in one hour. The

After submitting your resume, the co-op program will send you an online assessment (OA) confirmation link. Be sure to click it! Then you'll get this HackerRank question, two questions in one hour. The first one is probably a public OA for a development position (anyway, after I finished one, all the other HR links showed I couldn't do any more). A minor modification of LeetCode's "Pulling Mist" (allows numbers of the same value). A typical DP problem. https://leetcode.com/discuss/post/824381/na-amazon-sde-intern-oa-2-by-anonymous_u-g4wj/ I only thought of a sorting version at the time, take a look. The second one is probably a public OA for a data-oriented position (but I only applied for one). 1. Given an integer array and an integer i. Define the operation: Take the absolute value of the difference between any two elements and put it at the end of the array. Minimize the smallest element in the array after i operations of the above. I feel this needs to be done recursively or with DP. Greedy code is missing a case or times out, I don't have time for recursion, I'm too bad at it. 2. Write a SQL statement (SELECT COUNT() WHERE ). If you've ever written SQL, you can't possibly not know this.