Preplaced Product Designer Interview Questions and Answers

Round duration - 360 minutes
Round difficulty - Medium

Basically TCS conduct its flagship event named as CODEVITA . And it offers Internship to prefinal (3rd )year students .

Q1. 
Allocate Books Problem Statement
Given an array of integers arr, where arr[i] represents the number of pages in the i-th book, and an integer m representing the number of students, allocate all the books ...read more
Ans. 
Allocate books to students in a way that minimizes the maximum number of pages assigned to a student.
• Iterate through possible allocations and calculate the maximum pages assigned to a student.

• Find the minimum of these maximums to get the optimal allocation.

• Return the minimum pages allocated in each test case, or -1 if not possible.
Answered by AI
Add your answer

Q1. How to I will start our work
Add your answer
Q2. What's my monthly sellery
Add your answer
Q3. Where are you sending me a work
Add your answer

Graphic design is to designes some posters some headlines were creating a best and beautiful designs

Q1. I hope my work you will be like
Add your answer
Q2. How and when I started my work
Add your answer

Q1. What's you send me payment
Add your answer
Q2. What's my work timings
Add your answer

Q1. Asked about fundamentals of javascript and react
Add your answer
Q2. React lifecycle in functional components
Ans. 
React lifecycle in functional components
• useEffect hook replaces lifecycle methods

• useEffect runs after every render by default

• useEffect can be controlled by dependencies array

• useEffect cleanup function can be used to clean up effects

• useLayoutEffect hook runs synchronously after DOM mutations
Answered by AI
Add your answer

Return numbers in array equal to sum

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Check if the sum of the triplet equals the specified number.

• Print the valid triplets or return -1 if no such triplet exists.
Answered by AI
Add your answer
Q2. 
Find Magic Index in Sorted Array
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...read more
Ans. 
Find the magic index in a sorted array where A[i] = i.
• Iterate through the array and check if A[i] = i for each index i.

• Since the array is sorted, you can optimize the search using binary search.

• Return the index if found, else return -1.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Hard

Q1. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
Ans. 
Given a sorted alien dictionary in an array of strings, determine the character order of the alien language.
• Iterate through the words in the dictionary to build a graph of character dependencies.

• Perform a topological sort on the graph to determine the character order.

• Return the character array representing the order of characters in the alien language.
Answered by AI
Add your answer
Q2. 
Jumping Numbers Problem Statement
Given a positive integer N, your goal is to find all the Jumping Numbers that are smaller than or equal to N.
A Jumping Number is one where every adjacent digit has an a...read more
Ans. 
Find all Jumping Numbers smaller than or equal to a given positive integer N.
• Iterate through numbers from 0 to N and check if each number is a Jumping Number.

• For each number, check if the absolute difference between adjacent digits is 1.

• Include all single-digit numbers as Jumping Numbers.

• Output the list of Jumping Numbers that are smaller than or equal to N.
Answered by AI
Add your answer
Q3. 
Matching Prefix Problem Statement
Given an integer N representing the number of strings in an array Arr composed of lowercase English alphabets, determine a string S of length N such that it can be used t...read more
Ans. 
Given an array of strings, find the lexicographically smallest string that can be used as a prefix to minimize the total cost of deleting prefixes from the strings.
• Iterate through the array to find the common prefix among all strings

• Choose the lexicographically smallest common prefix

• Delete the common prefix from each string in the array to minimize the total cost
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy