i
NetConnectGlobal
Filter interviews by
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Top trending discussions
I appeared for an interview in Aug 2023.
To reduce candidate no-shows and increase joiner's ratio, focus on clear communication, setting expectations, streamlining the hiring process, and providing a positive candidate experience.
Communicate clearly with candidates about the job role, company culture, and expectations.
Set realistic expectations during the recruitment process to avoid surprises later on.
Streamline the hiring process to minimize delays and keep...
posted on 27 Sep 2023
I applied via Campus Placement and was interviewed before Jul 2021. There were 3 interview rounds.
The aptitude test contains questions MCQs for quants, basic statistics and basic coding questions. The aptitude also has 2 coding problems to solve which would be of easy-medium level.
The second round was live coding test, where the interviewer looks for your approach towards solving a given problem. The approach matters more than the correct syntax. All coding languages were allowed. SQL queries can also be asked.
I applied via Approached by Company and was interviewed before Aug 2021. There were 3 interview rounds.
1st Round consisted of Technical Discussion and Coding Round. I was asked to write down the logic for Prime no., Fibonacci Series, Matrix related question, etc.
I was asked to share my screen and write down logic for questions related to Strings, Arrays and 2-D matrix's.
I applied via Naukri.com and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Company Website and was interviewed before May 2021. There were 5 interview rounds.
Online test with questions from probability and reasoning
A case study for which we need to create a dashboard and a power point presentation.
SQL written test
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
System Analyst
78
salaries
| ₹2 L/yr - ₹8 L/yr |
Talent Acquisition Specialist
57
salaries
| ₹2.6 L/yr - ₹8.5 L/yr |
SOC Analyst
53
salaries
| ₹3 L/yr - ₹10 L/yr |
Network Engineer
45
salaries
| ₹1.5 L/yr - ₹7.2 L/yr |
Desktop Support Engineer
40
salaries
| ₹1 L/yr - ₹4.5 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant