
Asked in LTIMindtree
Longest Harmonious Subsequence Problem Statement
Determine the longest harmonious subsequence within a given array of integers, where the difference between the maximum and minimum elements of the subsequence is exactly 1.
Example:
Input:
ARR = [3, 4, 3, 3, 3, 3, 4]
Output:
7
Explanation:
The sequence [3, 4, 3, 3, 3, 3, 4]
is harmonious since the maximum value (4) and the minimum value (3) differ by 1.
Constraints:
- 1 <= T <= 100
- 1 <= N <= 10^4
- 1 <= ARR[i] <= 10^8
- Time limit: 1 sec

AnswerBot
4mo
Find the longest harmonious subsequence in an array where the difference between max and min elements is 1.
Iterate through the array and count the frequency of each element.
For each element, check if ...read more
Help your peers!
Add answer anonymously...
Top Java Developer Interview Questions Asked at LTIMindtree
Q. What is Java?
Q. What is encapsulation?
Q. What are the OOP concepts in Java?
Interview Questions Asked to Java Developer at Other Companies
Top Skill-Based Questions for LTIMindtree Java Developer
Java Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Algorithms Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Spring Boot Interview Questions and Answers
50 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

