Filter interviews by
Clear (1)
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.
HTML5 elements that support media content include <audio>, <video>, and <source>.
<audio> element for audio content
<video> element for video content
<source> element for specifying multiple media resources for <video> and <audio> elements
To reduce page loading time, optimize images, minify CSS and JS files, enable browser caching, use a content delivery network (CDN), and reduce server response time.
Optimize images by reducing file size without compromising quality
Minify CSS and JS files to reduce their size and improve loading speed
Enable browser caching to store static resources locally for faster access
Use a content delivery network (CDN) to distrib...
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 Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
My resume
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Puzzles, Psychometric Test
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
2 coding questions which are of easy level
I applied via Walk-in and was interviewed before Jan 2022. There were 3 interview rounds.
Aptitude test duration 90 min 100 question
Coding test 50 code 100 marks 60 min
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Technical Support Engineer
935
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Consultant
327
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
270
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
249
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Consultant
229
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
Zoho
Oracle
Adobe