๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Amazon Interview experience :
Role : SDE 1
Technical interview 1
โ€ข Introduction
โ€ข Q1 delete all the leaf nodes from a binary tree with given target.
โ€ข Q2 count all the triplets from an array with given sum.
โ€ข Q3 convert sorted list to binary search tree.

Technical interview (2) was also same
2 questions were on Tree
And one on queue.
โค4
public class SolutionClass {

public static void main(String[] args) {
int p=lenghtOfLongestAP(arr);


}


static int lenghtOfLongestAP(int set[])
{
int n=set.length;
if(n==0)
return -1;

if (n <= 2) return n;

int L[][] = new int[n][n];

int llap = 2;

for (int i = 0; i < n; i++)
L[i][n - 1] = 2;

for (int j = n - 2; j >= 1; j--)
{
int i = j -1 , k = j + 1;
while (i >= 0 && k <= n - 1)
{
if (set[i] + set[k] < 2 * set[j])
k++;

else if (set[i] + set[k] > 2 * set[j])
{
L[i][j] = 2; i--;

}

else
{
L[i][j] = L[j][k] + 1;

llap = Math.max(llap, L[i][j]);

i--; k++;
}
}

while (i >= 0)
{
L[i][j] = 2;
i--;
}
}
return llap;
}

}

Samsung assignment code
Longest arithmetic โœ…(Java)
๐Ÿ‘1
Kirana Club is hiring for below roles:

Product and Growth:
1) Associate Product Manager
2) Growth Intern
3) Content Writer
4) Community and Social Media Intern
5) Community and Social Media Manager

Tech:
1) Frontend Engineer - React
2) Frontend Intern - React
3) React Native Engineer
4) React Native Intern

Data Science:
1) Data Scientist
2) Data Scientist Intern

Read all job description from here: https://retailpulse.notion.site/Careers-Kirana-Club-8bbc44fe13a5427aa69add11ccd5a853


P.S. It's a startup, search about company on LinkedIn.
๐Ÿ‘3