Mathworks EDG挂经

Job Hunting Interview
, , , , , ,
1

女面试官，是实习转正的. 她有两年经验.
总体不难，总共一小时

店面和上门

一开始BQ

  • Tell me about yourself
  • Can you talk more about this project A ?
  • Can you talk more about the university project. How did you achieve B and C ?

Coding

  • Implement a queue using stack
    • Asked about coding the solution . Can use built-in stack . Try optimizing your solution.
    • Time complexity
    • I provided a O(N) time and O(N) space by using two stacks and then optimizing the solution to use only one stack.
  • Get the most frequent character from a string. All lowercase and characters may not be sorted.
    • Code solution.
    • Also asked to run code
    • This code worked fine. Ran for test cases and it worked fine too.
  • Design an algorithm to get the shorted distance between two nodes in a graph
    • Provide a high level idea rather than actual code
    • Provided BFS and how the structure of the graph and algorithm would look like
    • How is DFS and BFS different and what are the tradeoffs
  • Reverse linkedlist
    • Easy modification of previous node, current node and next node pointers
  • Do you know about Hashmap? What is it?
    • Key -> hash function -> value
  • Do you know about Design Patterns?
    • I answered no because I had just worked with them , not got much to learn during the short time I had worked with them

最后BQ

Why do yo want to join MathWorks

2 Likes