Upload Button Icon Add office photos

Filter interviews by

Testsigma Solution Engineer Interview Questions and Answers

Updated 2 Jul 2024

Testsigma Solution Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Trains,ratio,charts,english grammar

Round 2 - Technical 

(2 Questions)

  • Q1. Java oops concepts asked
  • Q2. Manual testing, api testing

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about Testsigma?
Ask anonymously on communities.

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. What is web service flow
  • Ans. 

    Web service flow is the sequence of steps involved in the communication between a client and a server over the internet.

    • Web service flow involves a client sending a request to a server

    • The server processes the request and sends a response back to the client

    • The response can be in various formats such as XML, JSON, or plain text

    • Web service flow can be synchronous or asynchronous

    • Examples of web services include RESTful API...

  • Answered by AI
  • Q2. How to check ports in Solaris or linux machine
  • Ans. 

    To check ports in Solaris or Linux machine, use the netstat command.

    • Open the terminal and type 'netstat -an' to display all open ports.

    • Use 'netstat -an | grep ' to check if a specific port is open.

    • To check listening ports, use 'netstat -an | grep LISTEN'.

    • For Solaris, use 'netstat -an | grep .' instead of '| grep '.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Total pathetic experience. What job description is given to you, doesn't matters because you won't be asked for that. Your resume will get shortlisted and then it doesn't matter what u have covered up in your career path, because interview rounds will consist of questions out of your scope. Your resume doesn't needs to be shortlisted at first end if it doesn't suit thier needs. HR people, they are on another level. You share your resume to them, and they will never ever reply back to you. Not a single HR, but it seems everyone has same culture. You keep trying to connect them for support. But they will just keep finding smarter ways to avoid.

Skills evaluated in this interview

Solution Engineer Interview Questions Asked at Other Companies

asked in CitiusTech
Q1. 1. What is triggers and where we use triggers in xamarin? 2. Oops ... read more
asked in FarEye
Q2. How do you find the details of the second-highest salaried person ... read more
Q3. What's a Camera Sensor? What's use of sensor ? Sizes of Sensor.
asked in Whatfix
Q4. How would you respond if a customer rejects the solution you prop ... read more
Q5. What is a server ? How it's different from PC ?

I appeared for an interview before Jun 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it exists, add the pair to the result. If not, add the element to the hash set.

    • Handle cases where the same element is used twice in a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Clone a Linked List with Random Pointers

    Given a linked list where each node contains two pointers: one pointing to the next node and another random pointer that can point to any node within the list (or ...

  • Ans. 

    Create a deep copy of a linked list with random pointers.

    • Iterate through the original linked list and create a new node for each node in the list.

    • Store the mapping of original nodes to new nodes in a hashmap to handle random pointers.

    • Update the random pointers of new nodes based on the mapping stored in the hashmap.

    • Return the head of the copied linked list.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Unique Element in Array

    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...

  • Ans. 

    Find the element that appears only once in an array where every other element appears thrice.

    • Use bitwise operations like XOR to find the unique element in linear time complexity.

    • XOR all elements in the array, the result will be the unique element.

    • Elements that appear thrice will cancel out each other in XOR operation.

    • Example: arr = [2, 2, 3, 2], XOR of all elements = 3 which is the unique element.

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    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...

  • Ans. 

    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 a greater element is found or stack is empty

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Convert BST to Greater Sum Tree

    Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...

  • Ans. 

    Convert a Binary Search Tree into a Greater Sum Tree by replacing each node's value with the sum of all nodes' values greater than the current node's value.

    • Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.

    • Keep track of the running sum of visited nodes' values and update each node's value with this sum.

    • Recursively apply the above steps to all nodes in the BST.

    • Example: For input ...

  • Answered by AI
  • Q2. 

    Sort Linked List Problem Statement

    You are given a linked list of N nodes where each node contains values 0, 1, and 2 exclusively. Your task is to sort the linked list.

    Input:

    The first line contains an...
  • Ans. 

    Sort a linked list containing values 0, 1, and 2 exclusively.

    • Use three pointers to keep track of nodes with values 0, 1, and 2 separately.

    • Traverse the linked list and move nodes to their respective positions based on their values.

    • Finally, concatenate the three lists in the order 0 -> 1 -> 2 to get the sorted linked list.

  • Answered by AI
Round 4 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or when all cells are water (0s).

  • Answered by AI
  • Q2. 

    Maximum Path Sum in a Matrix

    Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...

  • Ans. 

    Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.

    • Use dynamic programming to keep track of the maximum sum at each cell.

    • Consider moving down, down-left, and down-right to calculate the maximum sum.

    • Start from the second row and update the values based on the maximum sum from the row above.

    • At the end, find the maximum sum in the last row to get the final result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria> 7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, OS, Networks, GraphsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 - Practice variety of questions
Tip 2 - Do atleast 2 projects

Application resume tips for other job seekers

Tip 1 : Do good projects
Tip 2 : resume should be one page

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This round was held during university hours and consisted of 2 coding questions.

Round 2 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Easy

Make sure you do no cutting and are clear about the approach you'd be following. 
 

  • Q1. What is the running median of an input stream?
  • Ans. 

    Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.

    • Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.

    • Keep the number of elements in the two heaps balanced or differ by at most 1.

    • If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Java, Object-Oriented Programming System, System Design, Operating System.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.

Application resume tips for other job seekers

Be sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Miinutes
Round difficulty - Medium

First round had MCQ + 2 coding questions. It was held in morning around 11 am. It was held on campus.

  • Q1. 

    Robot Delivery Path Problem

    You are tasked with directing a robot from the top-left corner of an N*N matrix to a specified point (x, y), delivering a parcel. The robot is restricted to move only on flat a...

  • Ans. 

    Determine if a robot can reach a specified destination in a matrix by moving only downwards or rightwards.

    • Start at (0,0) and move towards the destination (x, y) only downwards or rightwards.

    • Check if the path is clear (1) and avoid obstacles (0) while staying within matrix boundaries.

    • Return true if the robot can reach the destination, false otherwise.

    • Example: For input matrix [[1, 0, 1], [1, 1, 1], [1, 1, 5]] with desti...

  • Answered by AI
  • Q2. 

    Unique Element in Array

    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...

  • Ans. 

    Find the unique element in an array where every element appears thrice except for one.

    • Use XOR operation to find the unique element.

    • Iterate through the array and XOR each element to find the unique element.

    • The XOR operation cancels out elements that appear thrice, leaving only the unique element.

    • Example: arr = [2, 2, 3, 2], XOR of all elements = 3.

    • Example: arr = [0, 1, 0, 1, 0, 1, 99], XOR of all elements = 99.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

Second Round was held in morning around 10-11 am. There was one interviewer working on his laptop. Interviewer was really helpful and first offered me water and then for a bit talked about himself.

  • Q1. 

    BST Iterator Problem Statement

    You are tasked with implementing a class BSTIterator, which is designed to traverse a Binary Search Tree (BST) in the inorder manner. The class must support the following op...

  • Ans. 

    Implement a BSTIterator class to traverse a Binary Search Tree in inorder manner.

    • Implement a constructor to initialize the iterator with the root of the BST.

    • Implement next() and hasNext() methods to traverse the BST in inorder.

    • Implement prev() and hasPrev() methods to access the previous element in the inorder traversal.

    • Use level-order traversal format to represent the tree input.

    • Output the inorder traversal of the bin...

  • Answered by AI
  • Q2. 

    Distance Between Two Nodes in a Binary Tree

    Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...

  • Ans. 

    Calculate the distance between two nodes in a binary tree.

    • Traverse the tree to find the paths from the root to each node

    • Find the lowest common ancestor of the two nodes

    • Calculate the distance by adding the distances from the LCA to each node

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Array,Linked List, Trees, Dynamic Programming, Graphs, Math, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Keep talking about what are you thinking
Tip 2 : Don't beat about the bush if don't know the answer just say so
 

Application resume tips for other job seekers

Tip 1 : Only show projects you are confident about
Tip 2 : Basic Web and android projects are also fine

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Who is the CEO of amazon?
  • Q2. Andy Jassy

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

2 coding questions and 20 mcq
 

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process.

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain.

    • Handle edge cases like no fresh oranges or all oranges already rotten.

    • Consider using a queue to efficiently process adjacent oranges.

    • Ensure to update the grid with the new state of oranges after each second.

  • Answered by AI
  • Q2. 

    Calculate Sum of Proper Divisors

    Given a natural number N, return the sum of all its proper divisors.

    A proper divisor of Y is defined as a number X such that X < Y and Y % X = 0.

    Example:

    Input:
    T...
  • Ans. 

    Calculate the sum of proper divisors of a given natural number.

    • Iterate from 1 to sqrt(N) and check for divisors

    • If a divisor is found, add it to the sum and also add N/divisor if it is not the same as divisor

    • Return the sum as the result

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

Technical interview

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom comparator function to get the largest number.

    • Convert the sorted array elements to strings and concatenate them to form the final number.

    • Handle cases where the numbers have the same prefix by comparing the concatenated forms.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaCriteria not revealed to candidateAmazon interview preparation:Topics to prepare for the interview - Array, Linkedlist, Tree, Graph, Stack, OOPS, Geeksforgeeks archives, coding ninjas interview experience blogsTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Be clear about whatever you have mentioned in resume, don't mention buzz words, because interviewer can go in depth
Tip 2 : Along with DS and Algo, if you have 3-4 months experience or internship experience, then be ready to answer scenario based technical questions like scaling the application that you developed and design concepts that can be used for improving
Tip 3 : Last but most important tip is to be calm through out the whole process ,don't loose hope if any round didn't go well ,if you have explained your thought process there is still chance to procees to next round so keep preparating for next rounds.

Application resume tips for other job seekers

Tip 1 : Keep it one page resume and mention keywords which align with your technical and personal competencies.
Tip 2 : Mention 3-4 projects in the order that , project which you can explain best should be at top,then the next, and so on.

Final outcome of the interviewRejected

Skills evaluated in this interview

Are these interview questions helpful?

I applied via Recruitment Consulltant and was interviewed before Jan 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Python coding test

Interview Preparation Tips

Topics to prepare for Deloitte Software Developer interview:
  • Python
Interview preparation tips for other job seekers - always practice coding
ex: python, java etc

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Evening test around 5
Platform :- SHL
Environment was amazing

  • Q1. 

    Subtree of Another Tree Problem Statement

    Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.

    Explanation:

    ...
  • Ans. 

    Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.

    • Check if the second tree is a subtree of the first tree by comparing their structures and node values.

    • Use a recursive approach to traverse both trees and check for equality.

    • Handle cases where one tree is null or the values do not match.

    • Return true if S is a subtree of T, false otherwise.

  • Answered by AI
  • Q2. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N*N matrix, find the position of a target integer X.

    • Iterate over each row and column to find the target integer X

    • Utilize the sorted nature of the matrix to optimize the search process

    • Return the position of X if found, else return -1 -1

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

1 Hour 
Afternoon

  • Q1. 

    Intersection of Linked List Problem

    You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.

    Your task is to determine t...

  • Ans. 

    Find the node where two linked lists merge, return -1 if no merging occurs.

    • Traverse both lists to find their lengths and the difference in lengths

    • Move the pointer of the longer list by the difference in lengths

    • Traverse both lists simultaneously until they meet at the merging point

  • Answered by AI
  • Q2. 

    Problem: Pair Sum in a Binary Search Tree

    Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...

  • Ans. 

    Find pairs of nodes in a BST that sum up to a given value 'S'.

    • Traverse the BST in-order to get a sorted list of nodes.

    • Use two pointers approach to find pairs with sum 'S'.

    • Keep track of visited nodes to avoid using the same node twice in a pair.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Online Round held on Chime

  • Q1. 

    Is Binary Heap Tree Problem Statement

    You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.

    Input:

    The first line of input contains an integer ‘T’ denoti...
  • Ans. 

    Determine if a given binary tree is a binary heap tree or not based on certain properties.

    • Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.

    • Ensure that every parent node is greater than all its children nodes, forming a max-heap.

    • If any node does not have a left or right child, it should be represented as -1 in ...

  • Answered by AI
  • Q2. 

    Edit Distance Problem Statement

    Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.

    The Edit Distance is defined as the minimum nu...

  • Ans. 

    The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the edit distances between substrings of the two input strings.

    • Fill up the array based on the minimum of three possible operations: insert, delete, or replace.

    • The final answer will be the value at...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, OS, DBMS, Dynamic Programming, Trees/Graph, Tries, Hashing, Algorithms, HadoopTime required to prepare for the interview - 4.5 monthsInterview preparation tips for other job seekers

Tip 1 : 1 Programming Language
Tip 2 : Practice Data Structures with atleast 300 ques.
Tip 3 : CS Fundamental

Application resume tips for other job seekers

Tip 1 : 1 Pager
Tip 2 : Add top 3 projects in Resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 135 minutes
Round difficulty - Easy

Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.

  • Q1. 

    Find K'th Character of Decrypted String

    You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...

  • Ans. 

    Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.

    • Parse the encrypted string to extract substrings and their counts

    • Iterate through the substrings and counts to build the decrypted string

    • Track the position in the decrypted string to find the K'th character

  • Answered by AI
  • Q2. 

    Cycle Detection in Undirected Graph Problem Statement

    You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...

  • Ans. 

    Detect if an undirected graph contains a cycle.

    • Use Depth First Search (DFS) to traverse the graph and detect cycles.

    • Maintain a visited array to keep track of visited vertices.

    • If a visited vertex is encountered again during DFS, a cycle exists.

    • Check for back edges while traversing the graph.

    • Consider disconnected graphs as well.

  • Answered by AI
Round 2 - Assignment 

(3 Questions)

Round duration - 150 minutes
Round difficulty - Medium

  • Q1. 

    Pair Sum Problem Statement

    You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...

  • Ans. 

    Count distinct pairs in an array whose sum equals a given target.

    • Use two pointers approach to iterate through the array and find pairs with sum equal to target.

    • Keep track of visited pairs to avoid counting duplicates.

    • Return -1 if no such pair exists with the given target.

  • Answered by AI
  • Q2. 

    Next Smaller Palindrome Problem Statement

    You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.

    Example:

    Input:
    T...
  • Ans. 

    Given a palindrome number represented as a string, find the largest palindrome number that is strictly less than the given number.

    • Iterate from the middle towards the start and end of the string to find the next smaller palindrome.

    • If the number is odd in length, simply mirror the left half to the right half to get the next smaller palindrome.

    • If the number is even in length, decrement the middle digit and mirror the left...

  • Answered by AI
  • Q3. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The problem involves finding the length of the longest common subsequence between two given strings.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the lengths of common subsequences of substrings.

    • Iterate through the strings to fill the array and find the length of the longest common subsequence.

    • Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'a...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

Interview went well.The interviewer asked me how the previous interviews were.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to output the boundary nodes of this binary tree in Anti-Clockwise order, starting from the root node.

    Explanation:

    The b...

  • Ans. 

    Output the boundary nodes of a binary tree in Anti-Clockwise order, starting from the root node.

    • Traverse the left boundary nodes in top-down order

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in bottom-up order

    • Combine the above traversals to get the boundary nodes in Anti-Clockwise order

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array and swap elements based on the values encountered.

    • Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.

    • Example: If current element is 0, swap it with element at left pointer and increment both pointers.

  • Answered by AI
Round 4 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This round is very easy, In this round they basically need confidence and truthful person.

Interview Preparation Tips

Eligibility criteriaabove 7.5 CGPADeloitte interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, Networking, DevOps, Operating System, Database Management System, Object-Oriented Programming System , basic aptitudeTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. 
Tip 2 : Do lot of hard work and practice of Data Structures and Algorithms based questions
Tip 3 : See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers.
Tip 4 : I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : do mention all your skills which you are confident of in your resume.
Tip 3 : Always make resume company specific

Final outcome of the interviewSelected

Skills evaluated in this interview

Testsigma Interview FAQs

How many rounds are there in Testsigma Solution Engineer interview?
Testsigma interview process usually has 2 rounds. The most common rounds in the Testsigma interview process are Aptitude Test and Technical.
How to prepare for Testsigma Solution Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Testsigma. The most common topics and skills that interviewers at Testsigma expect are Defect Life Cycle, QA Testing, SDLC, Software Testing and Software Testing Life Cycle.
What are the top questions asked in Testsigma Solution Engineer interview?

Some of the top questions asked at the Testsigma Solution Engineer interview -

  1. Manual testing, api test...read more
  2. Java oops concepts as...read more

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 1 interview experience

Interview Questions from Similar Companies

Amazon Interview Questions
4.0
 • 5.3k Interviews
Deloitte Interview Questions
3.8
 • 3k Interviews
Teleperformance Interview Questions
3.9
 • 1.9k Interviews
Oracle Interview Questions
3.7
 • 892 Interviews
KPMG India Interview Questions
3.5
 • 843 Interviews
iEnergizer Interview Questions
4.7
 • 775 Interviews
Zoho Interview Questions
4.3
 • 534 Interviews
Startek Interview Questions
3.1
 • 529 Interviews
View all
Testsigma Solution Engineer Salary
based on 20 salaries
₹2.5 L/yr - ₹5.2 L/yr
65% less than the average Solution Engineer Salary in India
View more details

Testsigma Solution Engineer Reviews and Ratings

based on 2 reviews

1.8/5

Rating in categories

3.8

Skill development

1.0

Work-life balance

3.8

Salary

1.4

Job security

2.6

Company culture

1.4

Promotions

1.8

Work satisfaction

Explore 2 Reviews and Ratings
Solution Engineer
20 salaries
unlock blur

₹2.5 L/yr - ₹5.2 L/yr

Senior Product Designer
7 salaries
unlock blur

₹19.8 L/yr - ₹19.9 L/yr

Product Designer
7 salaries
unlock blur

₹19.9 L/yr - ₹25 L/yr

Technical Support Lead
7 salaries
unlock blur

₹10.6 L/yr - ₹20 L/yr

UI Developer
6 salaries
unlock blur

₹4.7 L/yr - ₹7.5 L/yr

Explore more salaries
Compare Testsigma with

Teleperformance

3.9
Compare

Amazon

4.0
Compare

iEnergizer

4.7
Compare

Deloitte

3.7
Compare
write
Share an Interview