Oracle

After the screening interview, there was an initial pair programming session. The interviewer gave me two coding options, and I chose to implement (n^m mod y) without using libraries or pre-built functions. We heavily iterated through optimization st

It was an internal promotion. The interview was informal. Eligibility was based on the results of a performance review. The rating had to be at least a 4, preferably a 5, on the overall rating scale (out of 5).

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.