Global Infrasolutions Interview Questions and Answers

Using Java 8 Stream, find and print the name of the student with the second highest marks.

• Sort the students based on marks in descending order

• Skip the first student (highest marks) and find the second student

• Print the name of the second student

Return the kth element from the end of a linked list

• Traverse the linked list to find the length of the list

• Calculate the position of the kth element from the beginning

• Traverse the list again to find the kth element from the end

Iterate and insert values into a hashSet in Java

• Create a HashSet object

• Use a for loop to iterate over the elements to be inserted

• Call the add() method on the HashSet object to insert each element

Redux is a predictable state container for JavaScript apps. Hooks are a new addition in React 16.8 that lets you use state and other React features without writing a class.

• Redux is a state management tool commonly used with React to manage application state in a predictable way

• Hooks are a new addition in React 16.8 that allow you to use state and other React features without writing a class

• Examples of hooks include useState, useEffect, useContext, etc.

A collection is a group of objects or data structures that are stored and manipulated together.

• Collections can be used to store and manage multiple elements of the same type.

• Examples of collections include arrays, lists, sets, and maps.

• Collections provide methods for adding, removing, and accessing elements within the group.

OOPS concepts are fundamental to object-oriented programming. They include inheritance, encapsulation, abstraction, and polymorphism.

• Inheritance allows a class to inherit properties and methods from another class.

• Encapsulation is the practice of hiding data and methods within a class, so they can only be accessed through public methods.

• Abstraction is the process of simplifying complex systems by breaking them down into smaller, more manageable parts.

• Polymorphism allows object...read more

Hash map is a data structure that stores key-value pairs and allows for efficient retrieval of values based on keys.

• Hash map uses a hash function to map keys to indices in an array.

• Collision handling is important in hash maps to deal with multiple keys hashing to the same index.

• Common operations on hash maps include insertion, deletion, and lookup.

• Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 123); int value = map.get("key");