Landmark Group Senior Software Developer Interview Questions and Answers

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

3 sum problem was asked to complete

Take home project to design app

Q1. Array, Tree based questions
Add your answer

Q1. Managerial round with a dive into the projects
Add your answer

Q1. Laravel based questions
Add your answer

Q1. Basic questions
Add your answer

Q1. Linked List Intersection Point
Ans. 
Find the intersection point of two linked lists.
• Use two pointers to traverse the linked lists

• Calculate the difference in length between the two lists

• Move the pointer of the longer list ahead by the difference

• Move both pointers simultaneously until they meet at the intersection point
Answered by AI
Add your answer
Q2. Basic Spring Boot
Add your answer
Q3. Stream and Java 8 Questions
Add your answer

There was a aptitude test with coding problems

Q1. Basic Puzzles were asked
Add your answer

Q1. DSA questions and basics on the platform of work
Add your answer
Q2. Self explanatory and Experience related questions
Add your answer

1.Sum numbers in linked list
2. Maximum sum subarray

Q1. Design and code hashmap.
Ans. 
Implement a hashmap data structure in code.
• Use an array to store key-value pairs

• Implement a hash function to map keys to indices in the array

• Handle collisions using techniques like chaining or open addressing
Answered by AI
Add your answer
Q2. Questions on kafka
Add your answer

Q1. Design linked in
Ans. 
Design a platform similar to LinkedIn for professional networking.
• Create user profiles with work experience, education, skills, and endorsements.

• Allow users to connect with others, join groups, and follow companies.

• Include features like job postings, messaging, news feed, and recommendations.

• Implement algorithms for personalized content and job suggestions.

• Ensure data privacy and security measures are in place.
Answered by AI
Add your answer