No, the first round is usually a timed coding interview where the goal is to get an optimal solution as fast as possible. You should not be talking much with the interviewer. The intro (if there is one) is a quick exchange of names and last job worked at, then immediately diving into coding problem. You cannot start with a naive solution, interviewer will ask you to skip and go straight to optimal (this happened to me more than once). If you solve that, they ask followup questions to probe your knowledge, and if you beat that, you get a second problem.
After that might be more rounds of coding, system design, and hiring manager interview.
The part where you can be charismatic is once you pass the initial technical bar(s). The talking/behavior is a later point in time and is relatively easy IMO.
Examples of questions I've been asked:
1) https://leetcode.com/problems/non-overlapping-intervals/
2) https://leetcode.com/problems/design-add-and-search-words-da...
3) https://leetcode.com/problems/detect-cycles-in-2d-grid/
4) https://leetcode.com/problems/evaluate-reverse-polish-notati...
5) https://leetcode.com/problems/word-search/
So nothing too hard but you have to instantly solve it, and optimally. The hardest one I got was some type of AI search problem, where you have to find a way to navigate obstacles in a 2d grid, and another geometry problem I've not seen before.
Along with this questions like: what pitfalls arise in concurrency? Explain how you would design a pointer type that can be shared between threads, what is epoll? How do you debug a distributed system? etc.
After that might be more rounds of coding, system design, and hiring manager interview.
The part where you can be charismatic is once you pass the initial technical bar(s). The talking/behavior is a later point in time and is relatively easy IMO.
Examples of questions I've been asked:
1) https://leetcode.com/problems/non-overlapping-intervals/
2) https://leetcode.com/problems/design-add-and-search-words-da...
3) https://leetcode.com/problems/detect-cycles-in-2d-grid/
4) https://leetcode.com/problems/evaluate-reverse-polish-notati...
5) https://leetcode.com/problems/word-search/
So nothing too hard but you have to instantly solve it, and optimally. The hardest one I got was some type of AI search problem, where you have to find a way to navigate obstacles in a 2d grid, and another geometry problem I've not seen before.
Along with this questions like: what pitfalls arise in concurrency? Explain how you would design a pointer type that can be shared between threads, what is epoll? How do you debug a distributed system? etc.