Turtlemint Key Account Manager Interview Questions, Process, and Tips

Q1. DSA Round & Introduction Round
Add your answer
Q2. DP Question related to subsequence
Add your answer

Q1. Design Parking Lot
Ans. 
Design a parking lot system with multiple levels and spots for cars.
• Create a class for ParkingLot with attributes like levels, spots per level, etc.

• Implement methods for parking a car, removing a car, checking availability, etc.

• Consider implementing a ticketing system for tracking parked cars.

• Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.
Answered by AI
Add your answer
Q2. Sort Numbers with large file
Ans. 
Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.
• Break the large file into smaller chunks that can fit into memory

• Sort each chunk individually using a sorting algorithm like merge sort

• Merge the sorted chunks back together to get the final sorted result
Answered by AI
Add your answer

Q1. Slicing in List of Python
Ans. 
Slicing in Python allows you to extract a subset of elements from a list.
• Slicing is done using square brackets and the start:stop:step notation.

• The start index is inclusive, while the stop index is exclusive.

• You can omit any of the three parameters, defaulting to 0 for start, length of list for stop, and 1 for step.

• Negative indices can be used to slice from the end of the list.

• Example: list = [1, 2, 3, 4, 5], list[1:4]
Answered by AI
Add your answer
Q2. Multithreading questions were asked
Add your answer

Asked Question from Tree nad linked list

Q1. About JWT and SQL query
Add your answer

Duration 1Hr
2 coding questions

Q1. Don't remember the questions
Add your answer
Q2. Don't remember the questions.
Add your answer

Easy level to Medium level

2 Easy questions of DSA

Q1. One DSA question
Add your answer
Q2. Normal discussion about tech stack
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Why do you want to join digit?
Add your answer

Basic coding only not to worry much

Q1. Tell me about ur self
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Excellent team player with good communication skills
Answered by AI
Add your answer
Q2. What is ur projects
Ans. 
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
• Developed a web-based inventory management system using React and Node.js

• Created a mobile app for tracking fitness goals using Flutter

• Implemented RESTful APIs for communication between frontend and backend systems
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

Q1. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure the traversal starts from vertex 0 and follows the BFS order.

• Output the BFS traversal sequence for each test case in a separate line.

• Handle disconnected components by checking for unvisited nodes.

• Consider t...read more
Answered by AI
Add your answer
Q2. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Answered by AI
Add your answer
Q3. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

• Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

• Optimize the solution to avoid redundant calculations by storing intermediate results.

• Time complexity can be reduced to O(N) using dynamic programming.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

Q1. 
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...read more
Ans. 
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
• Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.

• Use a queue to perform level order traversal of the binary tree.

• Store the leftmost node at each level in the result array.

• Return the result array containing the left view of the binary
Answered by AI
Add your answer
Q2. 
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...read more
Ans. 
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
• Perform level order traversal of the binary tree.

• For each level, add the rightmost node to the result.

• Print the result as the right view of the binary tree.

• Handle null nodes represented by -1 in the input.
Answered by AI
Add your answer
Q3. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
• Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

• The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

• Consider edge cases like a single node tree or empty tree while calculating the height.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.