SpectraMedix Software Developer Interview Questions and Answers

C,c++ questions and two coding questions. basic mcq

Q1. Treeset, hashset difference
Ans. 
TreeSet and HashSet are both implementations of the Set interface in Java, but they have some key differences.
• TreeSet is a sorted set that maintains elements in ascending order, while HashSet does not guarantee any specific order.

• TreeSet uses a Red-Black tree data structure for storage, which allows for efficient retrieval of elements in sorted order.

• HashSet uses a hash table for storage, which provides constant-time p...read more
Answered by AI
Add your answer
Q2. Oops concept, dbms, programming questions
Add your answer
Q3. Set and treeset and hashset
Add your answer

Q1. Oops related insharitance encapsulation
Add your answer

Q1. React hooks, Explain using code
Ans. 
React hooks are functions that let you use state and other React features without writing a class.
• Hooks are functions that let you use state and other React features in functional components

• useState() is a hook that allows you to add state to functional components

• useEffect() is a hook that allows you to perform side effects in functional components

• useContext() is a hook that allows you to use the context API in functio
Answered by AI
Add your answer
Q2. Factory Patterns?
Add your answer
Q3. Liskov Substitution Principle
Ans. 
Liskov Substitution Principle states that objects of a superclass should be replaceable with objects of its subclasses without affecting the program's correctness.
• Subtypes must be substitutable for their base types.

• Derived classes must be able to replace their base classes without affecting the program's behavior.

• Violating this principle can lead to unexpected behavior and errors in the code.

• Example: If a program expec...read more
Answered by AI
Add your answer
Q4. Oops Concept and give examples
Ans. 
Oops concept is a programming paradigm that focuses on objects and classes.
• Oops stands for Object-Oriented Programming

• Key concepts include inheritance, encapsulation, polymorphism, and abstraction

• Examples: Class Car with properties like make, model, and methods like start(), stop()

• Example: Inheritance - Class SUV extends Car and adds property numSeats
Answered by AI
Add your answer
Q5. JQuery - Ajax mechanisms
Add your answer
Q6. Docker and Kubernetes - Azure concepts
Add your answer

Computer fundamentals

Q1. Technical questions of projects ,dsa
Add your answer

Q1. What is ur background
Add your answer
Q2. Manegarial and behavioral questions
Add your answer

Q1. Difference b/w full and partial selectors
Ans. 
Full selectors select all descendants of a specified element, while partial selectors select only direct children.
• Full selectors use a space between the parent and child elements, while partial selectors use the > symbol.

• Full selectors are more general and can target multiple levels of descendants, while partial selectors are more specific and target only direct children.

• Example of full selector: div p selects all

  ele...read more
Answered by AI
Add your answer
Q2. What is Screen scraping and data scraping
Ans. 
Screen scraping is extracting data from a website's HTML code, while data scraping is extracting data from various sources.
• Screen scraping involves extracting data from the visual representation of a website, usually using automation tools like web scrapers.

• Data scraping involves extracting data from various sources such as databases, APIs, and documents.

• Both screen scraping and data scraping are used to collect and an...read more
Answered by AI
Add your answer

Q1. Big data Architecture
Add your answer

Q1. Data modeling questions
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

30 Aptitude problems and two coding questions

Q1. 
Count Inversions Problem Statement
Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...read more
Ans. 
This problem is classic problem known as inversion count. I solved this problem using merge sort tree and got full points if we apply brute force on this then we will get time limit exceeded so we have to solve this in O(nlogn) complexity.
Answered Anonymously
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
This problem in know as kadane's algorithm i solved this one using single for loop and passed successfully all the test cases.
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Data structure and algorithms plus object oriented problems

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Step 1 : I wrote first merge sort algorithm then i explained the worst case complexity for this one.
Step 2 : Interviewer cross questioned me what is divide and conquer approach.
Step 3 : I gave the definition for divide and conquer method
Step 4 : Then I continued explaining quick sort algorithm
Step 5 : Interviewer asked me about worst case scenario for quick sort then i replied when the array is already sorted he was ha
Answered Anonymously
Add your answer
Q2. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Ans. 
Step 1 : I wrote all condition for deletion in linked list first from the beginning of the linked list then between linked list and then deleting last node for linked list
Step 2 : Interviewer asked about complexity for each of them i replied for all three cases.
Step 3 : Then i explained it using diagram how we are implementing this algo
Step 4 : He found an error in my code when we have only one node
Step 5 : I resolved
Answered Anonymously
Add your answer

Round duration - 60 miinutes
Round difficulty - Easy

Database questions and discussion about projects

Q1. What is a normal form in database management systems, and can you explain Boyce-Codd Normal Form (BCNF)?
Ans. 
Tip 1 : Do clear your concept of basic dbms topics like functional dependency and normal forms
Tip 2 : Do practice on Sql commands
Tip 3 : Read examples on each normal forms
Answered Anonymously
Add your answer
Q2. What is the difference between the 'WHILE' keyword and the 'HAVING' keyword in SQL?
Ans. 
Tip 1 : Do practice on sql commands
Tip 2 : Read about concepts of Sql like primary key candidate key foreign key
Tip 3 : Read concepts like DDL,DML,DCL
Answered Anonymously
Add your answer