Landmark Group Java Developer Interview Questions and Answers

Coding questions on String and HashMap

Q1. Laravel based questions
Add your answer

Q1. Basic questions
Add your answer

2 coding questions from dsa. one quest was from trees ds

Q1. Why did you choose target
Add your answer
Q2. Minus points in you that you can share with us
Add your answer

2 DSA questions and some MCQ on Java and Spring

Q1. Longest palindromic substring
Ans. 
A palindromic substring is a string that reads the same forwards and backwards.
• Use dynamic programming to find the longest palindromic substring.

• Start by considering each character as the center of a potential palindrome.

• Expand outwards from each center to check for palindromes of odd and even lengths.
Answered by AI
Add your answer
Q2. Remove duplicates in place from a 1D array
Ans. 
Remove duplicates from a 1D array of strings in place
• Iterate through the array and use a HashSet to keep track of unique elements

• Replace duplicates with null or an empty string to remove them in place
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Search min element in a rotated sorted array with duplicate elements
Ans. 
Search for the minimum element in a rotated sorted array with duplicate elements.
• Use binary search to find the minimum element in the rotated sorted array.

• Handle the case where duplicate elements are present by adjusting the search conditions.

• Consider cases where the array is not rotated or contains only one element.
Answered by AI
Add your answer
Q3. Ways of declaring singleton class
Ans. 
A singleton class is a class that can only have one instance created throughout the application.
• Declare a private static instance variable of the class

• Create a private constructor to prevent external instantiation

• Provide a public static method to access the instance
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Behavioural questions
Add your answer

Q1. Kafka , heap stack
Add your answer
Q2. Mvc endpoint creation
Add your answer

Q1. Dsa on string please
Add your answer
Q2. Heap
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .

Q1. 
Encode the Message Problem Statement
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...read more
Add your answer
Q2. 
Make All Elements of the Array Distinct
Given an array/list ARR of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...read more
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .

Q1. 
Distinct Characters Problem Statement
Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
Example:
Input:
STR = ...read more
Add your answer
Q2. 
Calculate Score of Balanced Parentheses
In this intellectual game, Ninja is provided with a string of balanced parentheses called STR. The aim is to calculate the score based on specific game rules. If Nin...read more
Add your answer
Q3. Can you explain demand paging?
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .

Q1. 
Binary Tree Construction from Traversals Problem
Given the POSTORDER and PREORDER traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...read more
Add your answer
Q2. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Add your answer
Q3. Can you explain the concepts of static and dynamic polymorphism in Object-Oriented Programming?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why should we hire you?
Add your answer
Q2. What do you know about the company?
Add your answer

Q1. Why string arr immutable
Ans. 
String arrays are immutable because they cannot be changed once created.
• Strings in an array cannot be modified individually

• Any changes to a string array result in a new array being created

• Immutable arrays ensure data integrity and prevent unintended side effects
Answered by AI
Add your answer
Q2. How we can create a custom immutable class
Ans. 
To create a custom immutable class, use final keyword for class, private final fields, and no setter methods.
• Use the final keyword for the class to prevent inheritance

• Declare all fields as private and final to prevent modification

• Do not provide setter methods for the fields to maintain immutability

• Provide getter methods to access the fields
Answered by AI
Add your answer