i
Landmark Group
Filter interviews by
IT WAS GOOD MOSTLY FOCUS IS ON BASICS OF PYTHON LINKDEDLIST
You should hire me because of my extensive experience in application development, strong problem-solving skills, and ability to work well in a team.
Extensive experience in application development, including X years working with various technologies such as Java, Python, and SQL
Strong problem-solving skills demonstrated through successful completion of complex projects, such as developing a new feature that improved use...
I rate my interview experience as positive and insightful.
I found the questions to be challenging and relevant to the role
The interviewers were professional and engaged in meaningful conversation
Overall, I felt that the interview process was well-organized and gave me a good understanding of the company and the position
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
Use dynamic programming to keep track of maximum stolen money at each house.
Consider two cases: either rob the current house and skip the next, or skip the current house.
Handle circular arrangement by considering the first and last houses separately.
Example: For arr[] = {2, 3, 2}, the output is 3. Rob...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .
You are provided with two linked lists, L1
and L2
, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
Traverse both linked lists simultaneously to find common elements
Create a new linked list to store the intersecting elements
Ensure the final linked list is sorted in ascending order
Handle cases where there are no common elements between the lists
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
Find the Kth largest element in a given list of numbers.
Sort the array in descending order.
Return the Kth element from the sorted array.
Handle multiple test cases efficiently.
Round duration - 50 Minutes
Round difficulty - Easy
This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
Use a combination of HashMap and ArrayList to achieve constant time operations.
For insert operation, add the element to the ArrayList and store its index in the HashMap.
For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accesse
Round duration - 45 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Design a Railway Reservation System
Create a database to store train schedules, seat availability, and passenger information
Implement a user interface for users to search for trains, book tickets, and view their reservations
Include features like seat selection, payment processing, and ticket confirmation
Handle scenarios like waitlisting, cancellations, and refunds
Ensure data security and privacy of passenger information
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
Java code is compiled into bytecode, which can run on any platform with a JVM.
JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.
The JVM ...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
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...
Find the minimum cost to buy a specific weight of oranges using given cost list.
Iterate through the cost list and find the minimum cost to achieve the desired weight
Keep track of the minimum cost while considering available packet weights
Return -1 if it is not possible to buy exactly W kg of oranges
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result if true.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will burn faster than the other.
Measure the time it takes for the faster burning wire to completely burn.
Calculate the specific amount of time by using the ratio of the lengths of the two wires.
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.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Dec 2020.
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 of easy to medium level I would say with some lenghty implementations .
Given an array 'ARR'
consisting of N
integers, along with two integers, 'SUM'
and 'MAXVAL'
, you need to determine the minimum number of integers to be added to t...
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
Iterate through the array and calculate the current sum.
Determine the difference between the target sum and the current sum.
Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
Given an array of integers NUMS
consisting of N
integers and an integer K
, determine the maximum sum of an increasing subsequence with exactly K
elements.
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.
For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.
Update the dynamic programming table with the maximum sum found...
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
Traverse the binary tree level by level and check if all levels are completely filled except the last one.
Ensure all nodes at the last level are positioned at the leftmost side.
Use level order traversal to check for completeness of the binary tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
Given an array arr
of N
non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
The first line of inp...
Check if an array of integers consists of consecutive numbers.
Iterate through the array and check if the absolute difference between consecutive elements is 1.
Sort the array and check if the elements are consecutive.
Use a set to store the elements and check if the size of the set is equal to the length of the array.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
Divide the range of numbers (1-100) among the threads to avoid duplication.
Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.
Consider using a shared data structure like a queue to coordinate the threads.
Implement a mechanism to signal the threads when to start and stop printing.
Views in a database management system provide data security, simplify complex queries, and improve performance.
Enhanced security by restricting access to certain columns or rows
Simplify complex queries by pre-defining joins and filters
Reduce redundancy by storing commonly used queries as views
Improve performance by storing pre-processed data in views
Allow for data abstraction, making it easier to work with complex data
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.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Other and was interviewed before Nov 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based)
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.
Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.
Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.
Implement matrix exponentiation to calculate Fibonacci numbers efficiently.
Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.
Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.
Optimize the solution to achieve better than O(N) time complexity.
Round duration - 40 minutes
Round difficulty - Medium
It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
Determine whether two given strings, A
and B
, both of length N
, are similar by returning a 1 if they are, otherwise return a 0.
String A
is similar to stri...
Determine if two strings are similar based on given conditions.
Check if the strings are equal first.
Then check if the strings can be divided into two halves with similar patterns.
Return 1 if the strings are similar, 0 otherwise.
Round duration - 45 Minutes
Round difficulty - Medium
The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.
Round duration - 30 minutes
Round difficulty - Medium
This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.
Round duration - 20 minutes
Round difficulty - Easy
The platform was Zoom time duration was 20 mins. Asked me to give my introduction.
Tip 1 : Don't stick to a single topic too much. Cover all and prepare short notes for all the topics so it will be easier for revision.
Tip 2 : Do projects so that they will be an added weightage.
Tip 3 : Practice a minimum of 100 questions on that particular topic so that it will be easy to crack within no time.
Tip 1 : Projects add good weight to the resume. So the interviewer asks the questions based on that.
Tip 2 : Resume should be genuine. You have to be confident of whatever is written in your resume
I applied via Naukri.com and was interviewed before Jan 2021. There were 5 interview rounds.
Working code with edge cases is code that has been tested with extreme inputs to ensure it functions correctly.
Edge cases are inputs that are unlikely to occur but can cause unexpected behavior if not handled properly.
Examples of edge cases include empty inputs, null values, and inputs at the limits of the data type's range.
Working code with edge cases should be thoroughly tested to ensure it functions correctly in all
I appeared for an interview in Jan 2025.
Exception handling is crucial in programming to handle errors and ensure proper execution. The 'finally' block is used to clean up resources, and throwing exceptions allows for error propagation.
Exception handling is used to manage errors and unexpected situations in a program.
The 'finally' block is used to execute code that should always run, regardless of whether an exception is thrown or not.
Throwing exceptions allo...
ACID properties ensure data integrity in transactions. CAP Theorem states that a distributed system can only guarantee two out of three: Consistency, Availability, Partition Tolerance.
ACID properties: Atomicity, Consistency, Isolation, Durability
Example: In a banking application, a transfer of funds should be atomic, consistent, isolated, and durable
CAP Theorem: Consistency, Availability, Partition Tolerance - a distri...
Comparable is an interface used for natural ordering, while Comparator is used for custom ordering in Java Collections.
Comparable interface is used to define the natural ordering of objects. It is implemented by the class whose objects are to be sorted.
Comparator interface is used to define custom ordering of objects. It is implemented by a separate class.
To implement Comparable, the class needs to override the compare...
Generics in Java allow for creating classes, interfaces, and methods that operate on types parameterized at compile time.
Generics provide type safety by allowing compile-time type checking.
They enable code reusability and reduce the need for casting.
Example: List<String> list = new ArrayList<>();
Code to reverse a string using recursion
Create a recursive function that takes a string as input
Base case: if the string is empty or has only one character, return the string
Recursive case: return the last character of the string concatenated with the result of calling the function on the substring excluding the last character
Object comparison with specific fields involves comparing values of selected fields between two objects.
Object comparison can be done by comparing the values of specific fields in two objects.
Fields can be selected based on unique identifiers or criteria for comparison.
Example: Comparing the 'name' field of two person objects to check if they are the same.
Distributed transactions in microservices involve using compensating transactions and event-driven architecture.
Microservices typically use compensating transactions to maintain consistency across multiple services.
Event-driven architecture can help in coordinating distributed transactions by using events to trigger actions in different services.
Implementing distributed transactions in microservices requires careful de...
Aggregator pattern is used in microservices architecture to combine multiple service responses into a single response.
Aggregator pattern helps in reducing the number of client requests by combining multiple service responses.
It can be implemented using a separate service or within an existing service.
Example: A shopping website aggregating product information from different microservices like inventory, pricing, and re
Factory design pattern is a creational pattern that provides an interface for creating objects in a superclass, but allows subclasses to alter the type of objects that will be created.
Factory method pattern defines an interface for creating objects, but lets subclasses decide which class to instantiate.
It promotes loose coupling by eliminating the need to bind application-specific classes into the code.
Example: A car m...
Indexing in a database is a technique to improve the speed of data retrieval by creating a data structure that allows for quick lookup.
Indexing involves creating a separate data structure that contains pointers to the actual data in the database.
Common data structures used for indexing include B-trees, hash tables, and binary search trees.
Indexes can be created on one or multiple columns in a database table to speed up...
My approach involves using load balancing, caching, asynchronous processing, and horizontal scaling.
Implement load balancing to distribute requests evenly across multiple servers.
Utilize caching mechanisms to store frequently accessed data and reduce response times.
Use asynchronous processing for long-running tasks to free up resources for handling more requests.
Implement horizontal scaling by adding more servers to ha...
CQRS pattern in microservices separates read and write operations for improved scalability and performance.
CQRS stands for Command Query Responsibility Segregation
It separates the read and write operations into two different models
Write operations update the data store, while read operations query a separate data store
CQRS can improve performance and scalability by allowing each model to be optimized for its specific t
API Gateway acts as a single entry point for all client requests in a microservices architecture.
API Gateway handles authentication, authorization, rate limiting, and routing of requests to appropriate microservices.
It helps in decoupling client applications from individual microservices, providing a more flexible and scalable architecture.
API Gateway can also perform tasks like request/response transformation, logging...
SQL query to fetch data from two tables using joins
Use the JOIN keyword to combine rows from two tables based on a related column
Specify the columns to select from each table in the SELECT statement
Use the ON keyword to specify the join condition
I applied via Approached by Company and was interviewed before Jul 2023. There were 3 interview rounds.
Mostly dynamic programming and tree based programs
I applied via Approached by Company and was interviewed in Feb 2024. There was 1 interview round.
A bean in Spring is a Java object that is instantiated, assembled, and managed by the Spring IoC container.
Beans are defined in the Spring configuration file using XML or annotations.
Beans are singleton by default but can be configured as prototype.
Beans can have dependencies injected by the container.
Example: @Component annotation in Spring creates a bean.
Example:
based on 1 interview
Interview experience
Assistant Manager
403
salaries
| ₹5 L/yr - ₹20 L/yr |
Store Manager
304
salaries
| ₹5 L/yr - ₹14 L/yr |
Senior Executive
229
salaries
| ₹1.7 L/yr - ₹10.1 L/yr |
Department Manager
202
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Manager
120
salaries
| ₹7.3 L/yr - ₹28.5 L/yr |
DMart
Future Group
Vishal Mega Mart
Walmart