AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Infibeam UI Developer Interview Questions and Answers
Infibeam UI Developer Interview Experiences
1 interview found
Anonymous
I applied via Job Portal and was interviewed in Aug 2022. There were 4 interview rounds.
(1 Question)
- Q1. There was a html and css basic questions with senior developer
One figma file was shared and asked to convert to html infront of senior developer and round took 1hr
(1 Question)
- Q1. Javascript round with corr javascript questions
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
(1 Question)
- Q1. Design book my show
(2 Questions)
- Q1. Machine coding round, develope webpage using html js css Implement concepts like debouncing throttling Coding only in Html css javascript. This was a 2hr round
- Q2. Only one machine coding round question
Data structures and problem solving round
Interview Preparation Tips
Prepare coding problems on leetcode. Most of the questions were from leetcode
Machine Coding round and second was PSDS (DSA)
Interview Preparation Tips
(2 Questions)
- Q1. Optimization techniques for web performance
- Ans.
Optimization techniques for web performance include minification, caching, lazy loading, image optimization, and reducing HTTP requests.
Minify CSS, JavaScript, and HTML files to reduce file sizes and improve load times.
Implement caching strategies like browser caching, server-side caching, and CDN caching to store frequently accessed resources.
Use lazy loading for images and videos to defer loading until they are neede...
- Q2. For machine coding please make sure the code is working
Skills evaluated in this interview
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Naukri.com
Interview Questionnaire
2 Questions
- Q1. Why Amazon?
- Q2. What do you expect from Amazon?
Interview Preparation Tips
Arshiya Saba
I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Basic Q & A
Interview Preparation Tips
I applied via Referral and was interviewed before May 2021. There was 1 interview round.
(2 Questions)
- Q1. How much time u work continues
- Q2. How much salary do u expect
Interview Preparation Tips
SAMKIT JAIN
I was interviewed 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
Infibeam Interview FAQs
Recently Viewed
INTERVIEWS
Wonder Cement
No Interviews
JOBS
Wonder Cement
No Jobs
SALARIES
Kohler
INTERVIEWS
Sagacious IP
No Interviews
SALARIES
Louis Dreyfus Company
SALARIES
Cera Sanitaryware
JOBS
Bean HR Consulting
No Jobs
INTERVIEWS
Intense IP Services
No Interviews
SALARIES
CARS24
SALARIES
Lince Soft Solutions
Tell us how to improve this page.
Infibeam Interviews By Designations
Interview Questions for Popular Designations
- UI UX Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Backend Developer Interview Questions
- Software Developer Intern Interview Questions
- Senior UI Developer Interview Questions
- Junior Software Developer Interview Questions
- Full Stack Software Developer Interview Questions
- Show more
Infibeam UI Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Software Engineer
8
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Program Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Program Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Snapdeal
Shopclues
Paytm Mall
- Home >
- Interviews >
- Infibeam Interview Questions >
- Infibeam UI Developer Interview Questions
