BIZONGO UX Designer Interview Questions and Answers

Q1. Tell what is your name
Ans. 
My name is John Smith.
• Full name is John Smith

• Common name in English-speaking countries

• No middle name or initial
Answered by AI
Add your answer
Q2. What do you do in free time
Ans. 
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
• Hiking in local trails and national parks

• Playing video games like Overwatch and Minecraft

• Learning new programming languages like Python and JavaScript
Answered by AI
Add your answer

Q1. Given a string, find the longest length palindromic substring in the given string.
Ans. 
Find the longest palindromic substring in a given string.
• Use dynamic programming to solve the problem efficiently.

• Start with the base cases of single characters and two characters.

• For longer substrings, check if the first and last characters match and if the substring between them is also a palindrome.

• Keep track of the longest palindrome seen so far.

• Time complexity: O(n^2), space complexity: O(n^2).
Answered by AI
Add your answer

Q1. Mention the most challenging technical problem you had to solve.
Ans. 
Developing a real-time data processing system for a high-traffic website.
• Designing a scalable architecture to handle the high volume of incoming data.

• Optimizing the data processing algorithms to minimize latency.

• Ensuring data consistency and accuracy in a distributed system.

• Implementing fault-tolerant mechanisms to handle system failures.

• Testing and debugging the system under various load conditions.
Answered by AI
Add your answer
Q2. Some minor low level entity design.
Add your answer

Implement your own state management in React and integrate it into a React application.

Q1. DSA Questions - Easy to medium
Add your answer

Q1. Whats difference between patch and put
Ans. 
Patch is used to update a specific part of a resource, while put is used to replace the entire resource.
• Patch is used for partial updates, while put is used for full updates.

• Patch is idempotent, meaning multiple identical patch requests will have the same effect as a single request, while put is not necessarily idempotent.

• Example: Using patch to update the title of a blog post without affecting other fields, while usin...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge

Q1. 
Rotting Oranges Problem Statement
You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...read more
Ans. 
Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.
• Implement BFS traversal algorithm starting from vertex 0

• Use a queue to keep track of visited nodes and their neighbors

• Print the traversal order in sorted order for each node's connected nodes
Answered by AI
Add your answer
Q2. 
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...read more
Ans. 
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
• Start with the smallest possible sum that can be represented, which is 1.

• Iterate through the array and update the smallest sum that cannot be represented.

• Return the final smallest sum that cannot be represented.
Answered by AI
Add your answer
Q3. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure to visit all connected components of the graph.

• Print the BFS traversal sequence for each test case in a separate line.

• Handle cases where not all vertices are reachable from vertex 0.
Answered by AI
View 1 more answer

Round duration - 100 minutes
Round difficulty - Easy

Mostly technical and System Design questions were asked.

Q1. Design an LRU (Least Recently Used) cache.
Ans. 
Design an LRU cache to store least recently used items efficiently.
• Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

• If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.
Answered by AI
Add your answer