General qualification Q&A, scenario based examples, request of my prior material examples, and a request to build a 5 minute elearning example to demonstrate my abilities. This took about 5 days to complete as I provided two different types of interactive courses. They really liked my work, and moved me to an in person interview. I was asked about my tenure, my past management positions, and explain my ideal working conditions, along with how I would over come obstacles.
Conocer acerca de mi career path, personalidad y métodos de resolución de problemas.
Coding question: given a list of student IDs and courses they are enrolled in, find the courses each pair of students are enrolled in.
Random Walk Distances On Graphs Given a graph and any pair of vertices i and j, it is possible to take a random walk starting from i and eventually arrive at j, if i is connected to j. Specifically, starting at i, each time we choose an edge to traverse randomly according to some probability distribution P, and repeat until we arrive at j for the first time. The number of edges traversed is a random variable with some expected value, which is the expected random walk distance from i to j. By this definition, the expected random walk distance from a vertex to itself is always 0. Furthermore, multiple traversals of an edge are also counted in the random walk distance. Your task is to write a program to estimate the expected random walk distance between all pairs of vertices in a given graph.
There were a lot of technical questions regarding my design process, preferred learning ideology and working experience
What was I currently doing?
Would you be willing to work long days and after hours with a personal sacrifice of work/life balance during the next six to eight months?
Informed this position was for online learning, but then asked if I could do instructor-led training?
Please share with us some personal experiences about some of the hardships you have faced and how you overcame these personal hardships.
Both techical screening and algorithms interview were Leetcode-style questions. I never saw exactly same problems on Leetcode, but very similar (Medium level)
Viewing 361 - 370 interview questions