ShopUp Software Development Engineer 1 Interview Questions and Answers

27 aptitude qusetions (easy-medium)

There was an option to select between Hard Aptitude Test and Coding Test. I went for coding test. Easy questions on arrays and strings.

Q1. Basic Coding Questions
Add your answer
Q2. Projects/Experience Discussion
Add your answer
Q3. Discussion on APIs and how they work
Add your answer

Q1. Check a number is prime or not.
Ans. 
To check if a number is prime, iterate from 2 to the square root of the number and check for divisibility.
• Start by checking if the number is less than 2, in which case it is not prime.

• Iterate from 2 to the square root of the number and check if the number is divisible by any of these numbers.

• If the number is divisible by any number in the range, it is not prime. Otherwise, it is prime.
Answered by AI
Add your answer
Q2. A two pointer question (two sum)
Ans. 
Find two numbers in an array that add up to a specific target using a two-pointer technique.
• Sort the array first to use the two-pointer technique effectively.

• Initialize two pointers: one at the start and one at the end of the array.

• If the sum of the two pointed values equals the target, return those values.

• If the sum is less than the target, move the left pointer to the right to increase the sum.

• If the sum is greater t...read more
Answered by AI
Add your answer

Q1. OS and DBMS questions
Add your answer
Q2. Multihreading vs Multiprocessing
Ans. 
Multithreading allows multiple threads to share the same memory space, while multiprocessing involves separate memory spaces for each process.
• Multithreading is more lightweight and efficient than multiprocessing.

• Multithreading is suitable for tasks that involve I/O operations, while multiprocessing is better for CPU-bound tasks.

• Examples of multithreading include web servers handling multiple requests concurrently, whil...read more
Answered by AI
Add your answer
Q3. ACID principles and SQL queries
Add your answer
Q4. Reverse a Linked List
Ans. 
Reverse a linked list by changing the next pointers of each node to point to the previous node.
• Start with three pointers: current, previous, and next.

• Iterate through the linked list, updating the next pointer of each node to point to the previous node.

• Update the previous, current, and next pointers for each iteration.

• Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
Answered by AI
Add your answer
Q5. Edit Alphabets (A Dynamic Programming question)
Add your answer
Q6. A two pointer based question.
Add your answer

Q1. A graph question to find path in a maze.
Ans. 
Use depth-first search or breadth-first search to find a path in a maze graph.
• Implement a graph representation of the maze using an adjacency list or matrix.

• Use depth-first search (DFS) or breadth-first search (BFS) to explore the maze and find a path from start to end.

• Track visited nodes to avoid infinite loops and dead ends.

• Consider edge cases such as multiple paths, loops, and obstacles in the maze.
Answered by AI
Add your answer
Q2. Find area under a graph (coding question)
Ans. 
Calculate the area under a graph using numerical integration.
• Use numerical integration methods like trapezoidal rule or Simpson's rule to approximate the area under the curve.

• Divide the graph into small segments and calculate the area of each segment, then sum them up to get the total area.

• Make sure to handle cases where the graph is below the x-axis by taking the absolute value of the function before calculating the a...read more
Answered by AI
Add your answer
Q3. Hard SQL queries were asked
Add your answer

Q1. General Questions / nothing technical or job relevant
Add your answer