eClerx Python Developer Interview Questions and Answers

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

Q1. 
Author and Books Formatting
Given a structured list of books and their authors, format the information as specified.
Input:
The first line of input contains an integer ‘T' representing the number of tes...read more
Ans. 
The task is to format a list of authors and their books in a specific way as per the given input format.
• Parse the input to extract the number of test cases, number of authors, author names, and their respective books.

• Format the output by printing the author names and their books in the specified format.

• Ensure correct sequence and labeling of authors and books as per the example provided.

• Handle multiple test cases and a...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Ans. 
Implement a function to delete a node from a linked list at a specified position.
• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases such as deleting the head or tail of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.

• Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.

• If the graph has connected components, color each co...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Test was active from 28th September 8 PM till 2 AM (29th September’20). We could attempt at any time. 
1.5 Hr Duration
Two coding questions.

Q1. 
Cycle Detection in Undirected Graph Problem Statement
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...read more
Ans. 
Detect cycles in an undirected graph.
• Use Depth First Search (DFS) to detect cycles in the graph.

• Maintain a visited array to keep track of visited vertices.

• If a visited vertex is encountered again during DFS, a cycle exists.

• Check for cycles in each connected component of the graph.

• Consider edge cases like disconnected graphs and self-loops.
Answered by AI
Add your answer
Q2. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use depth-first search (DFS) to traverse the matrix and identify connected groups of 1s.

• Maintain a visited array to keep track of visited cells to avoid redundant traversal.

• Increment the island count each time a new island is encountered.

• Consider all eight possible directions for connectivity while traversing the matrix.

• Handle edge cases such as out-of-bounds indi...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Online video call round on Microsoft Teams
Interviewer was very friendly.
This round is often called Domain Discussion Round.

Q1. 
Longest Repeating Substring Problem Statement
Given a string str consisting of lowercase English alphabet letters, and an integer K, you are allowed to perform at most K operations on this string. An oper...read more
Ans. 
Find the length of the longest substring consisting of repeating characters after performing K operations.
• Iterate through the string and maintain a sliding window of characters.

• Keep track of the frequency of characters in the window.

• Update the window by changing characters to maximize the length of repeating substring.

• Return the length of the longest repeating substring obtained.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

One hour HR round.
Also called Core Values Interview.
The Interviewer was a senior level employee and was very friendly.