Filter interviews by
I applied via Instahyre and was interviewed in Apr 2024. There were 4 interview rounds.
There is 1 coding question from ds, and 5 MCQs from general programming knowledge
This is a craft round where you have to finish an assignment keeping in mind all the protocols, basically a production ready code. Around a week's time is given
I appeared for an interview in Mar 2022.
Round duration - 60 minutes
Round difficulty - Medium
Interview held in working timing. They make you comfortable so that you do not feel nervous.
Design a system like Pastebin for sharing text snippets
Use a web application framework like Django or Flask for the backend
Store text snippets in a database with unique URLs for each snippet
Implement user authentication and permissions for private and public sharing
Include features like syntax highlighting, expiration dates, and password protection
Optimize for fast and efficient text retrieval and storage
Round duration - 60 minutes
Round difficulty - Medium
Standard Problem solving round
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
Perform a pre-order traversal to get the left boundary nodes
Perform an in-order traversal to get the leaf nodes
Perform a post-order traversal to get the right boundary nodes
Combine the results in the required order to get the boundary nodes
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all valid combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively build the combinations by adding open parentheses if there are remaining, and then adding close parentheses if the number of open parentheses is greater than the numbe...
Round duration - 60 minutes
Round difficulty - Medium
This round was a mix of design and data structures
Given an integer array/list arr
and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
The first line c...
Count the total number of unique pairs in an array whose elements sum up to a given value.
Use a hashmap to store the frequency of each element in the array.
Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.
Increment the count of pairs if the complement exists in the hashmap.
Divide the count by 2 to avoid counting duplicates like (arr[i], arr[j]) and (arr[j], arr[i])
Round duration - 30 minutes
Round difficulty - Medium
Standard managerial round
Tip 1 : Practice every topic and company related questions of each topic
Tip 2 : Practice system design well
Tip 1 : Keep it short
Tip 2 : Showcase your work by highlighting the impact that it had
I appeared for an interview in Feb 2022.
Round duration - 90 Minutes
Round difficulty - Easy
In this round, there are a total of 16 questions and the time given was 90 mins.
3 Coding questions – Easy, Medium, and Hard.
13 MCQs based on outputs, Computer fundamentals, Aptitude.
You are provided with an integer 'N'. For an 'N' x 'N' chessboard, determine how to position 'N' queens such that no queen can attack another queen on the chessboard.
The N Queens problem involves placing N queens on an N x N chessboard so that no two queens can attack each other.
Use backtracking to explore all possible configurations of queen placements.
Keep track of rows, columns, and diagonals to ensure no two queens are attacking each other.
Print all valid configurations of queen placements.
Given an integer array ARR
of size N
and an integer S
, your goal is to return a list of all pairs of elements such that the sum of elements of each pair equals S
.
Return pairs of elements in an array whose sum equals a given integer.
Iterate through the array and store elements in a hashmap.
For each element, check if the complement (S - current element) exists in the hashmap.
Return pairs that satisfy the condition, sorted as per the given rules.
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
Determine the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
Sort the arrival and departure times in ascending order.
Use two pointers to keep track of overlapping schedules.
Increment platform count when a new train arrives before the previous one departs.
Round duration - 120 minutes
Round difficulty - Easy
This round is an interesting experience to brainstorm, problem-solve and pair alongside a ThoughtWorks Developer that allows you to demonstrate hands-on coding, design, OOP, and solution skills on the code which you have submitted.The problem statement will be shared with you 20 minutes before the start time of the interview
Tip 1 : Prepare system design
Tip 2 : Practice coding questions
Tip 3 : Prepare and search previous interviews
Tip 1 : Have atleast 3 great project
Tip 2 : Write only what you know and prepare well
I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
Event loop is a mechanism that allows non-blocking I/O operations in a single-threaded environment.
Event loop is used in programming languages like JavaScript and Python.
It manages the execution of multiple tasks by prioritizing them based on their priority level.
It continuously checks for new events and executes them in a loop.
It allows for efficient handling of I/O operations without blocking the main thread.
It is co...
let, var and const are used to declare variables in JavaScript with different scoping rules and mutability.
let and var are used to declare variables that can be reassigned later, but var has function scope while let has block scope.
const is used to declare variables that cannot be reassigned and have block scope.
Using const does not mean the value is immutable, only the variable reference is.
let and const were introduc...
I applied via Recruitment Consulltant and was interviewed before Sep 2021. There were 3 interview rounds.
This was a very easy test. It can be crackable easily.
Junit test cases should always be re-run to ensure code quality and prevent regression.
Junit test cases should be run after every code change.
Test cases should cover all possible scenarios and edge cases.
Test cases should be automated to save time and ensure consistency.
Test cases should be reviewed and updated regularly.
Regression testing should be performed to ensure new changes do not break existing functionality.
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
The question covers various topics related to software development and testing.
SDLC stands for Software Development Life Cycle and is a process followed for software development.
STLC stands for Software Testing Life Cycle and is a process followed for software testing.
Agile is a software development methodology that emphasizes on iterative and incremental development.
Different types of testing include unit testing, int...
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
I applied via Walk-in and was interviewed before Jun 2021. There were 3 interview rounds.
Quantitative ability and logical ability
I am proficient in Java and Python.
Strong understanding of object-oriented programming concepts
Experience with Java frameworks such as Spring and Hibernate
Proficient in Python libraries such as NumPy and Pandas
Program to print HCF of numbers as output
Take input of two numbers from user
Find the smaller number between the two
Run a loop from 1 to the smaller number
Check if both numbers are divisible by the current loop variable
If yes, update the HCF variable
Print the HCF as output
based on 1 interview
Interview experience
Senior Software Engineer
227
salaries
| ₹21 L/yr - ₹80 L/yr |
Software Engineer2
137
salaries
| ₹20 L/yr - ₹61 L/yr |
Software Engineer
101
salaries
| ₹25.3 L/yr - ₹40.8 L/yr |
Software Developer
48
salaries
| ₹10.2 L/yr - ₹36.4 L/yr |
Devops Engineer
45
salaries
| ₹4.2 L/yr - ₹16 L/yr |
Salesforce
Yodlee
Xoriant
CitiusTech