i
BeeHyv
Filter interviews by
I applied via campus placement at Indian Institute of Information Technology Design & Manufacturing (IIITDM), Kancheepuram and was interviewed in Dec 2023. There were 3 interview rounds.
Mensuration , P and C
The longest palindrome in a given string is the longest sequence of characters that reads the same forwards and backwards.
Iterate through each character in the string
For each character, expand outwards to find the longest palindrome centered at that character
Keep track of the longest palindrome found so far
Return the longest palindrome
Print a pattern as shown below.
Use nested loops to iterate through rows and columns.
Use conditional statements to determine the pattern to be printed.
Store each row as a string in an array of strings.
This is advance aptitude test where we are tested on some more difficut atpi questions
I applied via campus placement at Indian Institute of Information Technology (IIIT), Sri City and was interviewed in Nov 2022. There were 6 interview rounds.
Integer type answers must be written for the online test
The test can taken in any of the teo languages java and python. I took python test. It had python mcqs and few sql mcqs
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There were 3 interview rounds.
What people are saying about BeeHyv
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There were 4 interview rounds.
The probability of extinction of an amoeba with equal chances of death, idling, splitting into 2, and splitting into 3.
Calculate the probability of each event happening in a minute
Calculate the probability of the amoeba surviving in a minute
Calculate the probability of the amoeba surviving after n minutes
Use probability theory to determine the overall probability of extinction
BeeHyv interview questions for designations
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
2 Questions were asked on string and array
Find the longest subsequence in a string
Iterate through the string and keep track of the longest subsequence found so far
Use a hashmap to store the last index of each character seen
Update the longest subsequence length when a character is repeated
posted on 22 Jan 2025
1 hour online test ..
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
Start iterating from the given number in both directions to find the nearest prime number.
Check if a number is prime by dividing it by all numbers less than its square root.
Keep track of the closest prime number found during the iteration.
Find the second maximum number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 6 Jan 2025
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
posted on 1 Aug 2024
I applied via campus placement at Jagan Institute of Management Studies (JIMS) and was interviewed in Jul 2024. There was 1 interview round.
Interview experience
based on 2 reviews
Rating in categories
Software Developer
84
salaries
| ₹6 L/yr - ₹17.5 L/yr |
Software Engineer
14
salaries
| ₹5.8 L/yr - ₹14 L/yr |
Developer
13
salaries
| ₹6 L/yr - ₹11 L/yr |
Software Developer Trainee
8
salaries
| ₹6.3 L/yr - ₹8 L/yr |
Full Stack Developer
8
salaries
| ₹7.1 L/yr - ₹16 L/yr |
Persistent Systems
TCS
Infosys
Wipro