Filter interviews by
OnCampus Test including DSA Questions
I was interviewed in Feb 2021.
Round duration - 25 minutes
Round difficulty - Medium
The interview was scheduled at 2pm and it began exactly at the same time. The interview was pretty good and the interviewer was very calm and humble. He asked me many questions based on my project and I was able to answer all of them. One incident that I wants to tell you is that the interviewer asked me a question in which I was stucked I tried my best to answer that question but I was not able to answer it then the interviewer asked me to take a deep breath and then try to give the answer and guess what happened, I was able to answer that question.
Tip 1 : Revise your projects if any as the interviewer may ask questions based on your project.
Tip 2 : Practice atleast 300 questions and focus on that kind of questions that were asked by the company in the previous interviews.
Tip 3 : Revise HTML, CSS and js.
Tip 4 : Revise Data Structures and Algorithms.
Tip 5 : Don't take much pressure, be confident and follow the time table.
Tip 1 : Mention your projects and previous experience related to the job description.
Tip 2 : Don't put false things in your resume.
Tip 3 : Mention all your skills and achievement in your resume .
Tip 4 : Add hyperlink to your resume.
Top trending discussions
I applied via campus placement at Dayananda Sagar College of Engineering, Bangalore and was interviewed in Oct 2024. There were 4 interview rounds.
3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well
Ssh round , quant and logical
Tip: bring your calculator
posted on 3 Dec 2024
2 medium leetcode questions were asked
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
45 minutes
arrays, strings,
SHL
To find number of nodes in a tree, perform a depth-first or breadth-first traversal and count the nodes. Time complexity is O(n).
Perform a depth-first or breadth-first traversal of the tree
Count the nodes as you traverse the tree
Time complexity is O(n) where n is the number of nodes in the tree
Abstraction is the concept of hiding complex implementation details and showing only the necessary information.
Abstraction allows developers to focus on the essential features of an object or system.
It helps in reducing complexity and improving efficiency in software development.
Implement abstraction in programming by using abstract classes and interfaces.
Example: In a car, we don't need to know the internal workings o...
The minimum number of coins to reach a target amount can be calculated using dynamic programming.
Use dynamic programming to calculate the minimum number of coins needed to reach the target amount.
Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount.
Iterate through the coin denominations and update the minimum number of coins needed for each amount based
Convert byte stream to human readable format without using library
Iterate through the byte stream and convert each byte to its ASCII character representation
Concatenate the ASCII characters to form the human readable format
Handle special characters and edge cases appropriately
1hr mostly was c questions focusing on pointers, arrays and strings. Few logical questions were there too
2hrs, 5 questions. 1 easy and 4 medium. All leetcode type problems with arrays, strings and matrix
2hrs, simple application development like creating a backend for shopping application. Only simple functions like adding products, quantity, ordering, if quantity is not there then refuse the order and such. Was not asked for DB implementations.
Merge sorted arrays using a min heap to maintain sorted order.
Create a min heap and insert the first element from each array into the heap.
Pop the smallest element from the heap and add it to the result array.
Replace the popped element in the heap with the next element from the same array.
Continue this process until all elements are merged.
Zoho is a software company that provides cloud-based business applications.
Zoho offers a suite of productivity and collaboration tools such as Zoho CRM, Zoho Books, and Zoho Projects.
Zoho's products are designed to help businesses manage their operations more efficiently.
Zoho's software is cloud-based, allowing users to access their data from anywhere with an internet connection.
Dsa mostly from arrays,trees.
I was interviewed in Jan 2021.
Round duration - 150 minutes
Round difficulty - Medium
It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Round duration - 60 minutes
Round difficulty - Easy
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG.
Tip 3 : Should have good knowledge of OOPS.
Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Easy
It was a telephonic round. The interview asked me these questions.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.
Round duration - 60 Minutes
Round difficulty - Medium
This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level.
Steps are as follows:
Round duration - 90 minutes
Round difficulty - Medium
1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.
You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.
A symmetr...
We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:O(1), i.e. constant space complexity.
Time Complexity: O(n)Explanation:O(N), where N is the length of the array/list.
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).
/*
Time Compl...
Tip 1 : Don't lie on your resume.
Tip 2 : Practice at least 400 different types of coding problems.
Tip 3 : Work on your communication skills.
Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.
I was interviewed in Jan 2021.
Round duration - 45 Minutes
Round difficulty - Medium
First, the interviewer asked about college life in the past two years and what all skills I gained. I told all my achievements and all skills that I gained in the period. asked about Language preference
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Round duration - 100 minutes
Round difficulty - Medium
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...
You are provided with an array nums
which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...
Tip 1 : Pratice atleast 300 standard questions
Tip 2 : very good with computer science concepts
Tip 3 : Good projects to discuss
Tip 1 : one page is enough
Tip 2 : good projects of web developement
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Technical Support Engineer
881
salaries
| ₹12 L/yr - ₹25 L/yr |
Technical Consultant
324
salaries
| ₹13.8 L/yr - ₹32 L/yr |
Member Technical Staff
270
salaries
| ₹18.8 L/yr - ₹60 L/yr |
Senior Member of Technical Staff
248
salaries
| ₹30 L/yr - ₹100.4 L/yr |
Senior Technical Consultant
229
salaries
| ₹23 L/yr - ₹45 L/yr |
SAP
Zoho
Oracle
Adobe