Based on SQL and Stored Procedures

Screening round (1st round) Coding questions (Minimise tax, Maximize profit) Interview Round 1: DSA question: Skip-One Spiral Matrix Traversal, Problem Statement: Given a 2D matrix of integers, implement a function to traverse the matrix in a spiral order while skipping one element. Input: matrix = [ [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12] ] Output: [2, 4, 12, 10, 5, 7, 6, 9, 11, 8, 3, 1] 2 SQL queries: Given 2 tables (Teacher details, department table) Find the Experience of a teacher Find a teacher who has max experience from each dept Interview round 2: Generate power set Code for the puzzle Few managerial questions

Longest Common subsequence Matrix Manipulation euclidean distance