i
LogicMonitor
Filter interviews by
Todolist implementation
Create a UI for adding tasks
Implement functionality to add, delete and mark tasks as complete
Store tasks in a database or local storage
Allow filtering of tasks by status (completed, active)
Add option to edit task details
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Data Structure And Algorithm based LC easy questions
Normal java coding question
Spring IoC (Inversion of Control) is a design pattern where the control of object creation and lifecycle is shifted to a container or framework.
In Spring IoC, objects are created and managed by the Spring container.
It helps in achieving loose coupling between classes.
Dependency Injection is a key feature of Spring IoC, where dependencies of a class are injected by the container.
Example: @Autowired annotation in Spring
The Map interface in Java provides a way to store key-value pairs and retrieve values based on keys.
Different implementations of the Map interface include HashMap, TreeMap, LinkedHashMap, and ConcurrentHashMap.
HashMap provides constant-time performance for basic operations but does not guarantee the order of elements.
TreeMap maintains elements in sorted order based on keys.
LinkedHashMap maintains the insertion order of...
posted on 13 Nov 2024
Easy - Medium Leetcode
I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.
I was interviewed in Sep 2021.
Round duration - 60 minutes
Round difficulty - Medium
The round was technical round and it was held on google meet around 1 pm
Given two hourglass of 4 minutes and 7 minutes, the task is to measure 9 minutes.
What is multithreading ?
What is diamond problem ?
He asked some technical questions related to my projects
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...
Round duration - 60 minutes
Round difficulty - Medium
It was managerial round and took place around 3 pm
Producer Consumer Problem using Semaphores
What is Banker's algorithm?
What is Belady's Anomaly ?
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
Tip 1 : Java concepts should be strong
Tip 2 : OOPS
Tip 3 : Projects should have scalability
Tip 1 : Projects detail should be short and precise
Tip 2 : Don't fake technical skills
posted on 14 Sep 2021
I was interviewed in Mar 2021.
Round duration - 60 Minutes
Round difficulty - Easy
The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.
Suppose given input is ...
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:O(L), where L is the len...
Round duration - 120 Minutes
Round difficulty - Hard
This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.
This problem requires you to implement a log watching solution (similar to the tail -f command in UNIX). However, in this case, the log file is hosted on a remote machine (same machine ...
Round duration - 45 Minutes
Round difficulty - Medium
The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.
How did you find the last n lines of log file ? and if given more time how would you do it efficiently ?
Questions on a personal project and what if we do a change how will you handle it.
...
Round duration - 20 Minutes
Round difficulty - Easy
Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.
How do you work under pressure?
Are you willing to relocate or travel?
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice questions from leetcode as mostly questions were asked from that only.
Tip 3 : Revise Computer Science subjects like DBMS, OS & OOPS thoroughly, it'll help you ace last round
Tip 4 : Revise everything about your mentioned internship projects and self projects. Projects hold a great weight in selection.
Tip 1 : Competitive programming profiles is a must. That'll help you get shortlisted.
Tip 2 : Resume should reflect development and experience in DSA.
Tip 3 : Be genuine in your skills and technologies section, question will be asked from them.
based on 1 review
Rating in categories
Software Engineer
66
salaries
| ₹9 L/yr - ₹20.2 L/yr |
Senior Software Engineer
52
salaries
| ₹15 L/yr - ₹31.9 L/yr |
Senior Automation Engineer
28
salaries
| ₹16.4 L/yr - ₹27.7 L/yr |
Associate Software Engineer
23
salaries
| ₹7.7 L/yr - ₹11.4 L/yr |
UI Engineer
19
salaries
| ₹8 L/yr - ₹18.7 L/yr |
Freshworks
Zoho
ManageEngine
InMobi