Coding Assessment was two questions in two hours. The questions were similar to, but not the exact same as: 1. Find min number of moves needed for knight on chess board to move to target square 2. Implement custom stack with getMin() method in O(1) time. Video Interview gave you ~8 questions to answer in about ~45s each. Sample questions include: 1. What is one weakness you have 2. Is O(1) time algorithm the fastest 3. Can signed and unsigned integers store the same number of values 4. Describe a specific data structure to a non-technical person
Graduate Software Engineer Interview Questions
4,497 graduate software engineer interview questions shared by candidates
Questions about threading, memory allocation, explain a stack to a non technical person
Technical Challenge: Implement custom stack and knight path problem (2 questions) in C++ or Java
- Is O(1) time algorithm the fastest. - Can an O(1) algorithm get faster? - Can signed and unsigned integers store the same number of values. - Is Quicksort the fastest sorting algorithm? - What is the difference between Set and List? - Is searching through a sorted binary tree (binary search tree) always have a better complexity than binary search? - Hashmap/hashtable is always more efficient (faster) than linear search? - Describe "recursion" to a non-technical person.
Explain HashMap to a non-technical person.
As a group, present a company stock pitch
What did you enjoy most during your time at university.
General competency questions were asked from me.
run through your project mentioned in the CV
Initial in-person interview went through my resume and asked about my experience. There were also some light technical/design questions (e.g. easy leetcode type question, and questions about how I would identify and clean up messy code).
Viewing 2301 - 2310 interview questions