Swipewire Technologies SDE-2 Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

It was a problem solving round where a hackerrank link was given containing 2 questions.
You have to solve them within 90 minutes.
I was asked to solve it within a week.

Q1. 
Find Distinct Palindromic Substrings
Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...read more
Ans. 
Given a string, find and print all distinct palindromic substrings within it.
• Iterate through all possible substrings of the input string

• Check if each substring is a palindrome

• Store distinct palindromic substrings in a set and then sort them before printing
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

2 questions was asked by the interviewer. You have to clearly explain your approach and write a working solution. He even asked me to run on some additional test cases

Q1. 
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...read more
Ans. 
Maximize profit by scheduling jobs within their deadlines.
• Sort the jobs based on their profits in descending order.

• Iterate through the sorted jobs and schedule them based on their deadlines.

• Keep track of the maximum profit achievable by scheduling jobs within their deadlines.
Answered by AI
Add your answer
Q2. 
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...read more
Ans. 
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the subset sum possibilities.

• Check if the total sum of the array is even before attempting to partition.

• Iterate through the array and update the subset sum array accordingly.

• Return true if the subset sum array contains a sum equal to hal
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I was asked 1 system design question. The question was to design an online multiplayer game which can be scaled for more than 10 million users. 
The interviewer helped me to collect requirement and also helped me in choosing different low latency protocol to communicate between client and server.

Round duration - 60 minutes
Round difficulty - Medium

The interviewer asked few sql based questions and asked me to write the solution.
He also gave 1 problem solving question.

Q1. Can you explain the different types of joins in SQL and how to calculate the average of all values from a given table?
Ans. 
Different types of joins in SQL and calculating average of values from a table.
• Types of joins: INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN

• To calculate average: Use AVG() function in SQL

• Example: SELECT AVG(column_name) FROM table_name
Answered by AI
Add your answer

Round duration - 1 hour
Round difficulty - Medium

This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.

Q1. 
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input ...read more
Ans. 
Return all possible permutations of a given input string.
• Use recursion to generate all possible permutations of the input string.

• Swap characters at different positions to generate permutations.

• Handle duplicate characters by skipping swapping if the characters are the same.
Answered by AI
Add your answer
Q2. 
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...read more
Ans. 
The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.
• Create an array to store the elements of the Kth row of Pascal's Triangle.

• Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the elements.

• Return the array as the output.
Answered by AI
Add your answer

Round duration - 2 hours
Round difficulty - Medium

This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.

Round duration - 75 minutes
Round difficulty - Medium

This was the last round. This was HM round followed by the HR round.

Round duration - 60 Minutes
Round difficulty - Medium

Anytime

Q1. 
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
Input:
The input sta...read more
Ans. 
The task is to sort an array of 0s, 1s, and 2s in increasing order.
• Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.

• Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.

• While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If
Answered by AI
Add your answer
Q2. 
Connect Ropes with Minimum Cost
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...read more
Ans. 
The task is to connect N ropes into one rope with minimum cost.
• Sort the array of rope lengths in ascending order.

• Initialize a variable to keep track of the total cost.

• While there are more than one rope, take the two shortest ropes and connect them.

• Add the cost of connecting the two ropes to the total cost.

• Replace the two shortest ropes with the connected rope.

• Repeat the above steps until only one rope remains.

• Return th
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Maximum Subarray Sum Problem Statement
Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Example of Sub...read more
Ans. 
The task is to find the maximum possible sum of a non-empty subarray of an array.
• Iterate through the array and keep track of the maximum sum encountered so far

• If the current element is greater than the sum so far, start a new subarray

• If the current element plus the sum so far is greater than the maximum sum, update the maximum sum

• Return the maximum sum
Answered by AI
Add your answer
Q2. 
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...read more
Ans. 
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
• The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

• To find the diameter of a binary tree, we can use a recursive approach where we calcu...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was more aroung sytem design and my past work experience.

Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
Ans. 
Design a bookmyshow system
• Design a system to book and manage movie tickets

• Consider features like seat selection, payment, and ticket cancellation

• Include user authentication and authorization

• Implement a database to store movie and theater information

• Consider scalability and performance of the system
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is non-tech round.They just want to check your nature ,attitude and team work skills.

Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
Ans. 
I want to leave my current job for better growth opportunities and a more challenging role.
• Seeking new challenges and opportunities for professional growth

• Looking for a role that aligns better with my skills and interests

• Desire to work in a more dynamic and innovative environment

• Seeking better compensation and benefits

• Wanting to expand my knowledge and skills in a different domain
Answered by AI
Add your answer

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.

Q1. Basic discussion around the project & past experience.
Add your answer
Q2. Design a 2/3rd Winning game.
Ans. 
Design a 2/3rd Winning game.
• The game should have a clear win condition

• The win condition should be achievable in 2/3rd of the total game time

• The game should have a balanced difficulty level

• The game should have a clear feedback system for the player

• Examples: Chess, Tic Tac Toe, Connect Four
Answered by AI
Add your answer
Q3. Discussion around how would you scale a application.
Add your answer
Q4. NoSQL vs SQL difference
Ans. 
NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.
• NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.

• SQL databases are vertically scalable and are better suited for structured data with complex relationships.

• NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.

• Examples of NoSQL d...read more
Answered by AI
Add your answer

Q1. Hiring Manager round
Add your answer
Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
Add your answer
Q3. This round was mainly for seeing the culture fitment of a candidate.
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive

Round duration - 60 Minutes
Round difficulty - Medium

timing noon 3-4Pm
good interviewer 
interviwer was giving hints if required and all

Q1. 
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
Input:
The input sta...read more
Ans. 
Sort an array of 0s, 1s, and 2s in increasing order.
• Use a three-pointer approach to sort the array in a single pass.

• Initialize three pointers for 0, 1, and 2 values and iterate through the array.

• Swap elements based on the values encountered to achieve the sorted array.

• Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].
Answered by AI
Add your answer
Q2. 
Maximum Path Sum Problem Statement
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
Example:
Input:
For the giv...read more
Ans. 
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
• Traverse the tree from root to leaf nodes, keeping track of the sum along the path.

• At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.

• Consider using depth-first search (DFS) to traverse the tree efficiently.

• Handle cases where nodes are absent (-1) by appropriately updating the pat...read more
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

evening 4-5:30PM
interviewer was good
very supportive and giving hints

Q1. Design a system for BookMyShow to allow users to book movie tickets.
Ans. 
Design a system for BookMyShow to allow users to book movie tickets.
• Create a user-friendly website and mobile app for users to browse movies and showtimes.

• Implement a secure payment gateway for users to purchase tickets online.

• Develop a database to store movie information, showtimes, and user bookings.

• Include features like seat selection, ticket confirmation, and booking history for users.

• Integrate with cinema partners
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Easy

4-5 PM
Interviewer was good

Q1. Why should we hire you?
Add your answer
Q2. Why are you considering a switch in your job?
Add your answer

This was a machine coding round in which we have to implement an online cab booking service.

Standard problem solving round consists of two questions on tree and dp.

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.