Nsight Inc SQL Developer Interview Questions, Process, and Tips

Aptitude round of 1hr followed by communication round 30mins

Q1. Tell me about yourself
Ans. 
I am a passionate Junior Software Developer with a strong foundation in programming and problem-solving skills.
• Graduated with a degree in Computer Science

• Proficient in languages such as Java, Python, and JavaScript

• Experience with web development projects using HTML, CSS, and React

• Familiar with Agile methodologies and version control systems like Git
Answered by AI
Add your answer
Q2. Tell me about the projects
Ans. 
I have worked on various projects including a web application for tracking inventory and a mobile app for managing tasks.
• Developed a web application using React for tracking inventory levels and generating reports

• Created a mobile app using Flutter for managing tasks and setting reminders

• Collaborated with a team to implement new features and fix bugs in existing projects
Answered by AI
Add your answer

Q1. Was asked to create using React Analog Watch
Add your answer

Q1. Median of a stream
Ans. 
Finding the median of a stream of numbers as they are received
• Keep track of the numbers in a sorted data structure like a min heap and max heap

• Maintain balance between the two heaps to efficiently find the median

• If the total number of elements is odd, median is the middle element. If even, median is the average of two middle elements
Answered by AI
Add your answer

Q1. Longest Valid Parentheses
Ans. 
Find the length of the longest valid parentheses substring in a given string.
• Use a stack to keep track of the indices of opening parentheses.

• Iterate through the string and update the maximum length of valid parentheses.

• Handle cases where closing parentheses are encountered without a matching opening parentheses.
Answered by AI
Add your answer
Q2. Find the maximum number in the subarrays of length k.
Ans. 
Find the maximum number in the subarrays of length k.
• Iterate through the array and keep track of the maximum number in each subarray of length k.

• Use a sliding window approach to efficiently find the maximum number in each subarray.

• Time complexity can be optimized to O(n) using a deque data structure.
Answered by AI
Add your answer

Q1. Spiral Matrix Question
Add your answer

A total time of 1 hour 30 minutes was given for this round, and it was held on the HackerEarth platform.

20 Aptitude questions- logical questions, questions on the diagram, time and train, direction, efficient statement, Venn diagram, few examples of the type of questions:

1. If 2 workers can paint 3 rooms in 4 hours, how many rooms can 1 worker paint in 5 hours

2. If there are 21 blue, 15 black and 17 red ball in a sack, how many minimum ball would you have to remove to ensure that you have removed at least 2 blue ball? (multiple questions of this type can be there)

3. The sum of the 5 numbers in AP is 80. The difference between each is 5. Smallest number?

4. A and B are standing in a row. A is 5th from the left, and B is 13th from the right. After they exchange their positions, A is 11th from left. How many people are in the row?

20 questions on CSE Fundamentals- Questions based on OS - Time Scheduling, Stacks, Find output and error in Java Code, Cpp code and C Code, DBMS, Time complexity, etc.

2 questions based on DSA, out of which you will have to attempt any 1.

For example, the Question was based on the array - in an abandoned city, you are given an array of gold coins, and you have to maximise the number of gold coins while moving in the city and traverse a minimum number of elements in the array.

Q1. 1. ARRAYS, STRINGS AND SORTING: Bubble sort, Complexity of all sorting algorithms.
Add your answer
Q2. 2. Find the first non repeating character in a string
Ans. 
Find the first non-repeating character in a string.
• Create a hash table to store the frequency of each character in the string.

• Iterate through the string and check the frequency of each character.

• Return the first character with a frequency of 1.
Answered by AI
Add your answer
Q3. 3. Remove duplicates from an array
Ans. 
Remove duplicates from an array of strings
• Create a new empty array

• Loop through the original array and check if the element already exists in the new array

• If not, add it to the new array

• Return the new array
Answered by AI
Add your answer
Q4. 4. An array and 2 variables x and y are given, print y sub arrays with x elements.
Ans. 
Print y sub arrays with x elements from given array and variables.
• Use a loop to iterate through the array and create subarrays of x elements.

• Use another loop to print y number of subarrays.

• Handle edge cases where x or y is greater than the length of the array.
Answered by AI
Add your answer
Q5. 5. Explain the function pointer.
Ans. 
A function pointer is a variable that stores the memory address of a function.
• Function pointers allow passing functions as arguments to other functions.

• They can be used to implement callbacks and event handlers.

• Function pointers can be used to implement polymorphism in C.

• Example: int (*funcPtr)(int, int) = &add; where add is a function that takes two integers and returns their sum.

• Function pointers can also be used to
Answered by AI
Add your answer
Q6. 6. Explain copy constructor
Ans. 
Copy constructor creates a new object by copying an existing object.
• Used to initialize an object with another object of the same class

• Takes a reference to an object of the same class as a parameter

• Creates a new object with the same values as the parameter object

• Deep copy and shallow copy are two types of copy constructors
Answered by AI
Add your answer
Q7. 7. Deep copy / Shallow copy
Add your answer
Q8. 8. Characteristics of static function
Ans. 
Static functions belong to the class and not to the instance of the class.
• Can be called without creating an instance of the class

• Cannot access non-static members of the class

• Can access other static members of the class

• Used for utility functions or helper functions
Answered by AI
Add your answer
Q9. 9. What are Abstract classes
Ans. 
Abstract classes are classes that cannot be instantiated and are meant to be extended by other classes.
• Abstract classes are declared using the 'abstract' keyword.

• They can have abstract and non-abstract methods.

• Abstract methods are declared without a body and must be implemented by the subclass.

• Abstract classes can have constructors and instance variables.

• They are useful for creating a common interface for a group of re
Answered by AI
Add your answer

Q1. 1. Explain Trees and Binary Search Trees.
Ans. 
Trees are data structures that store hierarchical data. Binary Search Trees are a type of tree that maintains sorted order.
• Trees are composed of nodes that have a parent-child relationship.

• Binary Search Trees have at most two children per node and the left child is always smaller than the parent while the right child is always larger.

• Binary Search Trees allow for efficient searching, insertion, and deletion operations.

• ...read more
Answered by AI
Add your answer
Q2. 2. Difference between Linked List and Tree (where what should be used).
Ans. 
Linked list is a linear data structure while tree is a hierarchical data structure.
• Linked list is used when we need to maintain a sequence of elements and perform operations like insertion and deletion at any position.

• Tree is used when we need to represent a hierarchical structure and perform operations like searching, insertion, and deletion efficiently.

• Linked list has a single pointer to the next node while tree has ...read more
Answered by AI
Add your answer
Q3. 3. A real-life example of Tree.
Ans. 
A family tree is a real-life example of a tree data structure.
• A family tree has a root node (the oldest ancestor) and branches out to children, grandchildren, etc.

• Each node can have multiple child nodes but only one parent node.

• The tree structure allows for easy visualization of relationships and ancestry.

• Other examples include file systems, organization charts, and decision trees.
Answered by AI
Add your answer
Q4. 4. Some in-depth questions from standard topics like Linked List, trees, etc. will also be asked.
Add your answer

Q1. If a rival company tries to use your code against us what will you do?
Ans. 
I will ensure that our code is properly protected by implementing security measures and legal actions if necessary.
• Implement security measures such as encryption and access control to prevent unauthorized access to our code.

• Monitor for any suspicious activity and take immediate action if any unauthorized access is detected.

• If necessary, take legal action against the rival company for intellectual property theft.

• Collabo...read more
Answered by AI
Add your answer

Q1. Given 9 ball all of which weigh the same except for one, what is the minimum of weighings necessary to find the ball weighs more (or less)?
View 1 more answer

Q1. 1. What are your goals for the next 1 year, your 5-year goals?
Ans. 
To become proficient in new technologies and frameworks, contribute to meaningful projects, and advance my career.
• Learn and master new programming languages, frameworks, and tools

• Contribute to open-source projects and collaborate with other developers

• Improve problem-solving and critical thinking skills

• Advance to a senior or lead developer role

• Stay updated with industry trends and best practices
Answered by AI
Add your answer
Q2. 2. What are the recent challenges you faced in life?
Ans. 
I recently faced the challenge of learning a new programming language and adapting to a new project.
• Learning a new programming language

• Adapting to a new project

• Working with unfamiliar technologies

• Meeting tight deadlines
Answered by AI
Add your answer
Q3. 3. What are your hobbies in life besides coding?
Ans. 
I enjoy playing musical instruments, reading books, and hiking in my free time.
• Playing musical instruments

• Reading books

• Hiking
Answered by AI
Add your answer
Q4. 4. Why do you want to join this company?
Ans. 
I want to join this company because of its strong reputation in the industry and its commitment to innovation.
• Strong reputation in the industry

• Commitment to innovation

• Opportunity for professional growth

• Positive work culture

• Exciting projects and challenges
Answered by AI
Add your answer
Q5. 5. What work does our company do?
Ans. 
Our company provides backend development services for various industries.
• We develop and maintain backend systems for clients

• We specialize in creating scalable and efficient APIs

• Our work involves database management and optimization

• We collaborate with frontend developers to ensure seamless integration

• We follow industry best practices and stay updated with the latest technologies
Answered by AI
Add your answer

Medium level problems

Medium react js question

Q1. Nothing technical but just asked if i know django and python
Add your answer

Q1. About dsa like sorting algorithm
Add your answer
Q2. Indexing in databases
Ans. 
Indexing in databases improves query performance by allowing faster retrieval of data.
• Indexes are data structures that improve the speed of data retrieval operations on a database table.

• They work by creating a sorted list of specific columns in a table, allowing the database to quickly locate the rows that match a query.

• Examples of indexes include primary keys, unique keys, and composite indexes.

• Indexes can be created ...read more
Answered by AI
Add your answer
Q3. Multithreading and multiprocessing
Add your answer

Q1. Projects i did, in different orgs
Ans. 
I have worked on various projects in different organizations, showcasing my versatility and adaptability.
• Developed a customer management system for a retail company, improving efficiency and customer satisfaction.

• Implemented a data analytics platform for a marketing agency, enabling data-driven decision making.

• Collaborated on a team to create a real-time messaging application for a tech startup, enhancing communication
Answered by AI
Add your answer
Q2. Notifications system
Add your answer
Q3. Different datastructures and indexing problems and there solution
Ans. 
Different data structures like arrays, linked lists, trees, graphs, and their indexing problems and solutions.
• Arrays: indexing is O(1), but insertion/deletion at arbitrary position is O(n)

• Linked Lists: indexing is O(n), but insertion/deletion at arbitrary position is O(1)

• Trees: indexing depends on the type of tree (e.g. binary search tree, AVL tree)

• Graphs: indexing can be done using adjacency lists or matrices

• Hash Tabl...read more
Answered by AI
Add your answer
Q4. Merge sort code
Add your answer

Q1. Os cn and memory allocation related questions
Add your answer

Zeta interview at codeblock. 3 dsa questions The level of difficulty was medium