Filter interviews by
Clear (1)
I applied via Company Website
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Apr 2021. There were 4 interview rounds.
Classifiers are used in machine learning to categorize data into different classes based on their features.
Classifiers help in predicting the class of new data based on the patterns learned from the training data.
They are used in various applications such as image recognition, spam filtering, sentiment analysis, etc.
Popular classifiers include decision trees, support vector machines, logistic regression, etc.
Optimizing a query involves identifying and resolving performance issues.
Identify slow queries using profiling tools
Use indexes to speed up data retrieval
Reduce the amount of data being queried
Avoid using SELECT *
Use JOINs instead of subqueries
Normalize database tables
Use caching to reduce database load
Top trending discussions
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 10 A.M.
Your task is to decode a given encoded string back to its original form.
An encoded string format is <count>[encoded_string], where the 'encoded_string...
The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.
Parse the input string to extract the count and the encoded string within the brackets
Use recursion to decode the encoded string by repeating it 'count' times
Handle nested encoded strings by recursively decoding them
Output the decoded string for each test case
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers approach to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.
You are provided with a string EXP
which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
An i...
Convert a given infix expression to postfix expression.
Use a stack to keep track of operators and operands.
Follow the rules of precedence for operators (*, / have higher precedence than +, -).
Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.
Round duration - 30 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 2 P.M.
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
STR =...
The task is to find the first repeated character in a given string of lowercase English letters.
Iterate through the string and keep track of characters seen so far in a set.
If a character is already in the set, return it as the first repeated character.
If no repeated character is found, return '%'.
Round duration - 45 minutes
Round difficulty - Medium
Video Call interview where the interview happened for around 45 minutes.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all paths in the tree.
Optimize the solution to avoid redundant calculations.
Round duration - 30 minutes
Round difficulty - Easy
Video Call interview where the interview happened for around 30 minutes.
Tip 1 : Practise 5 problems daily from websites like hackerrank, codechef, codeforces
Tip 2 : Participate in codechef, codeforces contest.
Tip 3 : Attend mock interviews and should have good communication skills.
Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.
DHCP assigns IP addresses to devices on a network
DNS translates domain names to IP addresses
DHCP reduces the need for manual IP address configuration
DNS allows users to access websites using domain names instead of IP addresses
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
based on 4 interviews
Interview experience
based on 3 reviews
Rating in categories
Associate Software Engineer
31
salaries
| ₹5.1 L/yr - ₹15.8 L/yr |
Senior Software Engineer
31
salaries
| ₹13.2 L/yr - ₹26 L/yr |
Software Engineer
24
salaries
| ₹5.8 L/yr - ₹15 L/yr |
Production Analyst
15
salaries
| ₹13 L/yr - ₹16 L/yr |
Technical Lead
14
salaries
| ₹20 L/yr - ₹36 L/yr |
Fourkites
Roambee
FarEye
LogiNext Solutions