OOPS concepts, Matrix traversal, Recursion, SQL
Filed under Yamaha Motor Solution
The question
Explain OOPS concepts (Generalisation, Specialisation, Containership, Diamond Problem, Friend Function), traverse a 2D matrix with pointers, print 1-N without loops, and find the second-highest salary via SQL.
No write-up yet. Related questions below have one.
Collected from public candidate posts and coding forums. Updated Nov 2026.