Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Oct 2021. There was 1 interview round.
Top trending discussions
I applied via Monster and was interviewed before Mar 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Feb 2021. There were 2 interview rounds.
I applied via Approached by Company and was interviewed in Oct 2023. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed in Oct 2023. There were 3 interview rounds.
I am a highly motivated and experienced professional with a strong background in management.
I have over 5 years of experience in leadership roles, including managing teams and overseeing operations.
I have a proven track record of achieving targets and driving results.
I am skilled in problem-solving, decision-making, and conflict resolution.
I have excellent communication and interpersonal skills, which enable me to effe...
Can't it very much important Document can't share sorry
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Jan 2023. There were 2 interview rounds.
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.
Ninja is tasked with merging two given sorted integer arrays ARR1
and ARR2
of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...
Merge two sorted arrays into one sorted array in place.
Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.
Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.
Continue this process until all elements from ARR2 are merged into ARR1.
Given a document represented as an array/list ARR
of words with length N
, find the smallest distance between two given words for multiple queries. The distance is defined as the ...
Find the smallest distance between two words in a document for multiple queries.
Iterate through the document array to find the indices of the two words in each query.
Calculate the absolute difference between the indices to get the distance.
If a word from the query is not present in the document, return the length of the document array.
Repeat the process for each query and output the smallest distance for each.
Round duration - 60 minutes
Round difficulty - Easy
Then in the second round they asked a little about tree and told me to code 2 codes.
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
The problem requires implementing a function to return the level order traversal of a binary tree.
Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.
Use a queue data structure to perform level order traversal.
Process each level of the tree one by one, starting from the root node.
Print the node values at each level in the order they appear from left to ...
Given an array of distinct positive integers ARR
and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
Use backtracking to generate all possible combinations.
Sort the array to ensure elements are in non-decreasing order.
Track the current combination and sum while backtracking.
Terminate recursion when the sum equals the target sum.
Avoid duplicates by skipping elements that have been used in previou
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
HR Recruiter
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Retail Associate
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Inspection Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
23
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Executive
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Foundit
Timesjobs.com
Indeed
Quikr