Slice Software Developer Interview Questions and Answers

Q1. Binary search algo quetion
Add your answer

Q1. Basic DSA Question
Add your answer

Q1. Mobile Development Related Questions
Add your answer

Q1. Basic HR Questions
Add your answer

One medium and one standard DP question

Q1. Medium level question based on binary search
Add your answer

Q1. Design google-pay
Ans. 
Design Google Pay - a digital wallet platform for online payments and transactions.
• Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.

• Enable users to make payments in stores, online, and within apps using their stored payment methods.

• Implement security features like biometric authentication, tokenization, and encryption to protect user data.

• Provide features fo...read more
Answered by AI
Add your answer
Q2. HLD of recursive
Ans. 
High Level Design (HLD) of recursive functions in software development.
• Recursive functions call themselves to solve smaller instances of the same problem.

• HLD of recursive functions involves defining the base case, recursive case, and termination condition.

• Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Answered by AI
Add your answer

Q1. Puzzles available on GFG
Add your answer
Q2. Behavioral question
Add your answer

Q1. LLD HLD HM rounds
Add your answer

Mcqs based on cs fundamentals and 2_3 coding questions

Q1. 2-3 DSA questions to be written on paper in the interview itself
Add your answer
Q2. Merge 2 sorted Linked list into 1
Ans. 
Merge two sorted linked lists into one.
• Create a new linked list to store the merged list.

• Compare the values of the nodes from both lists and add the smaller value to the new list.

• Move the pointer of the list with the smaller value to the next node.

• Repeat the comparison and addition until one of the lists is empty.

• Add the remaining nodes from the non-empty list to the new list.

• Return the new merged list.
Answered by AI
Add your answer

Q1. A full cv analysis interview round discussion on all the projects and team work experience
Add your answer

Basic aptitude , same syllabus that of tcs

Two debugging questions, of medium level

Q1. What are react hooks, class based components ,linked list ,palindrome , state in components , virtual and real dom
Ans. 
A set of concepts and tools used in React for managing state and rendering UI components.
• React hooks are functions that allow you to use state and other React features without writing a class component.

• Class based components are a way of defining React components using ES6 classes.

• Linked list is a data structure that consists of a sequence of nodes, each containing a reference to the next node.

• Palindrome is a word, phr...read more
Answered by AI
Add your answer
Q2. Sql quries, 2nd max salary, Nth max salary , Group by, deff between delete, truncate,drop
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

Q1. 
Flip Equivalent Binary Tree Problem
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...read more
Ans. 
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
• Perform a depth-first search (DFS) on both trees simultaneously

• At each node, check if the values are equal and the left and right subtrees are either both null or both not null

• If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

• If any of the condition...read more
Answered by AI
Add your answer
Q2. 
Split Array Into Increasing Subsequences Problem Statement
You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array i...read more
Ans. 
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
• Check if the array can be split into increasing subsequences by iterating through the array.

• Keep track of the current subsequence and its length while iterating.

• If the difference between the current element and the previous element is not 1, start a new subsequence.

• If the length of any subseque...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

Q1. 
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Iterate through the array and check if every second element is greater than its left and right element

• If not, swap the current element with its adjacent element to satisfy the condition

• Continue this process until the entire array satisfies the condition

• Return 1 if the array satisfies the condition, else re
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am