Oracle Interview Experience for SDE-2

Round 1:

• i < j < k, a[i] < a[k] < a[j] find if such sequence exists https://www.geeksforgeeks.org/check-whether-there-exists-a-triplet-i-j-k-such-that-arri-arrk-arrj-for-i-j-k/
• Stream of integers -> find the first unique element till then

Round 2:

• TaskScheduler LLD
• Topological Sort & detect cycle in graph pseudo code https://www.geeksforgeeks.org/detect-cycle-in-directed-graph-using-topological-sort/

Round 3:

• Max sum of 2 elements in the array where adjacent nodes should not be taken into consideration https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/
• Negative values ( additional question 1 )and circular buffer ( additional question 2 )
• Task scheduler working HLD

Round 4:

• Given a single linked list, swap the first kth and last kth element in one traversal https://www.geeksforgeeks.org/swap-kth-node-from-beginning-with-kth-node-from-end-in-a-linked-list/
• Questions on ownership, decisions, projects

Round 5:

• All about projects, CI/CD pipelines, security for the systems, on-call, challenges, teammates, managers.

Round 6:

All about projects, teammates – conflicts, managers.

Verdict: Selected