uCertify Software Developer Intern Interview Questions and Answers

Basic aptitude test, 2 coding questions based on arrays. One was easy other was hard

Q1. Tell me about arrays
Ans. 
Arrays are a data structure that stores a collection of elements of the same data type in contiguous memory locations.
• Arrays have a fixed size determined at the time of declaration.

• Elements in an array are accessed using an index starting from 0.

• Arrays can store primitive data types or objects.

• Example: String[] names = {"Alice", "Bob", "Charlie"};
Answered by AI
Add your answer
Q2. How does a linked list function
Ans. 
A linked list is a data structure where each element points to the next element in the sequence.
• Each element in a linked list, called a node, contains data and a reference to the next node in the sequence.

• Linked lists can be singly linked (each node points to the next node) or doubly linked (each node points to both the next and previous nodes).

• To traverse a linked list, you start at the head node and follow the refere...read more
Answered by AI
Add your answer

Basic Aptitude test

Coding Round is little tough.

Q1. Formal conversation about the projects and all that kind of stuff
Add your answer
Q2. What kind of project you have worked on
Add your answer
Q3. How you tackles different project
Add your answer

Q1. SOLID design principles and Design Patterns use cases
Ans. 
SOLID design principles and Design Patterns are used to create maintainable and scalable software.
• SOLID principles help in creating loosely coupled and modular code.

• Design Patterns provide reusable solutions to common software problems.

• Examples of SOLID principles include Single Responsibility, Open/Closed, and Liskov Substitution.

• Examples of Design Patterns include Factory, Singleton, and Observer.

• Using SOLID principl...read more
Answered by AI
Add your answer
Q2. Problem-solving discussion, OOPs questions
Add your answer

2 questions, problem-solving, easy to medium difficulty.

Q1. Questions on work done in the previous company, challenges faced and resolution, C# conceptual questions
Add your answer
Q2. WEB API concepts, Entity Framework concepts, .Net Framework concepts
Add your answer

Q1. General discussion on work done in the previous company, challenges faced, what are your expectations from the role and why you want to join the company.
Add your answer

Q1. General HR discussion with salary negotiation.
Add your answer

Basics of JavaScript and HTML and CSS

Q1. All about JavaScript
Add your answer

Q1. In- detail about JavaScript and logical ability questions
Add your answer

Login/signup and to do list using react.js

Q1. Basic questions about family and all
Add your answer

Q1. 1. Coding best practices 2. Writing basic code snippets
Add your answer

Q1. 1. Current projects and challenges
Add your answer

Q1. 1. Release management
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing (10 am- 11 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 45 minutes.

Q1. Connect n ropes with minimum cost
You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. W...read more
Ans. Brute Force Approach
Clearly, the rope which is picked up first will be having its length included more than once in the final cost. If we pick a rope of larger length earlier, then we will be adding some extra cost to our final result.
So, the idea is to pick ropes of smaller lengths initially to minimize the impact on our final cost.
So, each time we will be finding two smallest ropes, connecting them and
adding the resu...read more
Answered by CodingNinjas
View 1 more answer
Q2. Validate BST
You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.
A binary search tree (BST) is a binary tr...read more
Ans. BST property
The approach is based on the fact that the value of each node in a BST is greater than the value of all the nodes in the left subtree and smaller than the value of all the nodes in the right subtree.
 
Here is the complete algorithm-
• For each node, we store the minimum and maximum value allowed for that node. Initially, for the root node, the minimum value would be -10^9 and the maximum value should be 10...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 minutes
Round difficulty - Medium

This round was on call where I was just supposed to answer the HRquestions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 10-15 questions were asked and I probably answered 90% of them correctly.

Q1. Basic HR Questions
Assume you are hired, then how long would you expect to work for us?
How would you rate yourself on a scale of 1 to 10?
Ans. 
Tip 1 : Try answering in an optimistic manner
Tip 2 : relating the real life examples to support your points will be very helpful
Tip 3 : putting all the energy and showing the enthusiasm is also very important
Answered by CodingNinjas
Add your answer