Phenom Software Engineer Interview Questions, Process, and Tips

Q1. How to find Path from Root to any node in Binary Tree
Ans. 
To find the path from the root to any node in a binary tree, perform a depth-first search and keep track of the path taken.
• Perform a depth-first search starting from the root node

• Keep track of the path taken using a stack or array

• When the target node is found, the path will be stored in the stack or array
Answered by AI
Add your answer
Q2. Reverse a String using recursion.
Ans. 
Reverse a string using recursion
• Create a recursive function that takes a string as input

• Base case: if the string is empty, return an empty string

• Recursive case: return the last character of the string concatenated with the result of calling the function on the substring excluding the last character
Answered by AI
Add your answer
Q3. What is SingleTon and how to make it Non-Clonable
Ans. 
Singleton is a design pattern that restricts the instantiation of a class to one object and provides a global point of access to that instance.
• Ensure private constructor to prevent instantiation of multiple objects.

• Provide a static method to access the single instance.

• Use a static variable to hold the single instance.

• Implement a private clone method to prevent cloning of the instance.
Answered by AI
Add your answer

Q1. Design a CRM tool for HR's and Job Seekers. with features like 1.Profile Management 2.Job Application Tracking 3.Job Posting and Searching 4.Scalable and Database Design 5.Handling large data base and lat...read more
Ans. 
A CRM tool for HR's and Job Seekers with features like Profile Management, Job Application Tracking, Job Posting and Searching, Scalable Database Design, and Handling large database and latency.
• Implement user-friendly interface for profile management with options to update personal information, skills, and experience.

• Create a dashboard for job seekers to track their job applications, including status updates and interv...read more
Answered by AI
Add your answer
Q2. How to handle fault tolearnace ? Monitoring and logging using Prometheus, Grafana and ELK (elastic search,Logstash,Kibana). Ensure Redundancy and fail over mechanisms.
Ans. 
Handling fault tolerance involves monitoring and logging with Prometheus, Grafana, and ELK, as well as implementing redundancy and failover mechanisms.
• Implement health checks to monitor the status of services and applications

• Set up alerts and notifications for abnormal behavior or failures

• Use Prometheus for metric collection and Grafana for visualization of data

• Utilize ELK stack for centralized logging and analysis of ...read more
Answered by AI
Add your answer
Q3. DId you use Kubernetes and how do you tell kubernetes to have n number of instances up all the time?
Ans. 
Yes, Kubernetes can be used to manage n number of instances by defining the desired number in the deployment configuration.
• Define the desired number of instances in the 'replicas' field of the deployment configuration.

• For example, setting 'replicas: 3' will ensure that Kubernetes maintains 3 instances of the application running at all times.

• Kubernetes will automatically scale the number of instances up or down based on
Answered by AI
Add your answer

Q1. Can you provide a self-introduction?
Ans. 
I'm a passionate Software Engineer with expertise in full-stack development and a love for solving complex problems.
• Education: Bachelor's degree in Computer Science from XYZ University.

• Experience: 3 years as a Software Engineer at ABC Corp, focusing on web applications.

• Skills: Proficient in JavaScript, Python, and React; developed a project management tool that improved team efficiency by 30%.

• Projects: Contributed to o...read more
Answered by AI
Add your answer

Q1. Java and microservices questions
Add your answer
Q2. Resume questions
Add your answer

Q1. Compensation discussions
Add your answer
Q2. Joining date and availability
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