Cochin University of Science and Technology (CUST) Placement Interview Questions

Round duration - 45 Minutes
Round difficulty - Easy

The interview started with a brief discussion of one of the projects mentioned in my resume, then the interviewer fast-forwarded to a coding problem. I was coding on a Google Doc which the interviewer was examining at the same time. The solution to the question involved knowledge of stack, and built-around logic definitely. I was able to solve this question but was asked to optimize it further. I couldn’t think about the optimization part before a small hint was given to me by the interviewer itself. I coded the additional optimization logic too as I could grasp the hint quickly.
In the end, the interviewer gave me the chance to ask him a question. And with this, the interview ended leaving me with no positive or negative feedback about my performance.

• Q1. Minimum Character Deletion Problem Statement You have been provided a string STR . Your task is to find and return the minimum number of characters that need t...read more
  View Answers (1)

Round duration - 50 minutes
Round difficulty - Medium

The interviewer straight-forwardly jumped into the question.
PS: There were 2 interviewers in this round.

• Q1. Convert Binary Tree to Mirror Tree Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged. ...read more
  Add Answer

Round duration - 90 mintues
Round difficulty - Medium

Time — 45 minutes
Questions asked — 2

• Q1. Palindrome String Validation Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols. Note: T...read more
  Add Answer
• Q2. Intersection of Linked List Problem You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a th...read more
  Add Answer