Filter interviews by
My future career plan is to become a strategic HR leader by continuously learning, gaining experience, and networking.
Continuously learning: I plan to pursue professional certifications, attend workshops and conferences, and stay updated with industry trends.
Gaining experience: I aim to take on challenging HR roles, work on cross-functional projects, and seek opportunities for growth within the organization.
Networking:...
Top trending discussions
I applied via Walk-in and was interviewed in Apr 2022. There were 2 interview rounds.
HR is the management of human resources to achieve business goals.
HR involves recruiting, training, and managing employees.
HR policies and procedures ensure compliance with laws and regulations.
HR also includes compensation and benefits management.
Effective HR planning can help organizations achieve their objectives.
HR analytics can provide insights into workforce trends and performance.
Effective communication skills are crucial for HR managers to ensure smooth operations and employee satisfaction.
HR managers must be able to communicate clearly and effectively with employees, management, and other stakeholders.
They should be skilled in active listening, conflict resolution, and negotiation.
HR managers should also be able to adapt their communication style to different situations and audiences.
For exam...
I applied via Naukri.com
Experienced HR professional with a passion for creating inclusive and supportive work environments.
Over 8 years of HR experience in various industries
Strong background in employee relations and conflict resolution
Skilled in recruitment, training, and performance management
Implemented diversity and inclusion initiatives at previous company
I will work towards aligning HR strategies with company goals, fostering a positive work culture, and ensuring employee satisfaction and retention.
Develop and implement HR strategies to support company goals
Create and maintain a positive work culture
Focus on employee satisfaction and retention
Implement training and development programs to enhance employee skills
Ensure compliance with labor laws and regulations
Yes, I have over 5 years of experience in HR management with a strong skill set in recruitment, employee relations, and performance management.
Over 5 years of experience in HR management
Strong skill set in recruitment
Experience in employee relations
Proficient in performance management
Company is a leading technology firm specializing in software development and IT solutions.
Company was founded in 2005 by a group of software engineers.
They have a strong focus on innovation and cutting-edge technology.
Company has a diverse client base including Fortune 500 companies and startups.
They offer a range of services such as web development, mobile app development, and cloud computing solutions.
I am looking for a competitive salary that reflects my experience and skills in the HR field.
Research industry standards for HR Manager salaries
Consider my level of experience and qualifications
Factor in cost of living in the area where the job is located
Negotiate based on benefits and perks offered by the company
I applied via AmbitionBox and was interviewed in Mar 2022. There were 3 interview rounds.
Skill of leadership and also communication skills identify leadership personality
Human resources based case study
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA were discussed.
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 within the first array.
Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.
Compare elements from both arrays and place the larger element at the end of ARR1.
Continue this process until all elements are merged in sorted order within ARR1.
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
Traverse the tree in level order and store nodes at even levels in a separate list.
Reverse the list of nodes at even levels.
Update the tree with the reversed nodes at even levels.
Repeat the process for alternate levels starting from level 2.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on OS, Java were discussed.
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.
Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.
Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...
Design a file sharing mechanism between two users.
Implement a secure login system for both users.
Allow users to upload files to a shared server.
Provide a way for users to view and download files shared by the other user.
Implement access control to ensure only authorized users can access the shared files.
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.
It achieves thread-safety by dividing the map into segments, each of which can be locked independently.
ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.
Example:...
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
Collect and store user interaction data such as clicks, page views, and time spent on each feature.
Use analytics tools to generate reports and visualize usage patterns.
Identify popular features, user preferences, and areas for improvement based on usage data.
Implement A/B testing to compare different ver...
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.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round with questions based on DSA.
Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.
T
For each test cas...
Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.
Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Handle null nodes represented by -1 in the input.
Follow the order of nodes as they appear in the level order traversal.
Ensure the output is space-separated lists for each traversal type.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and update it accordingly.
Ensure to handle cache capacity by evicting the least recently used item when the cache is full.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA, OS etc.
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, queries, and coordinates as input.
For each query, convert the water at the given coordinates to land and update the grid.
Use depth-first search (DFS) to find connected lands and count the number of islands.
Return the number of islands after each query.
Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.
Prevents multiple threads from accessing critical sections of code simultaneously
Ensures data consistency and prevents race conditions
Improves performance by reducing contention for shared resources
Example: synchronized block in a method that updates a shared variable
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.
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Easy
This test has 2 sections :
Section 1 ( Technical objective questions)
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithms
Section 2 ( 2 Coding questions )
– Code was supposed to be written on paper.
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
Sort the digits in non-increasing order to find the next greater number.
Swap the last two digits to get the smallest greater number.
If no greater number exists, return -1.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string by reversing the order of words while maintaining spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Round duration - 60 minutes
Round difficulty - Easy
First round of interview was based on basic data structures. Concepts related to binary search tree , uses and comparing complexity were asked. He also asked about Hashing , Collisions.
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order
Return the last K elements of the sorted array
Round duration - 60 minutes
Round difficulty - Medium
The interview started with a programming question. Then he asked me a puzzle. There was a small discussion about my projects then .Then he started asking questions about operating system. The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .
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...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Parse the input to create the binary tree using level order traversal
Use a queue to perform level order traversal and print the nodes in the order visited
Handle null nodes represented by -1 appropriately
Producer-Consumer problem involves multiple threads sharing a common buffer. Producers add items to the buffer while consumers remove them.
Producers and consumers need to synchronize their access to the shared buffer to avoid race conditions.
Semaphores can be used to control access to the buffer. Two semaphores are used - one to track the empty slots in the buffer and one to track the filled slots.
Producers increment t...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
For a given array of integers arr
, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i]
is the peak, then both...
Find the peak element in an array of integers.
Iterate through the array and check if the current element is greater than its neighbors.
Handle edge cases for the first and last elements of the array.
Return the peak element found.
Round duration - 60 minutes
Round difficulty - Easy
This round was a telephonic interview with the CTO of the company. The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem. I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mind. He asked me a few HR questions in the end .
Given the initial letter of a student's name and three integer marks for that student, calculate and display the student's initial letter followed by the integer part of th...
Calculate and display the student's initial letter followed by the integer part of their average marks.
Calculate the average of the three marks provided for each student.
Display the initial letter of the student's name followed by the integer part of the average marks.
Round down the average to the nearest integer to get the integer part.
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.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
N = 5
Stre...
Calculate and print the median after each new integer is added to the stream.
Use two heaps - a max heap to store the smaller half of the numbers and a min heap to store the larger half.
Keep the sizes of the two heaps balanced to efficiently calculate the median.
If the total number of elements is odd, the median will be the top element of the max heap.
If the total number of elements is even, the median will be the avera
Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.
A ...
Given a BST and a target value, determine if there exist two unique elements in the BST such that their sum equals the target.
Traverse the BST in-order to get a sorted array of elements.
Use two pointers approach to find the pair sum in the sorted array.
Keep track of visited elements to ensure uniqueness.
Handle edge cases like null nodes and empty tree.
Example: For input BST [20, 10, 35, 5, 15, 30, 42, -1, 13, -1, -1, -
Calculate various statistical measures given a large sample of integers in the range [0, 255]. For efficiency, you are provided with an array 'count' where the i-th ele...
Calculate various statistical measures given a large sample of integers in the range [0, 255] using the provided frequency array.
Iterate through the 'count' array to calculate minimum and maximum values.
Calculate the mean by summing up all values and dividing by the total count.
Find the median by sorting the sample and determining the middle element(s).
Identify the mode by finding the element with the highest frequency...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA. A puzzle was also asked.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when inserting new items.
Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.
You are provided with a rotated sorted array of size N
. Your task is to sort the given array in increasing order.
N = 4
Array = [2, 3,...
Implement a function to sort a rotated sorted array in increasing order without using the sort() function.
Find the pivot element in the rotated sorted array.
Split the array into two subarrays based on the pivot element.
Sort each subarray separately.
Merge the sorted subarrays to get the final sorted array.
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.
Software Engineer
87
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Twilio
Hike
InMobi
Paytm