Tredence Senior Software Engineer Interview Questions, Process, and Tips

Q1. Prepare basics and and under why and what of any concept
Add your answer
Q2. Be sure on what you answer, if not sure be sure on the answer you provide
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Reverse String Operations Problem Statement
You are provided with a string S and an array of integers A of size M. Your task is to perform M operations on the string as specified by the indices in array A...read more
Ans. 
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
• Iterate through the array of indices and reverse the substrings accordingly

• Ensure the range specified by each index is non-empty

• Return the final string after all operations are completed
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. How do you come out of an iframe in Selenium?
Ans. 
To switch out of an iframe in Selenium, you can use the switchTo().defaultContent() method.
• Use driver.switchTo().defaultContent() to switch out of the iframe.

• If the iframe is nested within multiple iframes, use driver.switchTo().parentFrame() to navigate up the iframe hierarchy.

• You can also switch to a specific iframe by using driver.switchTo().frame() with the iframe element or index.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. Why do you want to leave your current company?
Add your answer

Q1. Scenario based python and SQL questions
Add your answer

Q1. General discussion with manager
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

It was conducted in the evening on Teams call. It was a mix of DSA question, conceptual discussion on javascript and node.js.

Q1. 
All Paths From Source Lead To Destination Problem Statement
In a directed graph with 'N' nodes numbered from 0 to N-1, determine whether every possible path starting from a given source node (SRC) eventua...read more
Ans. 
Determine if all paths from a given source node lead to a specified destination node in a directed graph.
• Check if there is at least one path from source to destination.

• Ensure that nodes with no outgoing edges from source are the destination.

• Verify that the number of paths from source to destination is finite.

• Return True if all paths from source lead to destination, otherwise False.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Round duration - 60 Minutes
Round difficulty - Medium

It was a hiring manager round which happened in the evening. The interviewer introduced me to the product I was being hired for, asked me a few questions on my experience (both technical and business). I talked on the architecture and design of Single page applications and my then current project. I was also allowed to ask questions and they were addressed.

Q1. Can you explain the architecture of your current project?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was in the evening. The interviewer was professional. I was asked about my past experiences, why I was switching and some behavioral questions.