HackerRank Coding Questions for Cognizant
Cognizant Coding Questions asked in HackerRank Section
Cognizant HackerRank Test, HackerRank Cognizant, HackerRank CTS Questions for Coding Assessment Cognizant exam.
HackerRank CTS Questions
- HackerRank Coding Question for Cognizant 1
- HackerRank Coding Question for Cognizant 2
- HackerRank Coding Question for CTS 3
- CTS HackerRank Coding Question 4
- HackerRank CTS Programming Question 5
Cognizant HackerRank Test Questions
- HackerRank Programming Question 6 for CTS
- CTS HackerRank Programming Question 7
- Cognizant HackerRank Programming Question 8
Get Upto Rs100 per Question on Paytm as reward
Other Questions asked in Test –
- Program to check if a Binary tree is BST or note
- Find the Lowest Common Ancestor in a Binary Search Tree
- Program to check if a binary tree is height balanced or not
- Program Two Nodes of a BST are Swapped correct the BST
- Find maximum in binary tree
- Program to Connect nodes of a Tree at same level
- Find the Lowest Common Ancestor in a Binary Tree
- Add Two Numbers Represented by Linked Lists
- Detecting Loop in a Linked List
Summary
Reviewer
Shaily
Review Date
Reviewed Item
HackerRank Cognizant
Author Rating
Login/Signup to comment
int gcd = GCD.gcd(a, b);
int lcm = (a*b)/gcd;
System.out.println(“GCD is : “+gcd);
System.out.println(“LCM is : “+lcm);
Add comments here