Taehwa Enterprises Design Engineer Research Development Interview Questions and Answers

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.

Q1. 
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...read more
Ans. 
Find the length of the longest subsequence common to two arrays consisting only of prime numbers.
• Iterate through both arrays to find prime numbers

• Use dynamic programming to find the longest common subsequence

• Consider edge cases like empty arrays or no common prime numbers
Answered by AI
Add your answer
Q2. 
Maximum Sum Problem Statement
You are given an array ARR of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...read more
Ans. 
Given an array, select elements to maximize sum by removing adjacent elements. Return the maximum sum.
• Iterate through the array and keep track of the frequency of each element.

• Select the element with the highest frequency first, then remove adjacent elements.

• Repeat the process until the array becomes empty and calculate the sum of selected elements.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

Q1. 
Cycle Detection in a Linked List
Your task is to determine if a given Singly Linked List of integers forms a cycle.
Explanation: A cycle in a linked list occurs when there is a node in the list that conn...read more
Ans. 
Detect if a given singly linked list of integers forms a cycle.
• Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list

• Maintain two pointers, one moving at double the speed of the other

• If they meet at some point, there is a cycle in the linked list
Answered by AI
Add your answer
Q2. 
Check If Preorder Traversal Is Valid
Determine whether a given array ARR of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
A binary search tree (BST) is a tree structure w...read more
Ans. 
Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
• Create a stack to keep track of nodes.

• Iterate through the array and compare each element with the top of the stack.

• If the current element is less than the top of the stack, push it onto the stack.

• If the current element is greater than the top of the stack, pop elements from the stack until a greater element is found ...read more
Answered by AI
Add your answer
Q3. What are Vtable and VPTR in C++?
Ans. 
Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.
• Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch for virtual functions.

• VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object.

• Vtable is created by the compiler for each class that has virtual functions.

• VPTR is added as a hidden member in each object of a class with virtual...read more
Answered by AI
Add your answer
Q4. What are friend functions in C++?
Ans. 
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
• Friend functions are declared inside a class with the keyword 'friend'.

• They can access private and protected members of the class.

• They are not member functions of the class, but have the same access rights as member functions.

• Friend functions are useful when you want to allow a function external to
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.

Q1. 
Top View of a Binary Tree
You are given a binary tree. Your task is to print the Top View of the Binary Tree, displaying the nodes from left to right order.
Input:
The first line contains an integer 't'...read more
Ans. 
The task is to print the Top View of a Binary Tree from left to right order.
• Use a map to store the horizontal distance of each node from the root.

• Perform a level order traversal of the tree and keep track of the horizontal distance of each node.

• Print the nodes in the map in ascending order of their horizontal distance.

• Handle the case where multiple nodes have the same horizontal distance by printing the one that appear
Answered by AI
Add your answer
Q2. 
Count Palindromic Substrings Problem Statement
Given a string STR, determine the total number of palindromic substrings within STR.
Input:
The first line contains an integer 't' representing the number ...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to store previously calculated palindromic substrings.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.
Answered by AI
Add your answer
Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
Ans. 
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
• DELETE is a DML command, while TRUNCATE is a DDL command.

• DELETE can be rolled back, while TRUNCATE cannot be rolled back.

• DELETE triggers delete triggers, while TRUNCATE does not trigger any triggers.

• DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.

• Example: DELETE FROM t
Answered by AI
Add your answer
Q4. What is meant by normalization and denormalization?
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally introducing redundancy to improve performance.
• Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.

• Denormalization involves combining tables and duplicating data to impr...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The Technical interview was held on Zoom and the interview lasts for 1 hour. All the questions were from the skills mentioned in the resume.
Firstly interviewer asked me to give a self-introduction, later asked for a brief explanation of the projects and way of working.
Later series of questions were related to academics.
 

Q1. 
Add K Nodes Problem Statement
You are given a singly linked list of integers and an integer 'K'. Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list. The...read more
Ans. 
Modify a singly linked list by inserting a new node after every 'K' nodes with the sum of previous 'K' nodes.
• Traverse the linked list while keeping track of 'K' nodes at a time

• Calculate the sum of the 'K' nodes and insert a new node with the sum after every 'K' nodes

• Handle the case where the number of remaining nodes is less than 'K' by inserting a node with the sum of remaining nodes

• Update the pointers accordingly to
Answered by AI
Add your answer
Q2. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

• Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.

• Return the Nth Fibonacci number as the final result.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

The interview was held on Zoom and the interview lasts for 50 minutes. 
 

1.Explain how did you evolve yourself in B Tech (1-1 semester to 4-1 semester).
 

2. What do you know about Micron Technology?
 

Lastly discussed the certifications and extra circular activities I have done.

Round duration - 45 minutes
Round difficulty - Medium

Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.

Q1. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
• Use bitwise operations to count the set bits in each number from 1 to N.

• Keep track of the total set bits and return the result modulo 1e9+7.

• Optimize the solution to handle large values of N efficiently.

• Consider using dynamic programming or precomputing values for faster computation.
Answered by AI
Add your answer

Round duration - 30 mins
Round difficulty - Easy

This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?