Landmark Group Senior Software Developer Interview Questions and Answers

3 sum problem was asked to complete

Take home project to design app

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

Q1. Vanilla JS questions.
Add your answer

Q1. Basic React questions
Add your answer

Q1. Past experiences and projects
Add your answer

There was a aptitude test with coding problems

Q1. Basic Puzzles were asked
Add your answer

Array and Linkedlist related questions

Q1. Oops concepts, DBMS, questions related to personal projects
Add your answer
Q2. The ones i remember- Dbms: What is normalization? Different forms of normalization. Some joins related questions. Oops: access modifiers, abstract classes
Ans. 
Questions on DBMS and OOPs concepts
• Normalization is the process of organizing data in a database to reduce redundancy and dependency.

• Different forms of normalization include 1NF, 2NF, 3NF, BCNF, and 4NF.

• Join is used to combine rows from two or more tables based on a related column between them.

• Access modifiers in OOPs are public, private, protected, and default.

• Abstract classes are classes that cannot be instantiated a
Answered by AI
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

Round duration - 120 minutes
Round difficulty - Medium

This was the online round held at Hackerearth. All students who met the eligibility criteria were shared link for the online test on hackerearth.

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string str of size N, your task is to recursively remove consecutive duplicates from this string.
Input:
T (number of test cases)
N (length of the ...read more
Ans. Recursion
The idea is here to use recursion as mentioned in the problem statement. For each character either it will be included in the answer or not, how to decide this at each point?
We will compare the last and 2nd last character of the string each time if they are equal we will remove the last and call recursion for the remaining string, if they both are not equal then we will append the last character into our final...read more
Answered Anonymously
Add your answer
Q2. 
Deepest Leaves Sum Problem Statement
Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes present at the deepest level of this binary tree. If there are no such nodes, ...read more
Ans. Find Deepest Level
The idea is pretty simple. First, we will find the deepest level of the given binary tree, say ‘maxDepth’. We can do this with a single traversal of the binary tree. 

After finding the deepest level of the binary tree, we will again traverse the given tree. Also, we will maintain a ‘sum’ and ‘currLevel’ variable for each node in the tree. Whenever the ‘currLevel’ which represents the level of the ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems.There were 2 interviewers. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Palindrome Permutation - Problem Statement
Determine if a permutation of a given string S can form a palindrome.
Example:
Input:
string S = "aab"
Output:
"True"
Explanation:
The permutation "aba" o...read more
Ans. Frequency Table
1. The idea behind this approach is that in a palindrome at max 1 character can have an odd frequency.
2. So in this approach, we calculate the frequency of each character of the given string and check if at most 1 character has an odd frequency. If more than one character will be having the odd frequency then the given string can not be converted into a palindrome.
3. Therefore, we create a frequency table, (say ‘...read more
Answered Anonymously
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Ans. Brute Force
The basic idea of this approach is to check each word of the given sentence ‘S’ if it matches with the given word ‘W’.

 
Consider the following steps:
1. Start iterating through each character of sentence string ‘S’ using a variable ‘i’ such that 0 <= ‘i’ < |S|
   • Create a string “temp” which stores the current word.
   • Add all the subsequent characters of the sentence till space is detected or if all end of th...read more
Answered Anonymously
Add your answer

Round duration - 30 mintues
Round difficulty - Easy

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