In a length n array of numbers, find an algorithm that finds the second largest number efficiently. There is an n + O(log n) answer.
Algorithm Development Engineer Interview Questions
880 algorithm development engineer interview questions shared by candidates
- Why you leave your current position and join Kinaxis? - Your interests, goals and expectation?
Coding question - very hard
Tell me about your background and CV
code up a blackjack solver
1. CV questions: ask some ML projects from the last company. 2. Heap Sort: Almost Sorted Array 3. 3x3 Colored Cube( surface red), P(5white1red)? 4. Pearson coefficient definition and application
Group Interview Tell me about yourself Situation based questions
Find the longest sequence of unique numbers in a binary tree starting at the root node. Meaning you need to find the longest path from the root node that doesn't contain any duplicate numbers.
Give me a specific example of a time when a co-worker or classmate criticized your work in front of others. How did you respond? How has that event shaped the way you communicate with others?
What was your project in your previous workplace?
Viewing 711 - 720 interview questions