Phenom Interview Questions, Process, and Tips

Q1. 1. Product Prioritization 2. Fav product and why, what would you improve in that 3. Situational questions like what if one of the KPIs go down(usage for ex), how will you resolve it 4. When have you used d...read more
Ans. 
Interview questions for Senior Product Analyst
• For product prioritization, I use a combination of customer feedback, market trends, and business goals

• My favorite product is XYZ because of its user-friendly interface and seamless integration with other tools. I would improve its reporting capabilities

• If a KPI goes down, I would investigate the root cause and work with the team to come up with a plan to address it. For ex...read more
Answered by AI
Add your answer

Q1. 1. Introduction 2. Similar to round 1 3. Various situational based problem statements
Add your answer

Q1. End to end Product Management questions
Add your answer

Q1. Cultural interview with the director
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.

Data structures were asked in the interview

Q1. Explain about closures, currying, es features
Add your answer

The test is designed to test your logical reasoning skills. The test duration will be 30 minutes, where you will have to attempt 25 questions of difficulty levels varying from medium to hard.

Q1. This is a technical round with the questions mainly from DSA and your projects. For DSA questions, you won't use an IDE. You need to tell the approach to solve the questions and effectively apply the appro...read more
Add your answer
Q2. Medium-level questions from the projects you mentioned in the resume will also be asked. DSA based questions (easy to medium level) = ARRAY or LINKED LIST based questions.
Add your answer

Q1. This round will again be a technical round, & you will be asked questions from both DSA & development projects you mentioned in your resume. Types of questions you may be asked in this round: MEDIUM to HAR...read more
Add your answer
Q2. Explain the approach to any questions from round 1 & how it could be improved.
Ans. 
Explaining approach to round 1 questions and suggestions for improvement.
• I reviewed the questions and identified areas where I struggled or needed clarification.

• I researched and practiced those topics to improve my understanding.

• I also sought feedback from others who had experience with similar questions.

• To improve, I suggest providing more context or examples in the questions.

• It would also be helpful to provide feedba
Answered by AI
Add your answer
Q3. A situation-based question like the coordinates of bishops & pawns are given. Determine how many bishops can kill pawns under the given condition.
Add your answer
Q4. DA questions like Array-based alternate numbers using the concept of permutations.
Add your answer
Q5. They can directly give you leetcode questions.
Add your answer
Q6. Web development-based questions like basics javascript, react, redux, and other projects-related questions.
Add your answer

Q1. This is the round where they first try to get to know you as a person by asking you to introduce yourself, followed by simple HR questions. This is usually followed by Logical Puzzle based questions to che...read more
Add your answer
Q2. For Example: N Cards are placed, if you flip a card, the next card will get reversed. If we move left to right, how much time will it take to get all cards reversed- question based on time complexity?
Ans. 
To reverse N cards, time complexity is O(N).
• The time complexity to reverse N cards is O(N).

• The algorithm needs to flip each card once, so the time complexity is linear.

• The time it takes to reverse all cards is directly proportional to the number of cards.

• For example, if there are 10 cards, it will take 10 flips to reverse all of them.
Answered by AI
Add your answer
Q3. Count the number of subarrays in a given array whose sum is divisible by k.
Ans. 
Count subarrays in an array whose sum is divisible by k.
• Create a prefix sum array to keep track of the sum of elements up to a certain index.

• Use a hash table to store the frequency of remainders when the prefix sum is divided by k.

• For each prefix sum, check if there exists a previous prefix sum with the same remainder.

• If yes, add the frequency of that remainder to the count of subarrays.

• Update the frequency of the curr...read more
Answered by AI
Add your answer
Q4. Print all valid IP Addresses from a given input of strings.
Ans. 
Print all valid IP Addresses from a given input of strings.
• Split the input string into 4 parts and check if each part is a valid IP address component

• Use regular expressions to validate each component

• Use nested loops to generate all possible combinations of valid IP addresses
Answered by AI
Add your answer
Q5. Email Validation using Javascript
Ans. 
Email validation can be done using regular expressions in JavaScript.
• Use regex to check if email is in correct format

• Check for presence of '@' and '.' in email

• Ensure that there are no spaces in email

• Validate email on both client and server side
Answered by AI
Add your answer
Q6. THUS IN THIS ROUND, THEY INITIALLY TRY TO KNOW YOU AS A PERSON, FOLLOWED BY SOME LOGICAL QUESTIONS OR DSA + DEVELOPMENT BASED QUESTIONS.
Add your answer

Q1. Previous work experience
Add your answer
Q2. Application support experience
Ans. 
I have extensive experience in application support, including troubleshooting, maintenance, and upgrades.
• I have worked with a variety of applications, including both custom-built and off-the-shelf software.

• I am skilled in identifying and resolving issues, whether they are related to software bugs, user errors, or hardware problems.

• I have experience with monitoring and maintaining application performance, including iden...read more
Answered by AI
Add your answer
Q3. Communication skills
Add your answer

Q1. Testing on analytical skills, problem solving skills
Add your answer
Q2. Communication skills
Add your answer

Three sum question, reversal of linkedlist