nCircle Tech Interview Questions and Answers

Total 5 coding question and few mcqs

Basic to medium questions from leetcode

Q1. Basic details about candidate
Add your answer
Q2. Time complexity
Add your answer
Q3. Binary search time complexity
Ans. 
Binary search has a time complexity of O(log n).
• Binary search is a divide and conquer algorithm.

• It works by repeatedly dividing the search space in half.

• The time complexity is logarithmic because each comparison reduces the search space by half.

• It is efficient for sorted arrays or lists.
Answered by AI
Add your answer

Standard questions that you find on hackerrank

Q1. Questions about project in college. Geometry. C++
Add your answer

Q1. Question about project in college. Geometry. C++ - Oops, pointers Puzzle - cube cutting
Add your answer

Q1. Tell me about yourself. Hobbies.
Add your answer
Q2. How would you plan a hackathon event in company
Add your answer

Javascript and mathematical aptitude

Do leetcode....practice besic oops questions

Based on
1.Technical mcq c,cpp
2.Geometry questions
3. Quant
Time :1:30

5 coding questions
easy to medium
Time:1:30

Q1. Explain Basic OOP's Pillers
Ans. 
OOP's pillars are Abstraction, Encapsulation, Inheritance, and Polymorphism.
• Abstraction: Hiding implementation details and showing only necessary information.

• Encapsulation: Binding data and functions together and restricting access to them.

• Inheritance: Creating new classes from existing ones, inheriting properties and methods.

• Polymorphism: Ability of objects to take on many forms and perform different actions based on ...read more
Answered by AI
Add your answer
Q2. What's Copy Constructor
Ans. 
Copy constructor is a special constructor that creates a new object by copying an existing object.
• It is used to create a new object with the same values as an existing object.

• It takes an object of the same class as a parameter.

• It is used to avoid shallow copy issues.

• Example: MyClass(const MyClass& obj) { //copy constructor code }
Answered by AI
Add your answer
Q3. What's Shallow copy and deep copy? How can you make deep copy?
Ans. 
Shallow copy creates a new object with the same reference as the original, while deep copy creates a new object with a new reference.
• Shallow copy only copies the reference of the original object, while deep copy creates a new object with a new reference and copies the values of the original object.

• In Python, shallow copy can be made using the copy() method, while deep copy can be made using the deepcopy() method from t...read more
Answered by AI
Add your answer
Q4. What's function overriding
Ans. 
Function overriding is a feature in object-oriented programming where a subclass provides a different implementation of a method that is already defined in its superclass.
• It allows a subclass to provide its own implementation of a method that is already defined in its superclass.

• The method in the subclass must have the same name, return type, and parameters as the method in the superclass.

• The method in the subclass can...read more
Answered by AI
Add your answer
Q5. Difference between reference and pointer. L-value and R-value
Ans. 
Reference is an alias to an existing variable while pointer is a variable that stores the memory address of another variable.
• References cannot be null while pointers can be null

• References cannot be re-assigned while pointers can be re-assigned

• L-value refers to the memory location of a variable while R-value refers to the value stored in that memory location
Answered by AI
Add your answer
Q6. Write program to reverse string without extra space Now convert it into recursion
Ans. 
Program to reverse string without extra space using recursion
• Use a recursive function to swap the first and last characters of the string

• Recursively call the function on the remaining substring

• Base case: when the string length is 0 or 1, return the string itself
Answered by AI
View 1 more answer
Q7. Which containers have you used in STL?
Ans. 
I have used vector, deque, list, stack, queue, and priority_queue containers in STL.
• Vector is used for dynamic arrays.

• Deque is used for double-ended queues.

• List is used for doubly linked lists.

• Stack is used for LIFO data structure.

• Queue is used for FIFO data structure.

• Priority_queue is used for priority queues.
Answered by AI
Add your answer

Q1. What are the key concepts of Object-Oriented Programming (OOP)?
Ans. 
Key concepts of OOP include encapsulation, inheritance, polymorphism, and abstraction, which enhance code reusability and maintainability.
• Encapsulation: Bundling data and methods that operate on the data within a single unit (class). Example: A 'Car' class with properties like 'speed' and methods like 'accelerate()'.

• Inheritance: Mechanism to create a new class from an existing class, inheriting its attributes and metho...read more
Answered by AI
Add your answer
Q2. Write a Java program that identifies prime numbers from an array.
Ans. 
This Java program identifies and prints prime numbers from a given array of integers.
• Define a method to check if a number is prime.

• Iterate through the array and use the prime-checking method.

• Store and print the prime numbers found in the array.

• Example input: [2, 3, 4, 5, 6, 7]; Output: [2, 3, 5, 7]
Answered by AI
Add your answer