Filter interviews by
Clear (1)
I applied via Company Website and was interviewed before Jan 2023. There was 1 interview round.
This watch is a stylish and functional accessory that combines elegance with advanced features.
The watch features a sleek design that complements any outfit.
It is made with high-quality materials for durability and longevity.
The watch has a variety of useful features such as a chronograph, date display, and water resistance.
Its precise movement ensures accurate timekeeping.
The watch comes with a warranty and excellent ...
Top trending discussions
I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.
I applied via Job Portal and was interviewed before Jun 2021. There was 1 interview round.
Payroll cycle is the frequency at which employees are paid while salary cycle is the duration for which they are paid.
Payroll cycle can be weekly, bi-weekly, semi-monthly or monthly depending on the company's policy.
Salary cycle can be monthly, quarterly, bi-annually or annually depending on the company's policy.
Payroll cycle determines the frequency of paychecks while salary cycle determines the duration of paychecks.
...
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
posted on 10 Jun 2023
I applied via Naukri.com and was interviewed before Jun 2022. There were 2 interview rounds.
My salary expectations are negotiable and based on the responsibilities and opportunities offered by the position.
Highlighting flexibility in salary expectations
Emphasizing that expectations are based on job responsibilities and opportunities
Expressing openness to negotiation
I applied via Campus Placement and was interviewed before Feb 2021. There were 2 interview rounds.
I applied via Referral and was interviewed in Aug 2021. There were 2 interview rounds.
I applied via Other and was interviewed in Mar 2021. There were 3 interview rounds.
I was interviewed before Dec 2020.
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
The fi...
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
Given an arbitrary array arr
consisting of N
non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
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...
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
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 4 reviews
Rating in categories
Business Analyst
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Myntra
LimeRoad
Voonik
Craftsvilla.com