Filter interviews by
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
It is a test of total 150+ questions in which we have some java pseudocodes ,python ,aptitude reasoning questions as well and english questions.
The program checks if a given sentence is a palindrome or not.
Prompt the user to input a sentence
Remove all spaces and punctuation from the sentence
Reverse the sentence and compare it with the original sentence to check for palindrome
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
First round of interview was a couple of questions on Java, SQL and algorithms
Two coding questions, one is easy and the other is difficult. Who solved 2nd question was shortlisted for an interview.
I appeared for an interview in Feb 2024.
Single responsibility principle states that a class should have only one reason to change.
Each class should have only one responsibility
Helps in making code more maintainable and easier to understand
Promotes separation of concerns
Example: A class that handles user authentication should not also handle file management
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Loop in linked list is a situation where a node points to a previous node in the list, creating an infinite loop.
Check for loops using Floyd's cycle detection algorithm
Use two pointers, one moving twice as fast as the other, to detect a loop
If the fast pointer catches up to the slow pointer, there is a loop
posted on 10 Sep 2023
It was an easy test. It consisted of MCQs and two coding qns. Prepare SQL well. It also had 2 programming question. Both were medium difficukty
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
I applied via Walk-in and was interviewed in Oct 2024. There were 2 interview rounds.
Round one was an online coding test where there were 5 sections :
1 - dsa - medium
2 - Java - Easy
3 - OOP - Easy
4 - Git - Easy
Bean annotation is used in Spring Boot on class or method to indicate that a method produces a bean to be managed by the Spring container.
Bean annotation is used on methods within a class to indicate that the method produces a bean to be managed by the Spring container.
It can also be used at the class level to indicate that the class itself is a Spring bean.
For example, @Bean annotation can be used on a method that cre...
Protected access modifier restricts interface method access to only derived or implemented classes.
Use 'protected' access modifier to restrict access to only derived or implemented classes
Protected members are accessible within the same package or by subclasses
Example: 'protected void methodName() {}' in an interface
Microservices interact with each other through APIs, messaging, or events.
Microservices communicate with each other through APIs, which can be synchronous or asynchronous.
Messaging systems like RabbitMQ or Kafka can be used for communication between microservices.
Events can be used for loosely coupled communication between microservices.
Service discovery mechanisms like Eureka or Consul help microservices locate and co...
To detect the best day to buy and sell stock in an integer array representing stock prices and days in O(N).
Iterate through the array and keep track of the minimum price seen so far.
Calculate the profit by subtracting the current price from the minimum price.
Update the maximum profit and best buy/sell days accordingly.
Return the best buy and sell days to maximize profit.
Find the next greatest number for each integer in an array in O(N) time complexity.
Iterate through the array from right to left
Use a stack to keep track of potential next greatest numbers
Pop elements from the stack that are less than the current element and update their next greatest number to the current element
Push the current element onto the stack
Repeat until all elements have a next greatest number
1 coding question, and basic MCQ
1st round was DSA round. Pretty easy
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
Software Development Engineer
54
salaries
| ₹4.8 L/yr - ₹9 L/yr |
Data Engineer
51
salaries
| ₹5 L/yr - ₹13 L/yr |
Software Developer
35
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Software Engineer
34
salaries
| ₹4 L/yr - ₹11.7 L/yr |
Hadoop Administrator
25
salaries
| ₹5.2 L/yr - ₹16 L/yr |
Markelytics Solutions
Savista Global Solutions
Jasper Colin
GfK MODE