Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree.

class Solution {
public:
int d=INT_MAX;

void f(TreeNode* root)
{
if(root==NULL)
return;

if(root->left!=NULL)
{
d=min((root->val-root->left->val),d);
f(root->left);
}

if(root->right!=NULL)
{
d=min((root->val-root->right->val),d);
f(root->left);
}
}

int getMinimumDifference(TreeNode* root)
{
f(root);
return abs(d);
}
};

Decreasing Numbers Hitachi

Only for 2023 passouts, although they mentioned tier 1 and tier 2 but you guys can try.

https://docs.google.com/forms/d/e/1FAIpQLSf9cP9QF2DegBbftG-2S9yExFBG8GwpRWmyZajz7E3Jwio4iw/viewform

Accenture is hiring

Batch eligible: 2021 and 2022 passouts
CTC: 4.5 LPA
Apply Link: https://indiacampus.accenture.com/myzone/accenture/1/jobs/2521/job-details

P.S. If you don't have any job till now, go for this

Medallion is hiring
Role: Software Engineer
Batch eligible: 2022 batch eligible

Apply Link: https://www.linkedin.com/jobs/view/3121149096

Model N Off Campus Drive 2022: Mass Hiring for Freshers With 7.25 LPA

Qualification: B.E/B.Tech
Specialization: CSE/IT/ECE/EEE
Graduation year of passing: 2022
Percentage: 60% and above in 10th, 12th, and Graduation
Certification (if any): Java, Database, Dev Ops, Selenium – Any of these will be added advantage.

https://match.myanatomy.in/corporate/customCampaign/view?publicLink=2a5b962fb55b4ca303d64f8f700c6d74;05e0e7d6e22684b9c51f23c62aaec74a2165f08583d8f65fcb80e66f29d71e8a780d409493e9223952eb59ea736183908392f80413d2b4fea1bd64b1ba7734dd3a4615c8b1c441cdfc9bac69fa97ae802243b9a7be2e3a065f1ef9796b35dc8f63f862e6a9a301e25df46c04195e05268b92c2091e18fecad21d8195216ee9dc4decf55af8bd05512af685f3293846a2cd744b450088ec2dade7c372e1914353331068f98db03625855f6b144779d194&source=n

Cognizant interview experience.

Role : GencNext
Package: 6.75
1.Self introduction
2. What is java.
3. What is class.
4. What do u mean by abstract and abstract methods and classes.
5. Oops principles.
6. What is abstract.
7. What is interface.
8. Finally, final, finalize.
9.what is garbage collector.
10. Tell me the case where finally block doesn't get executed.
11. Types of inheritance.
12. Two pattern printing codes like pyramids
13. Sql.
14. Scenario based questions.
15. Multithreading.
16. Method overloading and method overriding.
17. Example of checked and unchecked exception.
18. Acid properties.
19. Commit and rollback.
20.Stack and linked list real life examples
21. Search an element in linked list.

Atlassian

Software Development Engineer I, Backend
https://jobs.lever.co/atlassian/db4f7e89-091b-47c1-8971-0b8abd9f959c

L&T Off Campus

Only 2022 Batch

https://campus.lntedutech.com/l#/open/off-campus/profile

❗️Model N OffCampus Drive❗️

🎖 Batch - 2022
💰 CTC - 7.25lpa + Bonus + Stock
📝 Link - bit.ly/3nPply1

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.

TCS NQT 9 am Answers

1- X-5
2-14
3-8
4-50
5-91.2
6-735
7-166.66%
9-12000
10-4200
11-1900,2100
14-3
17-22 min

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)