๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐Ÿ”” 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);
}
};
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.
๐Ÿ‘7