AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
UnifyApps Interview Questions and Answers
UnifyApps Interview Experiences
3 interviews found
Ayush Kumar Yadav
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
55 Questions, 1 Hour, 52 MCQs on Core Computer Fundamentals and 3 Coding Questions
(2 Questions)
- Q1. Variation of Number of Components in a Graph
- Ans.
The number of components in a graph can vary based on the connections between nodes.
The number of components in a graph can be determined by counting the number of disconnected subgraphs.
For example, a graph with 3 disconnected subgraphs would have 3 components.
Adding or removing edges between nodes can change the number of components in a graph.
- Q2. Minimum number of operations to convert string s1 to s2
- Ans.
Minimum number of operations to convert string s1 to s2 is the Levenshtein distance between the two strings.
Use dynamic programming to calculate the Levenshtein distance between the two strings.
The operations allowed are insertion, deletion, and substitution of a single character.
Example: s1 = 'kitten', s2 = 'sitting'. The minimum number of operations is 3 (substitute 'k' with 's', insert 'g', substitute 'e' with 'i').
(3 Questions)
- Q1. Given a vector of Strings, can it form a circle by joining the ends with same characters
- Ans.
Yes, a circle can be formed if all strings have the same starting and ending characters.
Check if all strings have the same starting and ending characters
Join the strings in a circular manner to form a circle
Example: ['abc', 'cde', 'efg'] can form a circle as 'abc' -> 'cde' -> 'efg' -> 'abc'
- Q2. It was sort of a Resume Discussion
- Q3. Approach on Google Maps Optimisation
- Ans.
Optimizing Google Maps involves improving location accuracy, user experience, and search rankings.
Ensure accurate business information (name, address, phone number) on Google My Business
Utilize relevant keywords in business descriptions and categories
Encourage positive reviews and respond to feedback promptly
Use high-quality images and videos to enhance listing
Implement local SEO strategies to improve search rankings
Interview Preparation Tips
- DSA
- Resume
Skills evaluated in this interview
Product Engineer Interview Questions asked at other Companies
Hemanth Sai
Selected
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. Basic questions on object oriented programming
- Q2. Java basics like core java and some coding questions
Interview Preparation Tips
- Core Java
- Coding
Software Development Engineer Interview Questions asked at other Companies
Anonymous
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Thea give a mediam difficulty dsa question
Interview Preparation Tips
- DSA
- Backend
Software Developer Interview Questions asked at other Companies
Interview questions from similar companies
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Java questions
Interview Preparation Tips
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
(1 Question)
- Q1. Print 1 to 100 without for loop
- Ans.
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
Interview Preparation Tips
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
(1 Question)
- Q1. General questions as per your cv
Interview Preparation Tips
- Aptitude
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. DS Algo Questions on Trees. Leadership Principles
Interview Preparation Tips
I applied via Naukri.com
Interview Questionnaire
2 Questions
- Q1. Why Amazon?
- Q2. What do you expect from Amazon?
Interview Preparation Tips
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions of java.
(1 Question)
- Q1. Intro and other hr related questions.
Interview Preparation Tips
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
UnifyApps Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
UnifyApps Interview Process
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Associate Product Manager
4
salaries
|  ₹17 L/yr - ₹21 L/yr |
|
Demi Chef DE Partie
3
salaries
| ₹12 L/yr - ₹12 L/yr |
TCS
Accenture
Wipro
Cognizant
- Home >
- Interviews >
- UnifyApps Interview Questions
