Upload Button Icon Add office photos

Filter interviews by

E-Ring Software Developer Interview Questions and Answers

Updated 20 Jun 2022

E-Ring Software Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed in May 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - HR 

(1 Question)

  • Q1. What do you know about our company?
  • Ans. 

    The company is a leading software development firm specializing in creating innovative solutions for various industries.

    • The company has been in operation for over 10 years.

    • They have a strong focus on research and development.

    • They have a diverse client base, including companies in finance, healthcare, and technology.

    • The company has won several awards for their software products.

    • They prioritize collaboration and teamwork

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Is SQL a programming language?
  • Ans. 

    Yes, SQL is a programming language.

    • SQL stands for Structured Query Language.

    • It is used to manage and manipulate relational databases.

    • SQL can be used to create, modify, and delete databases, tables, and data.

    • It is also used to retrieve data from databases using queries.

    • SQL is not a general-purpose programming language like Java or Python.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with your programming basics and SQL.

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

15 Questions

  • Q1. Reverse a binary search tree in such a manner so that parent child relationship maintained and left child become right child and vice versa
  • Ans. 

    Reverse a binary search tree while maintaining parent-child relationship.

    • Start by swapping the left and right child of each node recursively.

    • Use a depth-first search approach to traverse the tree.

    • Make sure to update the parent-child relationships accordingly.

  • Answered by AI
  • Q2. Find the minimum and maximum element in stack in O(1)
  • Ans. 

    To find min and max element in stack in O(1), we can use an auxiliary stack.

    • Create an auxiliary stack to keep track of the minimum and maximum elements.

    • Push the first element to both the main and auxiliary stack.

    • For each subsequent element, compare it with the top element of the auxiliary stack and push the smaller element to the auxiliary stack.

    • To get the minimum element, simply return the top element of the auxiliary...

  • Answered by AI
  • Q3. Given an array find the next minimum element in array for each element. for example if give array is 4,2,1,5,3 resultant array would be 2,1,-1,3,-1
  • Ans. 

    Given an array, find the next minimum element for each element.

    • Iterate through the array

    • For each element, compare it with the elements on its right

    • Find the minimum element greater than the current element

    • If no such element exists, assign -1

    • Build the resultant array

  • Answered by AI
  • Q4. Given two string A and B . remove each character from string A which occur in B. if a occur 2 times in B remove 2 a from A
  • Q5. Find the median of input stream in minimum time complexcity.(Online algo)
  • Ans. 

    Find median of input stream in minimum time complexity using online algorithm.

    • Use two heaps, one max heap for elements smaller than current median and one min heap for elements greater than current median.

    • Maintain balance between the two heaps by ensuring that the size difference is at most 1.

    • If the size of both heaps is equal, median is the average of the top elements of both heaps. Else, median is the top element of ...

  • Answered by AI
  • Q6. Make copy of a linked list which has two pointer one point to next node and other one point to arbitrary node in linked list
  • Ans. 

    To make a copy of a linked list with two pointers, iterate through the original list and create a new node for each element.

    • Iterate through the original linked list

    • Create a new node for each element

    • Set the 'next' pointer of each new node

    • Set the 'arbitrary' pointer of each new node

  • Answered by AI
  • Q7. If u will access data from a social networking site such as Facebook . suggest some method to remove latency to access data
  • Q8. Given a cordinate system in which there are n points. you have to calculate the m minimum points from some origin point. Suggest a data structure for this
  • Q9. Some question on hash data structure
  • Q10. Given a linked list and some no n . you have to reverse the node of linked list in pair of n. consider all test cases for this
  • Ans. 

    Reverse the nodes of a linked list in pairs of n

    • Iterate through the linked list in pairs of n

    • Reverse the nodes within each pair

    • Connect the reversed pairs together

    • Handle cases where the number of nodes is not a multiple of n

  • Answered by AI
  • Q11. Given a array where the difference between two consecutive element is one. Given a no find that no in array in minimum time complexity
  • Q12. How to check singly linked list is palindrome or not
  • Ans. 

    To check if a singly linked list is a palindrome, reverse the second half and compare it with the first half.

    • Traverse the linked list to find the middle node

    • Reverse the second half of the linked list

    • Compare the reversed second half with the first half to check for palindrome

  • Answered by AI
  • Q13. Given a preorder of binary tree such that in tree each node have either 0 or no childern. and each leaf node is represented by N. construct a tree from this
  • Ans. 

    Given a preorder of binary tree with leaf nodes represented by N, construct the tree.

    • Start by creating an empty stack.

    • Iterate through the preorder list.

    • If the current element is N, create a leaf node and push it onto the stack.

    • If the current element is not N, create a new node and set its left child to the top of the stack.

    • Pop the top of the stack and set it as the right child of the new node.

    • Push the new node onto the...

  • Answered by AI
  • Q14. 14. you have given a string of multiline. you have to print the maximum occupancy word in each line and if there is some capital letter in each line then print each capital letter occupancy and then smal...
  • Ans. 

    The question asks to find the maximum occupancy word in each line of a given multiline string and also count the occupancy of capital and small letters separately.

    • Split the multiline string into individual lines

    • For each line, split it into words

    • Initialize variables to store the maximum occupancy word and its count

    • Iterate through each word and count the occupancy of each letter

    • If the current word has a higher occupancy ...

  • Answered by AI
  • Q15. One question related to password matching you have given some precondition for password then user input some password then you will validate the password with each condition if any one condition failed th...

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Preparation Tips

Round: HR INTERVIEW
Experience: Tell me about yourself.Most challenging task.-----://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/

Small modification in it. Parenthesis pairs are given in a separate list. You have to optimize the problem by suggesting the method you will need to store the pairs.

Round: HR INTERVIEW
Experience: What is the angle between hour and minute hand at 12:15. I said 90’ but corrected myself immediately.So he told me the importance that for huge no of clients this small mistake can create a blunder.He asked me a scenario where I faced this thing and thereby improved the time complexity.Lot of behavioural questions like conflicts with manager, team collaboration etc.

Round: HR INTERVIEW
Experience: -----://stackoverflow.com/questions/20026243/find-2-missing-numbers-in-an-array-of-integers-with-two-missing-valuesHe asked me if have heard of nut and bolt problem. I didn’t so he moved to next question.Given an array. Find the maximum number of groups of size of 2 or 3 that can be formed such that sum of the numbers in group is divisible by 3. No number can be reused.

Round: TECHNICAL INTERVIEW
Experience: Convert an integer to its roman. He asked me to consider cases with integers containing 4 and 9. I didn’t understand properly.He asked me if I I did anything extraordinary apart from my daily work in the office and what challenges I faced -----/

He did not accept this solution and asked me to optimize. This round didn’t go well, so I was not selected.

General Tips: Tips:Solve all the data structures related problems from geeksforgeeks and start practicing to write perfect code for any problem.
College Name: NA

Interview Questionnaire 

23 Questions

  • Q1. 18 questions in 20 minutes (probability, Os ,DSA,c)
  • Q2. In second section 2 programming questions in 30 minutes.(Pruning a binary tree , Cutting a rod so that we can get optimal benefit )
  • Q3. Given array of stock prices get the date of selling and buying so that profit is maximum
  • Ans. 

    Algorithm to find the best buying and selling dates for maximum profit from given stock prices array.

    • Iterate through the array and keep track of minimum price and maximum profit.

    • If current price is less than minimum price, update minimum price.

    • If current price minus minimum price is greater than maximum profit, update maximum profit and buying and selling dates.

    • Return buying and selling dates.

    • Example: [10, 7, 5, 8, 11,...

  • Answered by AI
  • Q4. Print a matrix diagonally . I was told to write the code as question was quite easy . After that we moved on
  • Q5. Frog can jump 1 or 2 steps write the code to find out number of ways to go up to n steps. Discussed the complexity of it with mathematical proof
  • Ans. 

    The code finds the number of ways to reach n steps by jumping 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem

    • Create an array to store the number of ways to reach each step

    • Initialize the array with base cases for 0 and 1 steps

    • Iterate through the array and calculate the number of ways for each step

    • Return the value at the last step

  • Answered by AI
  • Q6. Check for balancing of parenthesis using divide and conquer. Didn’t ask for code just wanted the approach. I solved it with stack. But he just wanted Divide and conquer. After thinking for 15 minutes and o...
  • Q7. There is a dictionary of billion words and there is one method provided String getWord(int index); We can give it index and it will return the String on that index . Now word is given to us we have to find...
  • Q8. After that he moved to Oops concepts asked about abstract classes and interfaces. Also asked when to use interfaces .After that we had discussion on volatile keyword(Asked for program which can show its be...
  • Q9. He told me if there is a class and if we want to use only 3 methods of it so in that case we should use inheritance or not. Asked for other better options
  • Q10. Why are you leaving your company so early
  • Q11. Discussion about project in company and about my college projects as well(It was a deep discussion and I think it can throw us out if we don’t give proper answers)
  • Q12. Replace each node in BST with sum of its greater nodes. I solved it quite easily after that he applied various constraints on it(around 3 or 4). So the problem became quite hard. But after thinking about ...
  • Q13. After that he discussed about n-ary tree and getting the LCA in n-ary tree of n nodes.(Wrote the code for it and discussed complexity)
  • Q14. Advantages and disadvantages of amazon.com
  • Ans. 

    Amazon.com is an online retail giant with a vast selection of products and services.

    • Advantages: Wide selection of products, competitive pricing, fast shipping, convenient shopping experience

    • Disadvantages: Can put smaller retailers out of business, concerns over worker treatment and environmental impact

    • Example: Amazon Prime offers free two-day shipping and access to streaming services like Prime Video and Music

    • Example: ...

  • Answered by AI
  • Q15. How to make a file mutually exclusive on a shared file system
  • Ans. 

    Use file locking mechanisms like flock or lockfile to make a file mutually exclusive on a shared file system.

    • Use flock or lockfile to acquire a lock on the file before accessing it.

    • Release the lock once the operation is complete.

    • Ensure all processes accessing the file use the same locking mechanism.

    • Example: flock /path/to/file -c 'command to execute'

    • Example: lockfile /path/to/file && command to execute && rm -f /path/t

  • Answered by AI
  • Q16. Tell me about yourself
  • Ans. 

    I am a software developer with 5 years of experience in developing web applications using Java and JavaScript.

    • 5 years of experience in software development

    • Proficient in Java and JavaScript

    • Developed web applications

    • Strong problem-solving skills

    • Experience with agile development methodologies

  • Answered by AI
  • Q17. Negative and positive things in you
  • Ans. 

    Positive: Strong problem-solving skills, Negative: Can be overly critical of own work

    • Positive: Strong problem-solving skills - I excel at breaking down complex problems and finding efficient solutions

    • Negative: Can be overly critical of own work - I tend to be perfectionistic and struggle with accepting imperfections

  • Answered by AI
  • Q18. Discussion about projects.(Deep discussion)
  • Q19. Tell me a situation in your current company when you had a failure in doing a task and What you learnt from it
  • Ans. 

    I had a failure in implementing a new feature due to a lack of understanding of the requirements.

    • I was assigned to develop a new feature for our software application.

    • I misunderstood the requirements and implemented the feature incorrectly.

    • During the testing phase, it was discovered that the feature was not functioning as expected.

    • I took responsibility for the mistake and immediately communicated it to my team lead.

    • I wo...

  • Answered by AI
  • Q20. Replace every element in array with its closest maximum element in right. As amortized analysis was involved he asked for mathematical proof
  • Ans. 

    Replace every element in array with its closest maximum element in right.

    • Iterate through the array from right to left

    • Keep track of the maximum element seen so far

    • Replace each element with the maximum element seen so far

  • Answered by AI
  • Q21. Asked to design distributed Hashtable . Discussed pros and cons
  • Ans. 

    Designing a distributed Hashtable and discussing its pros and cons.

    • Distributed Hashtable is a data structure that stores key-value pairs across multiple nodes.

    • Pros include scalability, fault tolerance, and load balancing.

    • Cons include increased complexity, potential for data inconsistency, and slower performance due to network communication.

    • Examples of distributed Hashtable implementations include Cassandra, Riak, and D

  • Answered by AI
  • Q22. How will you resolve conflicts with your manager
  • Q23. How will you resolve conflicts with your team mates

Interview Preparation Tips

Round: Technical Interview
Experience: After 2 days HR called me for 3 F2F interviews.

Round: Technical Interview
Experience: Given array of stock prices get the date of selling and buying so that profit is maximum.- Discussed various approaches Brute force ,Using heaps, Divide and conquer and optimal solution.
For each approach I wrote the code on white paper and they told to trace it out with example. I have to write production level code with all corner cases.

Round: Technical Interview
Experience: After one week HR called me that I have one more round with s/w developer manager so I went back to HYD.

Round: Technical Interview
Experience: After that I came back to Pune. I went through a lot of thinking.After two days I got a call from HR that feedback is very positive and all the interviewers want you in their team.  and I got an offer.

General Tips: I got interviewed for Amazon Hyderabad for SDE1 position . It was for e-commerce platform team.I want to share my experience so that it can help others. I have 7 months of experience but the vacancy was for 1+ year exp. Guys all the logistics were arranged by Amazon (Including flight tickets+Hotelstay+cab+lunch and dinner). It was an amazing experience.
Skills: Algorithm, Coding, probability
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

18 Questions

  • Q1. Tell me about yourself?
  • Q2. DBMS project discussion
  • Q3. How to merge k sorted arrays of n length and discussion on its complexity?
  • Q4. A question on how to reach to the end of an array based on the values available in the array. Values determine the steps which can be taken forward. complete code for this?
  • Q5. How to identify that if a tree is a bst or not?
  • Ans. 

    To identify if a tree is a BST, check if the inorder traversal of the tree results in a sorted sequence.

    • Perform an inorder traversal of the tree

    • Check if the resulting sequence is sorted in ascending order

    • If yes, the tree is a BST; otherwise, it is not

  • Answered by AI
  • Q6. Discussion about the java project
  • Q7. Shortest path in maze and then discussion on it. Maze was modified into a n-dimension maze. complete code for 2-d maze
  • Q8. Favourite subject and what are you best at
  • Ans. 

    My favorite subject is computer science and I excel in problem-solving and algorithm design.

    • Computer science is my favorite subject because I enjoy coding and creating software applications.

    • I am best at problem-solving, as I have a strong analytical mindset and can efficiently break down complex issues.

    • I excel in algorithm design, as I have a deep understanding of data structures and can optimize code for efficiency.

  • Answered by AI
  • Q9. What is paging. what is virtual memory and discussion on why do we have virtual memory?
  • Ans. 

    Paging is a memory management technique used by operating systems to manage memory more efficiently. Virtual memory is a technique that allows a computer to use more memory than it physically has available.

    • Paging divides memory into fixed-size blocks called pages.

    • Virtual memory allows programs to use more memory than is physically available by temporarily transferring pages of data from RAM to disk.

    • Virtual memory also ...

  • Answered by AI
  • Q10. Inside a system with 4 gb ram OS only uses around 3.2 gb. Why is rest of the memory lying waste?
  • Ans. 

    The remaining memory is not wasted, but reserved for other system processes and applications.

    • The operating system reserves a portion of the RAM for its own processes and functions.

    • The unused memory can be used for caching data, improving system performance.

    • Applications and processes may not require the full amount of RAM at all times.

    • The unused memory can be allocated to other applications when needed.

    • Virtual memory an...

  • Answered by AI
  • Q11. A LONG discussion on implementing a T-9 dictionary in a mobile
  • Q12. An array is given which may be any of the 4 cases a.) completely increasing b.) completely decreasing c.) decreasing then increasing d.) increasing then decreasing. Find max in the array. o(log n) solutio...
  • Q13. No of combinations of moves for knight in chess board are given return total possible positions
  • Ans. 

    Return the total possible positions for a knight on a chess board given the number of combinations of moves.

    • Calculate all possible positions for a knight on a chess board using its unique L-shaped moves.

    • Consider the boundaries of the chess board while calculating the positions.

    • The total possible positions for a knight on a chess board are 64.

  • Answered by AI
  • Q14. Again, Tell me about urself
  • Q15. Little discussion on intern project and then discussion on java project
  • Q16. Multiple requests for storing multiple files on a server. How to keep them mutually exclusive?
  • Ans. 

    Use file locking mechanism to ensure mutual exclusion.

    • Implement file locking mechanism to prevent simultaneous access to files.

    • Use semaphores or mutexes to ensure only one process can access a file at a time.

    • Implement a queue system to handle multiple requests and process them one by one.

    • Use transactional file systems to ensure atomicity of file operations.

    • Implement a timeout mechanism to prevent deadlocks.

    • Consider imp...

  • Answered by AI
  • Q17. Write COMPLETE code for implementing a hash table?
  • Ans. 

    Implementing a hash table in code

    • Choose a hash function to map keys to indices in the table

    • Create an array to hold the values at each index

    • Handle collisions by using a collision resolution strategy

    • Implement methods for inserting, retrieving, and deleting values

    • Consider load factor and resizing the table if necessary

  • Answered by AI
  • Q18. Given a bst. Replace the value in each node with sum of all the nodes which have values greater than the node itself
  • Ans. 

    The given question asks to replace the value in each node of a binary search tree with the sum of all nodes greater than the current node.

    • Traverse the BST in reverse order (right, root, left)

    • Keep track of the sum of all greater nodes encountered so far

    • Update the value of each node with the sum and update the sum

  • Answered by AI

Interview Preparation Tips

General Tips: That was pretty much the interview rounds. Best of luck.
Skills: Algorithm, data structure
College Name: MNIT Jaipur

Skills evaluated in this interview

E-Ring Interview FAQs

How many rounds are there in E-Ring Software Developer interview?
E-Ring interview process usually has 3 rounds. The most common rounds in the E-Ring interview process are Resume Shortlist, HR and Technical.

Tell us how to improve this page.

E-Ring Software Developer Reviews and Ratings

based on 4 reviews

1.9/5

Rating in categories

1.8

Skill development

1.4

Work-life balance

1.8

Salary

1.4

Job security

1.8

Company culture

1.8

Promotions

1.8

Work satisfaction

Explore 4 Reviews and Ratings
Softwaretest Engineer
20 salaries
unlock blur

₹3 L/yr - ₹5.8 L/yr

Software Engineer
8 salaries
unlock blur

₹8 L/yr - ₹16 L/yr

Software Development Engineer
4 salaries
unlock blur

₹10 L/yr - ₹15 L/yr

Testing Support Engineer
4 salaries
unlock blur

₹3 L/yr - ₹4.2 L/yr

Software Testing Engineer
4 salaries
unlock blur

₹3 L/yr - ₹5 L/yr

Explore more salaries
Compare E-Ring with

Amazon

4.1
Compare

Flipkart

4.0
Compare

Snapdeal

3.8
Compare

Paytm

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview