Keenheads Interview Questions and Answers

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.

Q1. Tell me about yourself
Add your answer

Q1. Which is the best sorting algorithm
Ans. 
There is no one-size-fits-all answer as the best sorting algorithm depends on the specific use case and constraints.
• The best sorting algorithm depends on factors such as the size of the data set, the range of values, whether the data is mostly already sorted or not, and the available memory.

• For small data sets or nearly sorted data, insertion sort or bubble sort may be efficient.

• For large data sets, quicksort, mergesor...read more
Answered by AI
Add your answer

Write a program to print the permutations of abc

Q1. SELF INTRODUCTION
Add your answer
Q2. EDUCATIONAL BACKGROUND
Add your answer

Java theory questions and system questions with 2 DSA question

System design question with api designs

Q1. Coding and testing questions
Add your answer

Q1. Technology related
Add your answer

Q1. Salary discussion
Add your answer