NEARBY TECHNOLOGIES Interview Questions, Process, and Tips for Freshers

Q1. Insulin is administered by which route
Add your answer

Q1. Cold chain management
Ans. 2 to 5 degree Celsius temperature
Answered Anonymously
Add your answer

Q1. Are you comfortable for this job
Add your answer

Q1. Job profile about you last job
Add your answer
Q2. Job profile about you last job work experience
Add your answer
Q3. Job related question
Add your answer
Q4. Job related question about your job profile
Add your answer

So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes

Q1. If you clear Round 1 then you will go forward to Round 2 which is one-to-one technical round. In this round you will be asked leetcode problems and some conceptual questions. I was asked to Find the Max su...read more
Add your answer
Q2. Length of Longest Substring with distinct character
Ans. 
Find the length of the longest substring with distinct characters in a given string.
• Use a sliding window approach to keep track of the current substring.

• Maintain a set to store the distinct characters in the current substring.

• Update the maximum length of the substring whenever a longer substring is found.
Answered by AI
Add your answer
Q3. Find Max sum of subarray.
Ans. 
The maximum sum of a subarray is to be found.
• Use Kadane's algorithm to find the maximum sum of a subarray.

• Initialize two variables: maxSum and currentSum.

• Iterate through the array and update currentSum by adding the current element.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• Return maxSum as the maximum sum of a subarray.
Answered by AI
Add your answer

Q1. Last round was Head of engineering round in this you will be asked some technical questions like: Apply Merge sort on a Linked List
Add your answer
Q2. 25 Horses: Google interview problem
Add your answer

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more amswers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

Q1. Please cal me for interview
Add your answer
Q2. Am waiting for interview
Add your answer
Q3. Cal me for interview
Add your answer
Q4. Waiting for interview cal
Add your answer

A dataset of warehouse and retail sales was shared and they asked to plot bar graph yearly sales, top 5 supplier, top selling products ,analysing trends in sales . most of the problem solved by using groupby function.

Q1. Interview was resume based about project and intern . a lot of question about company itself like which type of challenges companies like porter are facing in these days . top 3 competetor of porter, how c...read more
Add your answer

1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth

Q1. Coding 1 : 1 Round
Add your answer
Q2. 2 Sum, 3 Sum, Maximum Sum Subarray
Add your answer

Q1. Questions based on Resume, OOPS, Databases, OS
Add your answer
Q2. ACID Properties, Keys questions, Semaphore mutex
Add your answer