CTD Techs Senior Recruiter Interview Questions and Answers

Based on JavaScript and Java.

A task based on JavaScript.

Q1. Tell me about yourself
Add your answer

Q1. Basic JS questions
Add your answer
Q2. String Concat through function
Add your answer

Advanced JS, PHP related questions

Q1. 3 Question was there related to architecture and Computer networks.
Add your answer

Q1. Microservices and Monolith.
Add your answer
Q2. Leetcode hard Sum.
Add your answer

Work-time model and relationship model.

Based on JavaScript and React.

Q1. What are the reasons we should consider hiring you?
Add your answer
Q2. What contributions do you envision making to our project management efforts?
Add your answer

1st test was aptitude and a easy coding test

The 2nd test was pure coding based test on hacker rank platform and contains 2 easy and 2 medium question

Q1. Round 3 was technical interview and asked from basics of computer programming and architecture
Add your answer

Q1. What is your family background?
Add your answer
Q2. Why are you looking for a change?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions on DSA and DBMS mainly.

Q1. 
Maximum Sum Subarray Problem Statement
Given an array ARR consisting of N integers, determine the sum of the subarray with the maximum sum, including the possibility of an empty subarray.
A subarray is a...read more
Ans. 
Find the sum of the subarray with the maximum sum in a given array.
• Iterate through the array and keep track of the current sum and maximum sum.

• Update the maximum sum if the current sum becomes greater.

• Handle cases where the array has all negative numbers or empty subarray.

• Example: For input [-2, 1, -3, 4, -1], the maximum sum subarray is [4] with sum 4.
Answered by AI
Add your answer
Q2. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. 
Identify all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime

• Use the Sieve of Eratosthenes algorithm for efficient prime number identification

• Optimize by only checking numbers up to square root of N for divisibility
Answered by AI
Add your answer
Q3. What are Joins in the context of databases?
Ans. 
Joins in databases are used to combine rows from two or more tables based on a related column between them.
• Joins are used to retrieve data from multiple tables based on a related column.

• Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

• INNER JOIN returns rows when there is at least one match in both tables.

• LEFT JOIN returns all rows from the left table and the matched rows from the right ta...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.