The first question was graph's k-coloring, which was difficult and I didn't prepare for it. I answered using recursion to solve it and asked the interviewer a few questions to clarify the problem. I tried but didn't complete the solution.
Given m colors, find whether the graph with n vertices can be colored.
The following metrics were computed from 32 interview experiences for the Oracle Principal Software Engineer role in United States.
Oracle's interview process for their Principal Software Engineer roles in the United States is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having good feelings for Oracle's Principal Software Engineer interview process in United States.