Info Edge Associate UI UX Designer Interview Questions and Answers

Q1. Center div using 3 approaches
Ans. 
Three approaches to center a div element
• Using CSS flexbox: set display property of parent element to flex and justify-content to center

• Using CSS grid: set display property of parent element to grid and place the div in the center grid area

• Using margin: set margin property of the div to auto
Answered by AI
Add your answer
Q2. Display use of setTimeout
Ans. 
setTimeout is a function in JavaScript used to execute a function after a specified amount of time.
• setTimeout(function, milliseconds) is used to delay the execution of a function by a specified number of milliseconds.

• Example: setTimeout(() => { console.log('Hello, world!'); }, 2000) will log 'Hello, world!' after 2 seconds.
Answered by AI
Add your answer

Asked me to create a carousel component

Round duration - 60 minutes
Round difficulty - Medium

This round had questions related to aptitude and coding

Q1. 
Find Duplicates in an Array Problem Statement
You are provided with an array/list ARR of size 'N', containing integers ranging from 0 to N - 1. Some elements in this array might be repeating. Your task is...read more
Ans. 
Identify duplicate elements in an array of integers ranging from 0 to N-1.
• Iterate through the array and keep track of seen elements using a hash set.

• If an element is already in the set, it is a duplicate and can be added to the result.

• Return the list of duplicate elements found in the array.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had some questions from OOPS and some from DBMS

Q1. What is compile-time polymorphism, and how does it differ from runtime polymorphism?
Ans. 
Compile-time polymorphism is achieved through function overloading and operator overloading, while runtime polymorphism is achieved through virtual functions and inheritance.
• Compile-time polymorphism is resolved during compile-time based on the number and types of arguments passed to a function.

• Examples of compile-time polymorphism include function overloading, where multiple functions with the same name but different ...read more
Answered by AI
Add your answer
Q2. What are the ACID properties in DBMS?
Ans. 
ACID properties in DBMS ensure data integrity and consistency.
• Atomicity: All transactions are either completed in full or not at all.

• Consistency: Data must be in a valid state before and after a transaction.

• Isolation: Transactions should be isolated from each other until they are completed.

• Durability: Once a transaction is committed, changes are permanent and cannot be lost.

• Example: If a bank transfer fails midway, the...read more
Answered by AI
Add your answer
Q3. What are the various types of inheritance in Object-Oriented Programming?
Ans. 
The various types of inheritance in Object-Oriented Programming include single inheritance, multiple inheritance, multilevel inheritance, hierarchical inheritance, and hybrid inheritance.
• Single inheritance: A class inherits from only one base class.

• Multiple inheritance: A class inherits from more than one base class.

• Multilevel inheritance: A class inherits from a class, which in turn inherits from another class.

• Hierarc...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to the point and professional. The interview lasted for 30 minutes.

Q1. What is something about you that is not included in your resume?
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was an MCQ + coding based round consisting of multiple choice questions from topics like Aptitude, Logical reasoning, English, Programming ,etc. and 2 coding problems

Q1. 
Prime Numbers within a Range
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Input:
Integer N
Output:
Prime numbers printed on separate lines
Example:
Input...read more
Ans. 
Generate and print all prime numbers between 2 and N, inclusive.
• Iterate from 2 to N and check if each number is prime

• A prime number is only divisible by 1 and itself

• Print each prime number on a new line
Answered by AI
View 1 more answer
Q2. 
Print All Permutations of a String
Given an input string STR, generate and print all possible permutations of the string.
Input:
str
Output:
All permutations of the input string, each on a new line.
...read more
Ans. 
Generate and print all possible permutations of a given input string.
• Use recursion to generate all permutations by swapping characters in the string.

• Maintain a visited array to keep track of characters already used in a particular permutation.

• Print each permutation as it is generated.

• Handle duplicate characters by skipping swapping if the character is already in the current position.
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

There were 2 interviewers. Firstly, they asked me to give my introduction. Then they asked me to explain any one of my projects in detail along with its demonstration. After this, they began with the DSA and computer fundamentals part.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
Given an array of integers and a target, find all pairs of elements that add up to the target.
• Iterate through the array and for each element, check if the difference between the target and the element exists in a hashmap.

• If it exists, add the pair to the result. If not, add the element to the hashmap.

• Handle cases where the same element is used twice in a pair.

• Return the pairs found or (-1, -1) if no pair is found.
Answered by AI
Add your answer
Q2. 
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...read more
Ans. 
Implement a queue using stacks with enQueue, deQueue, peek, and isEmpty operations.
• Use two stacks to simulate a queue - one for enqueueing and one for dequeueing.

• For enQueue operation, push elements onto the enqueue stack.

• For deQueue operation, if the dequeue stack is empty, transfer elements from enqueue stack to dequeue stack.

• For peek operation, return the top element of the dequeue stack.

• For isEmpty operation, check...read more
Answered by AI
Add your answer
Q3. 
Swap Kth Elements in an Array
Given an array ARR of size N, perform the operation to swap the Kth element from the beginning with the Kth element from the end of the array.
Example:
Input:
N = 5, K = 2
...read more
Ans. 
Swap Kth elements in an array with given constraints.
• Create a temporary variable to store the Kth element from the start

• Swap the Kth element from the start with the Kth element from the end

• Return the modified array
Answered by AI
Add your answer

Q1. Basic concepts of OOPS, web development, some easy-medium level coding questions. Your projects and aspirations.
Add your answer
Q2. Theoretical concepts of DBMS, OS & Computer Network, basic SQL queries.
Add your answer

Q1. Why should we hire you?
Add your answer
Q2. What are your strengths and weaknesses?
Add your answer
Q3. Tell me about yourself.
Add your answer

An online test was taken on Aspiring Minds platform. The test duration was of 1 hour and test consists of questions related to aptitude, english and coding.

Q1. Why java is known as platform independent language?
Ans. 
Java is platform independent because it uses the concept of bytecode and virtual machine.
• Java code is compiled into bytecode, which is a platform-independent representation of the code.

• The bytecode is then executed by the Java Virtual Machine (JVM), which is specific to each platform.

• This allows Java programs to run on any platform that has a compatible JVM.

• The JVM acts as an interpreter, translating the bytecode into ...read more
Answered by AI
View 1 more answer
Q2. What is exception handling. How to implement it?
Ans. 
Exception handling is a mechanism to handle runtime errors and prevent program crashes.
• Exception handling is used to catch and handle errors that occur during program execution.

• It involves the use of try-catch blocks to catch exceptions and handle them gracefully.

• The try block contains the code that might throw an exception, and the catch block handles the exception.

• Multiple catch blocks can be used to handle different...read more
Answered by AI
View 1 more answer
Q3. Given a list of custom class objects. Write a program to sort that list based on one of its properties.
Ans. 
Sort a list of custom class objects based on one of its properties.
• Use a sorting algorithm like bubble sort, insertion sort, or merge sort.

• Implement a comparison function to compare the desired property of the objects.

• Apply the sorting algorithm to the list of objects using the comparison function.
Answered by AI
View 1 more answer
Q4. Write a SQL query to print number of rows in a table.
Ans. 
A SQL query to count the number of rows in a table.
• Use the COUNT() function in SQL to count the number of rows in a table.

• Specify the table name in the FROM clause.

• Use the result of the COUNT() function to print the number of rows.
Answered by AI
View 1 more answer
Q5. What are fundamental pillars of OOPS programming. Explain each of them in detail.
Ans. 
The fundamental pillars of OOPS programming are encapsulation, inheritance, and polymorphism.
• Encapsulation: It is the process of hiding the internal details of an object and providing a public interface for interacting with it.

• Inheritance: It allows creating new classes by inheriting properties and behaviors from existing classes, promoting code reuse.

• Polymorphism: It enables objects of different classes to be treated ...read more
Answered by AI
View 1 more answer

Q1. Tell me about yourself
Ans. Tell me about your experience and learnings which you got from your internships.
Answered by Aman Mehta
Add your answer
Q2. Where do you see yourself after 5 years?
Add your answer

Aptitude Question on various standard topics .

Q1. Application of stack in real life.
Ans. 
Stacks are used in real life for managing undo operations in text editors, backtracking in maze solving, and managing function calls in programming.
• Undo operations in text editors - allows users to go back to previous states of a document

• Backtracking in maze solving - helps in keeping track of visited paths and backtracking when necessary

• Managing function calls in programming - helps in keeping track of function calls
Answered by AI
Add your answer
Q2. Difference between i++ and ++i through implementation.
Ans. 
i++ and ++i are both increment operators in C++ but have different behaviors.
• i++ is a post-increment operator which increments the value of i after using it in an expression.

• ++i is a pre-increment operator which increments the value of i before using it in an expression.

• Example: int i = 5; int a = i++; // a = 5, i = 6; int b = ++i; // b = 7, i = 7;
Answered by AI
Add your answer

Q1. About your intro and family background.
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.
• Create a dummy node to start the merged list

• Iterate through both linked lists and compare nodes to merge them in sorted order

• Update the next pointers accordingly

• Handle cases where one list is empty or both lists are empty

• Return the head of the merged linked list
Answered by AI
Add your answer
Q2. 
Minimum Path Sum Problem Statement
Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...read more
Ans. 
The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.
• Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.

• Initialize a 2D array to store the minimum path sum values for each cell in the grid.

• Iterate through the grid to calculate the minimum path sum for each cell based on the...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.

Q1. 
Palindrome Partitioning Problem Statement
You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...read more
Ans. 
Given a string, partition it into palindromes and return all possible configurations.
• Use backtracking to generate all possible palindrome partitions

• Check if each substring is a palindrome before adding it to the partition

• Return all valid partitions as an array of strings
Answered by AI
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to solve this problem efficiently.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum value in the array as the result.
Answered by AI
Add your answer
Q3. 
Find Missing Number In String Problem Statement
You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S without any separators. During this pro...read more
Ans. 
Find the missing number in a string of consecutive nonnegative integers.
• Iterate through the string and check for missing numbers by comparing adjacent integers

• If a missing number is found, return it as the output

• Handle cases where there are multiple missing numbers or the string is invalid by returning -1
Answered by AI
Add your answer
Q4. What are the ACID properties in DBMS?
Ans. 
ACID properties in DBMS ensure data integrity and consistency.
• Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.

• Consistency: Database remains in a consistent state before and after the transaction.

• Isolation: Transactions are isolated from each other until they are completed.

• Durability: Once a transaction is committed, the changes made by it are permanent and...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.