i
Bhavna Corp.
Filter interviews by
I applied via Campus Placement and was interviewed before Dec 2023. There were 3 interview rounds.
Consists of 30 MCL total. 5 C++, 10 Mathematical, 10 Graph and data analysis, 5 English
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort involves building a heap from the input array and then repeatedly removing the largest (for max heap) or smallest (for min heap) element from the heap and adding it to the sorted array.
The structure of heap sort involves two main steps: heapify the input array to create a heap and then repeatedly extract the root element ...
Use a stack to reverse print a linked list
Create a stack to store the elements of the linked list
Traverse the linked list and push each element onto the stack
Pop elements from the stack and print them to get the reverse order
Top trending discussions
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Dp, trees and basic time complexity
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience working in Agile development environment
I applied via Referral and was interviewed before Feb 2022. There were 4 interview rounds.
Easy level questions on string, linked list and array
TCP is a connection-oriented protocol while UDP is connectionless.
TCP provides reliable, ordered, and error-checked delivery of data while UDP does not guarantee any of these.
TCP is slower but more reliable while UDP is faster but less reliable.
TCP is used for applications that require high reliability and accuracy such as email, file transfer, and web browsing while UDP is used for applications that require speed and ...
A nibble swap program in C
Nibble swap means swapping the 4-bit halves of a byte
Use bitwise operators to perform the swap
Example: unsigned char x = 0xAB; x = ((x & 0x0F) << 4) | ((x & 0xF0) >> 4);
Reverse a linked list in C language.
Create three pointers: current, previous, and next.
Traverse the linked list and change the direction of the pointers.
Return the new head of the reversed linked list.
API call in C
Include the necessary header files
Create a URL string with the required parameters
Use the curl library to make the API call
Handle the response data appropriately
posted on 14 Sep 2023
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
Duration:30 min
Question from percentage,ratios ,HCF/LCM etc.,
Logical reasoning, English
Reverse a string by grouping 'm' characters together
Iterate through the string in groups of 'm' characters
Reverse each group of 'm' characters
Concatenate the reversed groups to get the final reversed string
I applied via Internshala and was interviewed in Oct 2023. There was 1 interview round.
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures can be linear (arrays, linked lists) or non-linear (trees, graphs)
Common operations on data structures include insertion, deletion, and searching
Examples of data structures include stacks, queues, hash tables, and binary trees
I applied via Recruitment Consulltant and was interviewed before May 2022. There were 4 interview rounds.
Programming on basics of C
Programming on basics of C
It represents the eligibility of person and thinking process ,view of thoughts
Skills ,fast typing , experienced ,new ideas
Deeply study case and make a point to make attractive
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
General topics like mathe, English, social etc
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 70 Minutes
Round difficulty - Hard
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.
Consider both left-to-right and right-to-left passes to ensure fair distribution.
Keep track of the total candies dist
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Use Divide and Conquer approach to recursively divide the input array into two halves.
Merge the sorted halves to produce a completely sorted array.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Do not put false things on resume.
Tip 2 : Have some projects on resume.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Senior Software Engineer
148
salaries
| ₹9.2 L/yr - ₹32 L/yr |
Software Engineer
147
salaries
| ₹4.2 L/yr - ₹15 L/yr |
Senior QA Engineer
41
salaries
| ₹6.7 L/yr - ₹17.4 L/yr |
QA Engineer
38
salaries
| ₹4.5 L/yr - ₹11.4 L/yr |
Senior Test Engineer
38
salaries
| ₹6 L/yr - ₹20.2 L/yr |
Saama Technologies
JoulestoWatts Business Solutions
DISYS
Value Point Systems