10+ R.K. Azad Interview Questions and Answers

Interview questions for Software Engineer position covering DSA, project-based tech questions, OOPS, and puzzle.

• Be prepared to answer DSA questions such as finding the Nth Fibonacci number with memoization, finding duplicate nodes in a linked list, and binary tree DSA questions.

• Expect project-based tech questions that may require you to explain your approach to solving a particular problem.

• Brush up on OOPS concepts and be ready to apply them to real-world scenarios.

• Be prepare...read more

Query to find 2nd largest salary from Employees

• Use ORDER BY and LIMIT

• Exclude the highest salary using subquery

• Handle cases where there are ties

Shadow DOM is a way to encapsulate the styling and structure of a web component, synthetic events are events created by the browser to mimic real events, and unit testing is a method to test individual units or components of a software.

• Shadow DOM allows for scoped styles and markup within a web component.

• Synthetic events are events like 'click' or 'change' that are created by the browser to simulate user interactions.

• Unit testing involves testing individual units or component...read more

Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.

• Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.

• Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.

• Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.

• Concurrent Hashmap is slower than Hashmap due to the overhead of maintaining thread-safety.

• Use Has...read more

Hashtable is synchronized while hashmap is not.

• Hashtable is thread-safe while hashmap is not.

• Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.

• Hashtable is slower than hashmap due to synchronization.

• Hashtable is a legacy class while hashmap is a newer implementation.

Event Loop is a mechanism in JavaScript that allows for asynchronous operations to be executed in a non-blocking way.

• Event Loop is responsible for handling asynchronous operations in JavaScript.

• It continuously checks the call stack for any functions that need to be executed.

• If the call stack is empty, it checks the callback queue for any pending tasks.

• It moves tasks from the callback queue to the call stack for execution.

• Event Loop ensures that the JavaScript engine is not bl...read more

Object-oriented programming concepts like inheritance, polymorphism, encapsulation, and abstraction.

• Inheritance: Allows a class to inherit properties and behavior from another class.

• Polymorphism: Ability for objects to be treated as instances of their parent class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Abstraction: Hiding the complex implementation details and showing only the necessary features.

Find the second largest number in an array of strings

• Convert the array of strings to an array of integers

• Sort the array in descending order

• Return the second element in the sorted array

Primary key is a unique identifier for a record in a database table.

• Primary key ensures data integrity and helps in faster data retrieval.

• It cannot have null values and must be unique for each record.

• It can be a single column or a combination of columns.

• Examples: employee_id, order_number, customer_id

OOPs concept is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

• OOPs stands for Object-Oriented Programming

• Key concepts include Inheritance, Encapsulation, Polymorphism, and Abstraction

• Example: Inheritance allows a class to inherit properties and behavior from another class

To find the middle element of a linked list

• Traverse the linked list using two pointers - one moving one node at a time and the other moving two nodes at a time

• When the faster pointer reaches the end of the list, the slower pointer will be at the middle element

• If the list has even number of elements, there are two middle elements