Round-1: Online Assessment (In College) The assessment included MCQs related to DBMS and Java, along with two coding questions, both of which were standard LeetCode Medium level. One question involved a variation of the Longest Increasing Subsequence (Dynamic Programming), while the other required binary search on a matrix. Questions: LeetCode - 1048. Longest String Chain LeetCode - 74. Search a 2D Matrix Platform: CoderPad Round-2: Technical Interview 1 (L1) in College The interviewer began with an introduction and asked questions based on my resume, covering almost every detail listed. They asked about OOP concepts (the four pillars of OOP, abstract classes, etc.), SQL queries in DBMS (joins), and indexing. I was also given an easy LeetCode question that involved a two-pointer approach. Additionally, we discussed the tech stack used in my projects, and I was asked about the time complexities of sorting algorithms, specifically merge and quick sort. DSA Question: LeetCode - 977. Squares of a Sorted Array Unfortunately, I wasn’t selected for the next round. Kylas tends to prefer candidates with internship experience, so be sure to pursue internships during your engineering years. All the best!