Phenom Software Developer Interview Questions and Answers

It's hard to solve but try better

It's completely on tree algorithms

Q1. I am not qualified to this round
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Some aptitude questions are there and 2 problem solving questions

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use backtracking to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Recursively generate combinations by adding open parentheses if there are remaining, and close parentheses if the number of open parentheses is greater than the number of close
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Interviewer discussed some dsa questions which was in a 1 st round and gave me some problems to solve

Q1. 
Longest Unique Substring Problem Statement
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
Explanation:
A substri...read more
Ans. 
Find the length of the longest substring with unique characters in a given string.
• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character in the string.

• Update the start index of the window when a repeating character is encountered.

• Calculate the maximum length of the window as you iterate through the string.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

HR asked me some managerial questions.