Filter interviews by
Clear (1)
The LAN and WAN network issues have been resolved successfully.
Identify and troubleshoot the root cause of the network issues
Implement necessary fixes or configurations to resolve the issues
Test the network connections to ensure stability and functionality
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via LinkedIn and was interviewed before Jun 2023. There were 3 interview rounds.
Give me a palindrom of string related question
To scale a system, consider horizontal and vertical scaling, load balancing, caching, database sharding, and microservices architecture.
Implement horizontal scaling by adding more instances of the application to distribute the load.
Consider vertical scaling by upgrading the hardware resources of the existing server.
Use load balancing to evenly distribute incoming network traffic across multiple servers.
Implement cachin...
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 3 interview rounds.
Find the longest palindromic substring in a given string.
Use dynamic programming to solve the problem efficiently.
Start with the base cases of single characters and two characters.
For longer substrings, check if the first and last characters match and if the substring between them is also a palindrome.
Keep track of the longest palindrome seen so far.
Time complexity: O(n^2), space complexity: O(n^2).
Developing a real-time data processing system for a high-traffic website.
Designing a scalable architecture to handle the high volume of incoming data.
Optimizing the data processing algorithms to minimize latency.
Ensuring data consistency and accuracy in a distributed system.
Implementing fault-tolerant mechanisms to handle system failures.
Testing and debugging the system under various load conditions.
I was interviewed 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 Referral and was interviewed before May 2023. There were 2 interview rounds.
I applied via Recruitment Consulltant
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Dec 2020. There was 1 interview round.
based on 1 interview
Interview experience
Associate
492
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
476
salaries
| ₹0 L/yr - ₹0 L/yr |
Process Associate
367
salaries
| ₹0 L/yr - ₹0 L/yr |
Supervisor
235
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead Operations
225
salaries
| ₹0 L/yr - ₹0 L/yr |
Delhivery
Ekart Logistics
Blue Dart Express
DTDC Express