63 Moons Technologies C Developer Interview Questions and Answers

Q1. Introduce yourself
Ans. 
I am a software developer with 5 years of experience in Java, Python, and SQL.
• 5 years of experience in Java, Python, and SQL

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. What is React and react native
Ans. 
React is a JavaScript library for building user interfaces, while React Native is a framework for building mobile applications using React.
• React is a JavaScript library developed by Facebook for building interactive user interfaces.

• React Native is a framework that allows developers to build mobile applications using React.

• React uses a virtual DOM to improve performance by updating only the necessary components.

• React Na...read more
Answered by AI
Add your answer

Q1. About yourself and background only
Add your answer

Skilled Based Test Done

Programming Language Test

Q1. Based on skills
Add your answer
Q2. Based on experience
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
The task is to determine if a given singly linked list forms a cycle or not.
• A cycle occurs when a node's next points back to a previous node in the list.

• To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.

• The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.

• If there is a cycle, the fast pointer will eventually catch up to the slow pointer.

• If the fast pointer ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Minimum Depth of a Binary Tree
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...read more
Ans. 
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
• The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree

• During the BFS traversal, keep track of the current level and increment the depth by 1 for each level

• Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Answered by AI
Add your answer
Q2. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem is to find the intersection of two sorted arrays.
• Use two pointers to iterate through the arrays.

• Compare the elements at the current pointers and move the pointers accordingly.

• If the elements are equal, add it to the intersection array and move both pointers.

• If the element in the first array is smaller, move the first pointer.

• If the element in the second array is smaller, move the second pointer.

• Repeat until...read more
Answered by AI
Add your answer
Q3. What is the difference between a mutex and a semaphore?
Ans. 
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
• Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.

• Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.

• Mutex has ownership, meaning the thread that locks it must unlock it.

• Semaphore does not hav...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 25 minutes
Round difficulty - Easy

Q1. What are design patterns
Ans. 
Design patterns are reusable solutions to common software design problems.
• Design patterns provide proven solutions to recurring design problems in software development.

• They help in creating flexible, maintainable, and scalable software.

• Design patterns can be categorized into three types: creational, structural, and behavioral.

• Examples of design patterns include Singleton, Observer, Factory Method, and Strategy.

• They pro...read more
Answered by AI
Add your answer

Q1. Table partitioning
Add your answer
Q2. Write a procedure to find and delete duplicates
Ans. 
Procedure to find and delete duplicates in SQL
• Use a SELECT statement with GROUP BY to identify duplicates

• Use a DELETE statement with a subquery to remove duplicates

• Consider using a temporary table to store the duplicates before deletion
Answered by AI
Add your answer

Aptitude test was based on real world scenario

In 50 minutes 3 questions were asked to be solved.
Difficulty from moderate to hard