1. if you have a video camera on top of a vehilce, and you shoot a car that come right in front of your car, how can you tell the time t that will take the car to crash you? 2.asked me to solve the binary distance transform problem with 1d, and later on as home work - to solve the 2d problem.
1) A pretty number is a number in base 4 whose digits are all either 1 or 0. How many pretty numbers are there < n? 2) Given a list of moves in reversi, return the total number of pieces for each player at the end of the game 3) Trees are given as lists of nodes, where each node is a list with data [key, value, *children), where the order of the children matters. Two trees must be merged (left and right). For a given merged node with the same key between left and right inputs, the merged value should come from the right tree. The list of the merged node's children should start with children from the left tree's child list, and then the leftover right tree's child list. Output (key1,value1,...) in pre-order traversal
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.
- 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.
Viewing 711 - 720 interview questions