Qubited Web UI UX Designer Interview Questions and Answers

Q1. Portfolio round- asked to present your sample work.
Add your answer
Q2. Live Design Challenge- Asked to replicate design using Figma while the interviewers observe.
Add your answer

Unprofessional hiring process, no response after submitting a task despite multiple follow ups

Debugging questions are mostly asked, you can get them from GFG

In coding test , mostly the leetcode medium questions are asked like tree traversal and linked list related questions

Round duration - 60 minutes
Round difficulty - Medium

Online Coding Test on Calyxpod platform. There were 2 coding questions

Q1. Intersection of Linked List
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered Anonymously
Add your answer
Q2. Most Frequent Word
You are given a paragraph that may have letters both in lowercase and uppercase, spaces, and punctuation. You have also given a list of banned words. Now your task is to find the most fr...read more
Ans. Brute Force
1. To find the frequency of each word we need to extract the words from the paragraph.
2. So we will convert all the punctuation to space in the paragraph and lowercase alphabets to uppercase.
3. Now we can use the library function (e.g sstream in C++) to extract words from the paragraph in an array of strings say WORDS.
4. We will iterate over WORDS and do:
   1. Iterate over the banned array and check if the current word is pre...read more
Answered Anonymously
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

Advance Subjective Round on Calyxpod platform: 5 questions. One question was related to data structures and algorithms. Other 4 were related to Html, CSS and Javascript.

Q1. Balanced parentheses
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
...read more
Ans. Recursion
The idea is to generate all possible combinations and check whether the combination is the combination of balanced parentheses or not. We have two choices whether to consider ‘(‘ or ‘)’.
When the number of closing brackets is greater than the number of opening brackets we can consider taking ‘)’ in the sequence and in the other case we can consider taking ‘(‘ for all numbers of opening brackets until the number...read more
Answered Anonymously
Add your answer