i
Optel Group
Filter interviews by
Top trending discussions
I applied via Approached by Company and was interviewed in Oct 2024. There were 4 interview rounds.
2 DSA questions and some MCQ on Java and Spring
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.
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
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.
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
I applied via LinkedIn and was interviewed in Dec 2024. There were 3 interview rounds.
1.Sum numbers in linked list
2. Maximum sum subarray
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
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.
I applied via Campus Placement
2 coding questions and a few MCQs
Sliding window problem involves finding a subarray of fixed size k with maximum sum.
Use a sliding window approach to iterate through the array and calculate the sum of each subarray of size k.
Keep track of the maximum sum encountered so far.
Move the window by one element at a time and update the sum accordingly.
Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and k = 3, the subarray with maximum sum is [5, 3, 6] with su
posted on 19 Oct 2024
Good question but very simple to answer
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
Associate Consultant
5
salaries
| ₹6 L/yr - ₹7.3 L/yr |
Consultant
5
salaries
| ₹8 L/yr - ₹22 L/yr |
Integration Engineer
5
salaries
| ₹5 L/yr - ₹9 L/yr |
Project Engineer
5
salaries
| ₹6.2 L/yr - ₹8 L/yr |
Architect
5
salaries
| ₹22 L/yr - ₹27 L/yr |
Antares Vision
Systech
Tracelink
Aavanor Systems