AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Testsigma Software Developer Intern Interview Questions and Answers for Freshers
Testsigma Software Developer Intern Interview Experiences for Freshers
1 interview found
Lalli Dutta
(2 Questions)
- Q1. Convert nested array into single array?
- Ans.
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();
- Q2. Take input string as h,e,l,l,o if vowels are swapped then produce the remaining string as output ex:h,o,l,l,e
- Ans.
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
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Microsoft Corporation
Anonymous
posted on 19 May 2022
I appeared for an interview before May 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Spiral Order Traversal of a Binary Tree Problem Statement
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
Example:
Input:
The binary tree is represented i...
- Ans.
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Word Break Problem Statement
You are given a list of
Nstrings calledA. Your task is to determine whether you can form a given target string by combining one or more strings fromA.The strings from
Ac... - Ans.
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1. Design an elevator system.
- Ans.
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Interview Preparation Tips
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. What is rotational shifts. What is web service flow. How will you check ports on Unix or Solaris machine.
- Ans.
Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.
Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.
Web service flow involves a sequence of steps, such as sending a reques...
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.
- 28 MCQs based on core CS
- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions
- Q1.
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...
- Ans.
Remove duplicates from a sorted linked list without adjacent duplicates.
Traverse the linked list while comparing current and next nodes.
If they are equal, skip the next node by updating the current node's next pointer.
Repeat until the end of the list is reached.
- Q2.
Course Schedule Problem Statement
You are enrolled as a student and must complete
Ncourses, numbered from 1 to N, to earn your degree.Some courses have prerequisites, which means that to take course
i,... - Ans.
Check if it is feasible to complete all courses with prerequisites.
Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.
Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).
If there is no cycle, then it is feasible to complete all courses.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...
- Ans.
Find the Lowest Common Ancestor of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the Lowest Common Ancestor.
Implement a recursive function to efficiently find the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Pretty Good Round. Fast Paced. We covered a lot of ground.
- Q1.
Binary Search Tree Iterator Problem Statement
Design and implement a class
BSTIteratorto perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me... - Ans.
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
Implement a parameterized constructor to initialize the iterator with the root of the BST.
Implement a method 'next()' to return the next smallest element in in-order traversal.
Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.
Ensure the output is the in-order traversal of the
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.
Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.
Return the maximum length ...
- Q3.
BFS in Graph Problem Statement
You are given an undirected and disconnected graph
G(V, E)havingVvertices numbered from0toV-1andEedges. Your task is to print its BFS traversal starting from the 0t... - Ans.
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.
Use a queue to keep track of nodes to visit next.
Keep a visited array to avoid revisiting nodes.
Print the BFS traversal path as the nodes are visited.
Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
- Q4.
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with
Vvertices (labeled 0, 1, ..., V-1) andEedges, each edge connects two nodesXandYwith a specified weight representing the dis... - Ans.
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity, except for the source node which is 0.
Update distances t...
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
Bar Raised Round. Definitely felt the difficulty.
- Q1.
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
- Ans.
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
If no such character is found, return the first character of the string
Interview Preparation Tips
Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews.
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.
Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
- Q1.
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
- Ans.
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
- Q1.
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...
- Ans.
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
- Q1.
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ... - Ans.
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Interview Preparation Tips
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. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. 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. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
- Q1. How can you check if two strings are anagrams of each other?
- Ans.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Interview Preparation Tips
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedSkills evaluated in this interview
Interview Preparation Tips
Experience: Oracle had an online test which includes 3
Sections:
1. Programming: basic C++/java programming + data structure. One need to have good hand over oops
to score well in this section.
2. Aptitude: General Aptitude Questions
3. General Maths: Very simple maths problem (+2 level) but needs very very good speed.
Tips: Individual cutoff was not declared, but different cutoff for different profile is expected.
Oracle has no GD round.
Round: Interview
Experience: In 2nd round of interview, there was more programming, less resume based question and more emphasis on will I be comfortable in an IT sector. Some apti questions were also asked.
Round: Interview
Experience: 1st round was completely on resume based. Each and every project and intern is discussed in detail. Most of the extracurricular activities were also discussed. In the 1st interview, some basic program like fibonacci series by recursion, star pattern by loop etc were asked.
Round: Interview
Experience: Next round was HR. I was asked about the earlier 2 interviews and some basic HR questions.
College Name: IIT Roorkee
NITIN SAMANTA
Interview Preparation Tips
Experience: The sections were Quantitative, Logical, Verbal and Computer Science.The three sections contained very basic questions of general aptitude while the Computer Science section contained questions on Database Management, OS, SQL and Programming Aptitude.
Round: Test
Experience: The question was to program a logic to test the correctness of a solved sudoku. We were allowed to code in C++, Java, C or pseudo code.
Round: Technical Interview
Experience: Were asked simple questions and program them like reversing string without temporary variables, finding the earlier date when entered as string and finding the difference in number of days between them.
I was asked to explain him my internship project in great detail and above all one should be prepared to answer the question 'Why IT?' if from a non IT background. Then I was asked to program a logic for 'Search and replace" tool of MS Word.
Round: HR Interview
Experience: Was asked about my background in detail and stressed again and again on 'Why IT?'. Then he asked me to prepare a summary on the merits and demerits of various Employee Data Management techniques for an organisation. For the end of the interview you should have a question which you would ask to the interviewer.
General Tips: Don't try to over emphasize the correctness of your logic if the interviewer finds a glitch. It irritates him. Be interactive in your HR round. In our case it was the VP of Oracle India who took the final round. So I asked him about his experience in the company. He was very happy to share it with me. But asses your interviewer before you put forth these queries cause your interviewer might not be as jolly as mine was.
Skills:
College Name: NIT Surathkal
Interview Preparation Tips
Tips: If you think it is worth it, write it in the resume.
Round: Technical Interview
Experience: I discussed a political party in one such interview in another company. He was impressed rather inspired.
Tips: All they are looking for in this interview is that you have a basic aptitude
Round: HR Interview
Tips: Try to be as real as possible. They know people and have great deal of experience. You cannot fake it.
General Tips: Peace yoo
College Name: IIT BOMBAY
Testsigma Interview FAQs
Tell us how to improve this page.
Testsigma Interviews By Designations
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Development Engineer Interview Questions
- Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Testsigma Software Developer Intern Interview Process for Freshers
based on 1 interview
Interview experience
Software Developer Intern Interview Questions from Similar Companies
Testsigma Software Developer Intern Reviews and Ratings
based on 2 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 |
|
Senior Product Designer
4
salaries
| ₹19.8 L/yr - ₹22 L/yr |
Teleperformance
Amazon
iEnergizer
Deloitte
- Home >
- Interviews >
- Testsigma Interview Questions >
- Testsigma Software Developer Intern Interview Questions for Fresher
