Filter interviews by
I appeared for an interview in Apr 2024.
Coding test is good and perfect
Use array flat method to convert nested array into single array of strings.
Use array.flat() method to flatten the nested array.
Make sure the nested array is an array of strings.
Example: let nestedArray = [['apple', 'banana'], ['orange', 'grape']]; let singleArray = nestedArray.flat();
Swap vowels in a string and output the remaining characters.
Create a function that takes a string as input
Iterate through each character in the string and swap vowels with each other
Return the modified string with swapped vowels
Test cases writing and bug logging
Trains,ratio,charts,english grammar
Testsigma interview questions for popular designations
I applied via Naukri.com and was interviewed in Mar 2023. There were 4 interview rounds.
A) Verbal reasoning questions. ...
b) Verbal comprehension questions. ...
c) English language questions. ...
a) Questions testing abstract reasoning. ...
b) Questions testing spatial ability. ...
C) Questions testing mechanical reasoning. ...
d) Questions testing your ability to identify errors.
I regularly use Java, Python, and JavaScript in my work as a Software Developer.
Java
Python
JavaScript
I applied via Job Portal and was interviewed in Apr 2022. There were 4 interview rounds.
I am an experienced HR professional with a strong background in employee relations and talent management.
Over 10 years of experience in HR roles
Expertise in employee relations, talent acquisition, and performance management
Implemented successful employee engagement initiatives resulting in increased productivity
Strong knowledge of labor laws and regulations
Proven track record in developing and implementing HR policies
TA strategies include sourcing, screening, interviewing, and offering.
Sourcing candidates through job postings, referrals, and social media
Screening resumes and applications to identify qualified candidates
Conducting interviews to assess skills, experience, and cultural fit
Making an offer that is competitive and meets the candidate's expectations
Using data and analytics to optimize the recruitment process
Building a str...
In the previous organization, various engagement activities were conducted to build the organizational culture.
Regular team-building exercises were organized to foster collaboration and improve communication among employees.
Employee recognition programs were implemented to acknowledge and appreciate outstanding performance.
Monthly town hall meetings were held to provide updates on company goals, achievements, and addre...
The main portals used for hiring talent are LinkedIn, Indeed, Glassdoor, and company career pages. Conversion ratios vary based on industry and job level.
LinkedIn is the most popular portal for hiring talent
Indeed and Glassdoor are also commonly used
Company career pages are effective for attracting candidates who are already interested in the company
Conversion ratios depend on industry and job level, with highly compet...
Balancing business objectives with employee initiatives requires aligning goals, communication, and flexibility.
Align business objectives with employee initiatives to create a shared vision
Communicate regularly to ensure everyone is on the same page
Be flexible and open to new ideas and approaches
Encourage employee input and involvement in decision-making
Measure and track progress towards both business and employee goal...
Provided an open position, Find out the best 5-6 candidate for for the role from LinkedIn.
SWOT analysis.
TestSigma is a powerful test automation tool that can bring significant improvements to the testing process.
TestSigma can help reduce testing time and costs by automating repetitive tasks.
It can improve test coverage and accuracy by executing tests consistently.
TestSigma can also provide detailed reports and analytics to help identify areas for improvement.
Changes that can be initiated include implementing TestSigma in...
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Reverse a binary search tree while maintaining parent-child relationship.
Start by swapping the left and right child of each node recursively.
Use a depth-first search approach to traverse the tree.
Make sure to update the parent-child relationships accordingly.
To find min and max element in stack in O(1), we can use an auxiliary stack.
Create an auxiliary stack to keep track of the minimum and maximum elements.
Push the first element to both the main and auxiliary stack.
For each subsequent element, compare it with the top element of the auxiliary stack and push the smaller element to the auxiliary stack.
To get the minimum element, simply return the top element of the auxiliary...
Given an array, find the next minimum element for each element.
Iterate through the array
For each element, compare it with the elements on its right
Find the minimum element greater than the current element
If no such element exists, assign -1
Build the resultant array
Find median of input stream in minimum time complexity using online algorithm.
Use two heaps, one max heap for elements smaller than current median and one min heap for elements greater than current median.
Maintain balance between the two heaps by ensuring that the size difference is at most 1.
If the size of both heaps is equal, median is the average of the top elements of both heaps. Else, median is the top element of ...
To make a copy of a linked list with two pointers, iterate through the original list and create a new node for each element.
Iterate through the original linked list
Create a new node for each element
Set the 'next' pointer of each new node
Set the 'arbitrary' pointer of each new node
Reverse the nodes of a linked list in pairs of n
Iterate through the linked list in pairs of n
Reverse the nodes within each pair
Connect the reversed pairs together
Handle cases where the number of nodes is not a multiple of n
To check if a singly linked list is a palindrome, reverse the second half and compare it with the first half.
Traverse the linked list to find the middle node
Reverse the second half of the linked list
Compare the reversed second half with the first half to check for palindrome
Given a preorder of binary tree with leaf nodes represented by N, construct the tree.
Start by creating an empty stack.
Iterate through the preorder list.
If the current element is N, create a leaf node and push it onto the stack.
If the current element is not N, create a new node and set its left child to the top of the stack.
Pop the top of the stack and set it as the right child of the new node.
Push the new node onto the...
The question asks to find the maximum occupancy word in each line of a given multiline string and also count the occupancy of capital and small letters separately.
Split the multiline string into individual lines
For each line, split it into words
Initialize variables to store the maximum occupancy word and its count
Iterate through each word and count the occupancy of each letter
If the current word has a higher occupancy ...
Some of the top questions asked at the Testsigma interview -
based on 6 interviews
Interview experience
based on 52 reviews
Rating in categories
Solution Engineer
19
salaries
| ₹2.5 L/yr - ₹5.7 L/yr |
UI Developer
6
salaries
| ₹4.7 L/yr - ₹7.5 L/yr |
Technical Writer
5
salaries
| ₹9 L/yr - ₹12 L/yr |
QA Engineer
5
salaries
| ₹4.5 L/yr - ₹5 L/yr |
Software Developer
4
salaries
| ₹6 L/yr - ₹10 L/yr |
Teleperformance
Amazon
iEnergizer
Deloitte