Summary
I interviewed for a Full Stack Developer role at UKG in Noida with 2 years of experience. The hiring process involved an online assessment, a virtual interview focusing on Java basics and projects, and a dedicated Data Structures & Algorithms round.
Full Experience
Round 1 (Online Assessment)
This round was conducted on HackerRank and consisted of 3 questions. The first two were coding problems: one medium-level question on a 2D matrix and a hard-level graph question. The third question was a practical Git task, requiring me to create a repository, add files, perform a rebase, remove a file, and print the log.
Round 2 (Virtual Interview)
My virtual interview began with a standard introduction. Following this, the interviewer delved into basic Java questions, string-based problems, and questions related to OOPS concepts. I was also provided with code snippets and asked to predict their output. A significant portion of this round involved discussions about my past projects.
Round 3 (DSA round)
This round was focused purely on Data Structures and Algorithms. I was given several problems to solve:
- A question on Valid Parentheses.
- A problem to find the Intersection of Linked Lists.
- Finding the Lowest Common Ancestor in a Binary Tree.
- Writing an SQL query to retrieve the 5th largest row.
- Additionally, there was a basic Java question.
Interview Questions (5)
Perform various Git operations: create repository, add files, perform a rebase, remove a file, and print the log.
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if:
- Open brackets must be closed by the same type of brackets.
- Open brackets must be closed in the correct order.
- Every close bracket has a corresponding open bracket of the same type.
Write an SQL query to retrieve the 5th largest row or value from a table. Assume a table with relevant data where the concept of 'largest' is clearly defined (e.g., based on a salary column).