Technical Interview - (Q1) Write some class/interface to represent a credit & debit card (Q2) Write method to delete the node (and its children) in a tree that has a val=0 + asked time complexity = O(N). (Q3) Return a linked list with initial structure (1->2->3->4->5->null) that now has structure (1->3->5->2->4->null) + asked time complexity = O(N)
Non Disclosure on Technical. LeetCode beginning medium levels.
What's one project that makes you the most proud to have completed?
For the coding: How to find a specific part of a linked list (from the end).
How many quarters does it take stacked on top of each other to reach the top of the Empire State Building.
Technical: write code to check if a BST is valid behavioral: Talk about how you described a technical project to a nontechnical person 3 other questions I don't remember Case: Viability of a cost saving protocol, given two different vendors and expected to report which one is better
Design a bank account system
Sort n k-lengthed linked lists
Explain something technical to a non-technical person
Describe a time when you, with another person or team, solved a complex problem. Talk about a time when you changed the status quo.
Viewing 9671 - 9680 interview questions