AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Phenom Software Engineer Interview Questions and Answers
11 Interview questions
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
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
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 i...
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 bas...
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.
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
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...
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
Explore array-based permutations to alternate numbers effectively.
Understand permutations: Rearranging elements in an array.
Example: For array [1, 2, 3], permutations are [1,2,3], [1,3,2], [2,1,3], etc.
To alternate numbers, consider even and odd indexed positions.
Example: For [1, 2, 3, 4], alternate could be [1, 3, 2, 4].
Use backtracking to generate all permutations and filter for alternates.
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 analysi...
Phenom Software Engineer Interview Experiences
4 interviews found
Anonymous
I applied via Approached by Company and was interviewed in Jun 2024. There were 2 interview rounds.
(3 Questions)
- 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
- Q2. Reverse a String using recursion.
- Q3. What is SingleTon and how to make it Non-Clonable
(3 Questions)
- 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...
- 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...
- 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 ...
- 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...
Interview Preparation Tips
- DSA
- System Design
- Microservices
Prepare Well on System Design , Microservices and how they communicate, DSA.(LeetCode 150 Interview Question is a must.)
Skills evaluated in this interview
(1 Question)
- Q1. Can you provide a self-introduction?
(2 Questions)
- Q1. Java and microservices questions
- Q2. Resume questions
(2 Questions)
- Q1. Compensation discussions
- Q2. Joining date and availability
I applied via AccioJob and was interviewed in Oct 2021. There were 4 interview rounds.
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.
(2 Questions)
- 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...
- 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.
(6 Questions)
- 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...
- 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...
- Q3. A situation-based question like the coordinates of bishops & pawns are given. Determine how many bishops can kill pawns under the given condition.
- Q4. DA questions like Array-based alternate numbers using the concept of permutations.
- Ans.
Explore array-based permutations to alternate numbers effectively.
Understand permutations: Rearranging elements in an array.
Example: For array [1, 2, 3], permutations are [1,2,3], [1,3,2], [2,1,3], etc.
To alternate numbers, consider even and odd indexed positions.
Example: For [1, 2, 3, 4], alternate could be [1, 3, 2, 4].
Use backtracking to generate all permutations and filter for alternates.
- Q5. They can directly give you leetcode questions.
- Q6. Web development-based questions like basics javascript, react, redux, and other projects-related questions.
(6 Questions)
- 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...
- 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.
- 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...
- 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
- 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
- Q6. THUS IN THIS ROUND, THEY INITIALLY TRY TO KNOW YOU AS A PERSON, FOLLOWED BY SOME LOGICAL QUESTIONS OR DSA + DEVELOPMENT BASED QUESTIONS.
Interview Preparation Tips
- Be sure you can choose the right approach & logic while attempting a problem, & you must have the ability to be able to explain your approach to the interviewer. Also, practice the ability to inculcate your approach in your code.
- Confidence & effective communication during the interview is extremely necessary for a good impression.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Varun Thopucherla
Interview Questionnaire
10 Questions
- Q1. Tell about yourself?
- Ans.
I am a software engineer with experience in developing web applications and mobile apps.
Proficient in programming languages such as Java, Python, and JavaScript
Experience in developing RESTful APIs and integrating third-party APIs
Familiarity with front-end frameworks such as React and Angular
Strong understanding of database management systems such as MySQL and MongoDB
Passionate about learning new technologies and keepi...
- Q2. Why Software industry? why not core?
- Ans.
Software industry offers endless opportunities for innovation and growth.
Software industry is constantly evolving and offers opportunities to work on cutting-edge technologies.
It provides a platform to solve complex problems and create innovative solutions.
The demand for software engineers is high and the industry offers competitive salaries.
Core industries may have limited scope for growth and innovation compared to s...
- Q3. Write a program to print the given string in reverse
- Ans.
Program to print a given string in reverse
Create a character array of the given string
Loop through the array from end to start and print each character
- Q4. Some questions about computer networks and Digital electronics
- Q5. What is Mux? what are its real life applications?
- Ans.
Mux is a device that selects one of several input signals and forwards the selected input into a single output line.
Mux stands for Multiplexer.
It is used in digital circuits to select one of several input signals and forward the selected input into a single output line.
It is used in communication systems to combine multiple signals into a single channel for transmission.
It is used in video and audio systems to switch b...
- Q6. What is DeMux? what are its real life applications?
- Ans.
DeMux is short for Demultiplexer. It is a digital circuit that takes one input and directs it to multiple outputs.
DeMux is used in digital communication systems to separate signals that have been combined for transmission.
It is also used in computer memory systems to select a specific memory location.
DeMux is used in video and audio systems to separate different channels of information.
It is used in automation systems ...
- Q7. Difference between decoder and Demux
- Ans.
Decoder converts encoded data into a readable format while Demux separates a single input into multiple outputs.
Decoder is used to decode encoded data such as binary data into a readable format.
Demux is used to separate a single input into multiple outputs based on the control signals.
Decoder is a combinational circuit while Demux is a sequential circuit.
Decoder is used in applications such as remote controls, computer...
- Q8. Why amadeus labs?
- Ans.
Amadeus Labs is a leading technology company in the travel industry.
Amadeus Labs provides opportunities to work on cutting-edge technologies.
The company has a strong focus on innovation and research.
Amadeus Labs has a global presence and offers a diverse and inclusive work environment.
Working at Amadeus Labs provides the opportunity to make a real impact on the travel industry.
The company values work-life balance and o...
- Q9. Are you comfortable in working for Testing?
- Ans.
Yes, I am comfortable working for Testing.
I have experience in testing and understand its importance in software development.
I am willing to learn new testing techniques and tools.
I am comfortable working with testing teams and collaborating with them to ensure quality software.
I understand the importance of testing in ensuring customer satisfaction and reducing costs.
Examples: I have experience in manual and automated...
- Q10. Why do you consider yourself suitable for developer role?
- Ans.
I have the necessary skills and experience to excel in the developer role.
I have a degree in computer science and have completed multiple coding projects.
I am proficient in programming languages such as Java, Python, and C++.
I have experience working with databases and web development frameworks.
I am a quick learner and enjoy solving complex problems.
I am a team player and have collaborated with other developers on var...
Interview Preparation Tips
Experience: The test was conducted online. All the questions were of medium standard and easy to crack if we have patience for thinking.
English comprehension level is slightly below the standard of CAT. Those who have the habit of reading English news paper can easily crack the test.
Data analysis questions were also of medium standard. Those who have knowledge about graphs, bar & pie charts can easily crack the exam.
Tips: Practice Aptitude questions from R S Agarwaal book and CAT material.
Round: Technical Interview
Experience: Over all interview experience is cool. Interviewers never grilled on anything. In many cases they have helped me to arrive at answers.
Tips: Read C++ and Oops concepts from E Balaguruswamy text book.
For Data structures and algorithms read 'Data structures' by Yeshwant kanethkar.
Minimum knowledge about all the courses of your department will be an added advantage. This will help you to depict you are sincere in your studies and don't have any personal constraints in learning a new thing.
General Tips: Just be confident and believe in yourself. You will get through.
Skills: Programming skill in C++
College Name: NIT Warangal
Motivation: No special motivation. It is a rapidly growing company offering good package.
Skills evaluated in this interview
Interview Questionnaire
21 Questions
- Q1. AVL tree balance checking
- Ans.
AVL tree balance checking ensures that the tree maintains its height-balanced property after insertions and deletions.
An AVL tree is a self-balancing binary search tree.
The balance factor (BF) of a node is defined as the height of the left subtree minus the height of the right subtree.
A node is considered balanced if its BF is -1, 0, or +1.
To check balance, recursively calculate the height of left and right subtrees fo...
- Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
- Ans.
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
- Q3. Strings Anagram in O(1) space complexity
- Ans.
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
- Q4. Level order traversal of a tree using Queue
- Ans.
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
- Q5. Reverse level order traversal of a tree using Queue
- Ans.
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
- Q6. BFS and DFS Difference
- Ans.
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS ...
- Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
- Q8. Parenthesis Balance Checking
- Ans.
Check if parentheses in a string are balanced using a stack-based approach.
Use a stack to track opening parentheses: '(', '{', '['.
For each closing parenthesis: check if it matches the top of the stack.
If the stack is empty at the end, parentheses are balanced.
Example: '((){})' is balanced, but '((())' is not.
- Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
- Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
- Ans.
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
- Q11. Recursively deleting linked list
- Ans.
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
- Q12. Recursively deleting linked list from end
- Ans.
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
- Q13. Recursively deleting tree
- Ans.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
- Q14. Recursively deleting from end
- Ans.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
- Q15. Difference between Floyd Warshall and Djikstra
- Ans.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj...
- Q16. Shortest path between 2 points in 2-D space in O(log N) time
- Ans.
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
- Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
- Ans.
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha...
- Q18. SQL commands
- Q19. Career Prospects - Long Term Plans
- Q20. Why not higher studies?
- Ans.
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
- Q21. Machine Learning Concepts - Based on my projects
Interview Preparation Tips
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30
Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.
Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.
Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.
General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before Jun 2020. There were 5 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Basic oop
- Q2. Previous projects and walktrough of one of the project, if any
- Q3. Basic English test on a computer
Interview Preparation Tips
OOP is very basic, they may ask some real life examples.
If you have worked previously, they may ask you about one of your projects. What technologies have you used ans why.
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Questions on java8
- Q2. Questions on multithreading
- Q3. Questions on exception handling
Interview Preparation Tips
I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. What is your day to day work?
- Q2. What new you have to offer the organization?
- Q3. The most recent issues that you faced in the organization?
- Ans.
Recent issues faced in the organization include project delays, communication gaps, and technical debt impacting productivity.
Project Delays: We encountered delays in project timelines due to unforeseen technical challenges, such as integrating legacy systems with new technologies.
Communication Gaps: Miscommunication between teams led to misunderstandings about project requirements, resulting in rework and wasted resou...
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. Oops programming,SQL server Database
Phenom Interview FAQs
Some of the top questions asked at the Phenom Software Engineer interview -
Tell us how to improve this page.
Phenom Interviews By Designations
- Phenom Product Development Engineer Interview Questions
- Phenom Software Engineer Interview Questions
- Phenom Software Developer Interview Questions
- Phenom Software Engineer Trainee Interview Questions
- Phenom PDE Interview Questions
- Phenom Quality Assurance Interview Questions
- Phenom Business Development Executive Interview Questions
- Phenom Product Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Project Engineer Interview Questions
- Lead Engineer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 4 interview experiences
Difficulty level
Duration
Software Engineer Interview Questions from Similar Companies
Phenom Software Engineer Reviews and Ratings
based on 21 reviews
Rating in categories
|
Product Development Engineer
218
salaries
|  ₹9.6 L/yr - ₹14.5 L/yr |
|
Software Engineer
134
salaries
| ₹20.8 L/yr - ₹25 L/yr |
|
Product Development Engineer 2
108
salaries
| ₹14.4 L/yr - ₹32 L/yr |
|
Product Development Engineer 1
91
salaries
| ₹7.8 L/yr - ₹15 L/yr |
|
Product Data Analyst
37
salaries
| ₹2.7 L/yr - ₹6 L/yr |
Thomson Reuters
Oracle Cerner
Chetu
R Systems International
- Home >
- Interviews >
- Phenom Interview Questions
