Coditas Technologies Software Trainee Interview Questions and Answers

Q1. Basic questions regarding Python e.g. magic functions, constructor in python, list, tuple
Add your answer
Q2. Basic questions regarding FastAPI e.g. what is pydantic, ORM usage, BaseModel etc.
Add your answer
Q3. Basic questions regarding SQL e.g. No-SQL vs SQL, Indexing,
Add your answer

Q1. What are the modules worked on Facets?
Add your answer
Q2. What is Dental claim processing?
Add your answer

Q1. What is your work experience
Ans. 
I have 5 years of experience working as a software engineer in various industries.
• Developed web applications using Java, Spring, and AngularJS

• Led a team of developers in a successful project delivery

• Implemented CI/CD pipelines to automate software deployment

• Worked on improving system performance and scalability
Answered by AI
Add your answer
Q2. Is working timing flexible
Add your answer

Q1. Qs related to javascript
Add your answer

Q1. Why should we hire you
Add your answer

Sorting algo , array question

Q1. Oops dbms coding basics
Add your answer

Q1. Deep Technical Questions
Add your answer
Q2. Problem solving and usecases
Add your answer

Q1. Usecase based questions
Add your answer

Coding questions on Javascript

Q1. Coding questions were asked
Add your answer

90 minute test on hacker rank consisting of 3 coding questions all of medium difficulty. Most candidates are required to solve more than 1 question.

Q1. Questions on concepts of OOPS and Operating Systems.
Add your answer
Q2. Find least common ancestor of a binary tree.
Ans. 
Find the lowest common ancestor of a binary tree.
• Traverse the tree recursively from the root node.

• If the current node is null or matches either of the given nodes, return the current node.

• Recursively search for the nodes in the left and right subtrees.

• If both nodes are found in different subtrees, return the current node.

• If both nodes are found in the same subtree, continue the search in that subtree.
Answered by AI
Add your answer
Q3. Find first missing positive integer from an array for non-negative integers.
Ans. 
Find first missing positive integer from an array of non-negative integers.
• Create a hash set to store all positive integers in the array

• Loop through the array and add all positive integers to the hash set

• Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Answered by AI
Add your answer

Q1. Design a parking lot
Ans. 
Design a parking lot
• Consider the size and capacity of the parking lot

• Decide on the layout and organization of parking spaces

• Implement a system to manage parking availability and reservations

• Include features like ticketing, payment, and security

• Consider scalability and future expansion
Answered by AI
Add your answer

Q1. Given a grid which represents an ocean( For all index i,j if mat[i][j] = 1 is island and mat[i][j] = 0 means water). Find the island with largest area.
Add your answer
Q2. Given list of strings group them into distinct anagrams.
Ans. 
Group list of strings into distinct anagrams.
• Create a hash table with sorted string as key and list of anagrams as value.

• Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.

• Return the values of the hash table as a list of lists.
Answered by AI
Add your answer