Global Logica Software Technologies Java Developer Interview Questions and Answers

DSA

About Social changes

Q1. Tell me about yourself.
Add your answer
Q2. Very basic questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

Q1. 
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...read more
Ans. 
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of unique paths at each cell.

• Initialize the first row and first column with 1 as there is only one way to reach them.

• For each cell (i, j), the number of unique paths is the sum of paths...read more
Answered by AI
Add your answer
Q2. 
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...read more
Ans. 
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
• Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

• Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

• The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

Q1. 
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...read more
Ans. 
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
• Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

• Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

• Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the element pointed to by the slow pointer
Answered by AI
Add your answer

Online aptitude test with general aptitude questions.

Q1. Basic js, ES6 features, Angular Questions, Node.js Lifecycle, event loop, mongodb questions, some HR questions
Add your answer

Coding test time limit is 60 minutes it is moderate

Q1. Find the missing number in an given array
Ans. 
Identify the missing number in a sequence using mathematical formulas or iterative methods.
• Use the formula for the sum of the first n natural numbers: n(n + 1)/2.

• Calculate the expected sum and subtract the actual sum of the array.

• Example: For array [1, 2, 4], expected sum for n=4 is 10, actual sum is 7, missing number is 10-7=3.

• Alternatively, use a boolean array to track presence of numbers.
Answered by AI
Add your answer

There were 3 to 4 questions related to the camera that needed to be solved within the given time.

Q1. Postmortem of Hashmap
Add your answer
Q2. Locking mechanism in multithreading
Ans. 
Locking mechanism in multithreading is used to control access to shared resources by multiple threads.
• Locks are used to prevent multiple threads from accessing shared resources simultaneously

• Types of locks include synchronized blocks, ReentrantLock, and ReadWriteLock

• Locks help prevent race conditions and ensure data consistency in multithreaded applications
Answered by AI
Add your answer
Q3. Find highest salaried emp from each dept
Ans. 
Use SQL query to group by department and find employee with highest salary in each department
• Write a SQL query to group by department and select max salary for each department

• Join the result with employee table to get employee details

• Example: SELECT dept, emp_name, MAX(salary) FROM employees GROUP BY dept
Answered by AI
Add your answer
Q4. Sorting algorithms
Add your answer

Hackearth online coding test for 1 hour

Q1. Dsa question and output questions
Add your answer
Q2. Find k largest element in an array
Ans. 
Use sorting or heap data structure to find k largest elements in an array of strings.
• Sort the array in descending order and return the first k elements.

• Use a max heap data structure to efficiently find the k largest elements.

• Examples: ['apple', 'banana', 'orange', 'kiwi'], k=2 -> ['orange', 'kiwi']
Answered by AI
Add your answer

Q1. Remove duplicates from array
Ans. 
Remove duplicates from array of strings
• Create a Set to store unique strings

• Iterate through the array and add each string to the Set

• Convert the Set back to an array to get the unique strings
Answered by AI
Add your answer
Q2. Output related questions on student class object
Add your answer

6 question , 2 coding questions

Q1. Coding question ds min platforms
Ans. 
Calculate the minimum number of platforms required for a train station given arrival and departure times.
• Sort arrival and departure times.

• Use two pointers to track platforms needed at any time.

• Increment platform count on arrival and decrement on departure.

• Example: For arrivals [10:00, 10:15] and departures [10:30, 10:45], 1 platform is needed.
Answered by AI
Add your answer
Q2. SQL question students table
Add your answer

1st Round was Written Coding test Q> Next Palindrome, Q> ATM machine design Q> SQl query Q> Elephant and banana Prime number Story base question

Q1. Find the Next Palindrome
Ans. 
A program to find the next palindrome number after a given number.
• Convert the given number to a string to easily manipulate individual digits.

• Increment the number by 1 and check if it is a palindrome.

• If not a palindrome, repeat the process until a palindrome is found.
Answered by AI
Add your answer
Q2. Prime number optimisation and why ?
Ans. 
Optimizing prime number algorithms is crucial for efficient computation in software development.
• Optimizing prime number algorithms can improve the performance of applications that rely on prime numbers, such as cryptography or number theory.

• Efficient algorithms like the Sieve of Eratosthenes can significantly reduce the time complexity of finding prime numbers.

• Using techniques like memoization or dynamic programming ca...read more
Answered by AI
Add your answer