Leetcode 1027 Longest Arithmetic Subsequence

[@shreyashtripathi1187]

Wow very simply and beautifully explained!

[@cadcaetutorial2039]

So nice this lecture sir

[@JeevanKumar-code]

Thank you! 💓

[@Star_Bawa9]

i think of a better solution let us say m1-m2 =diff then m1-diff =m2 this means if we use a map and find the m2 element in the map we increase its frequency (curr-diff)+1 else we initialize it to one and just store the count of element with maxfreq in an variable and return it .
Here is the code
class Solution {
public int longestSubsequence(int[] arr, int difference) {
Map map=new HashMap();
int mx=0;
for(int i=0;i

[@pavanranjith9884]

Doing Good Brother.. Keep going!

[@JeevanKumar-code]

Thank you! ❤️

[@leetcoder1159]

Which text editor you use for writing?

[@JeevanKumar-code]

Its GoodNotes

[@bogdyee]

Found the same problem a while ago but with limitations like this 2 < n < 10000, 1

[@cadcaetutorial2039]

This lecture is very nice sir

[@JeevanKumar-code]

Thank you! 💓

[@thisismrsanjay]

really nice explanation please if possible make a video on all the imp patterns in arrays thanks ❤❤

[@JeevanKumar-code]

Sure. I am planning to come up with a course! Stay tuned! Welcome❤️

[@mohammadyahya78]

Very smart solutions. Thank you.

[@JeevanKumar-code]

I am glad you liked it!

[@MertMusaTemel]

thanks for the explanation

[@JeevanKumar-code]

Welcome!❤️

[@146_shashanks4]

very nice explanation bro😊

[@JeevanKumar-code]

Thank you! 💓