๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐’๐จ๐ฆ๐ž๐ญ๐ข๐ฆ๐ž๐ฌ ๐ฅ๐š๐ญ๐ž๐ซ ๐›๐ž๐œ๐จ๐ฆ๐ž๐ฌ ๐ง๐ž๐ฏ๐ž๐ซ, ๐ƒ๐Ž ๐ˆ๐“ ๐๐Ž๐–. ๐Ÿ˜Š

Have a great week ahead ๐Ÿ˜Šโค๏ธ
๐Ÿ‘6
๐Ÿ”” TCS NQT Registration 2022 | TCS Recruitment Drive For Freshers | 3.36 LPA-7 LPA

* Test : National Qualifier Test (NQT)
* Qualification : B.E/B.Tech/ME/M.Tech/MCA/Msc
* Last Date : 22 July 2022
* Test Date : 15 August Onwards
* Package : 3.36 LPA-7 LPA

Apply Here

๐Ÿ“ŒDirect & 100% Ads Free Links
โœ… Share with your friends
๐Ÿ‘1
๐Ÿ”” Newgen Software Off Campus Drive 2022 : Hiring for Freshers as Software Engineer With 4.25 LPA

* Designation : Software Engineer
* Eligibility : B.E/B.Tech
* Experience : Freshers
* Salary : Rs. 4.25LPA

Apply Here

๐Ÿ“ŒDirect & 100% Ads Free Links
โœ… Share with your friends
๐Ÿ”” Amdocs Off Campus Recruitment 2022 : Hiring for Freshers as Associate Engineer With 5 LPA

* Job Role : Associate Engineer
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA
* Experience : Freshers
* Salary : Rs 5 LPA

Apply Here

๐Ÿ“ŒDirect & 100% Ads Free Links
โœ… Share with your friends
๐Ÿ”” Hitachi Vantara Recruitment 2022 : Hiring for Freshers as Associate (ASSOC) With 5 LPA

* Job Role : Associate (ASSOC)
* Qualification : B.E/B.Tech
* Batch : 2022
* Salary : 5 LPA

Apply Here

๐Ÿ“ŒDirect & 100% Ads Free Links
โœ… Share with your friends
๐Ÿ‘1
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);
}
};