Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by CitiusTech Team. If you also belong to the team, you can get access from here

CitiusTech Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

CitiusTech HR Manager Interview Questions and Answers

Updated 17 Apr 2024

CitiusTech HR Manager Interview Experiences

1 interview found

HR Manager Interview Questions & Answers

user image Anonymous

posted on 17 Apr 2024

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

Attitude test best performance 👍

Round 2 - Group Discussion 

Group discussion best performance 👍

Round 3 - One-on-one 

(3 Questions)

  • Q1. One on one round best performance 👍
  • Q2. One on one round best performance
  • Q3. One on one round best company 👍
Round 4 - Assignment 

Assignment best performance 👍

Interview Preparation Tips

Interview preparation tips for other job seekers - It is like a great day ahead you have to achieve the details

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via LinkedIn and was interviewed before Feb 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Just basic questions like Method overloading, riding Abstract and interface Use of static Etc..
Round 2 - Coding Test 

Basic Java programs related to string and array manipulation

Round 3 - Cliend Round 

(1 Question)

  • Q1. Jus basic questions related to Work culture and privacy

Interview Preparation Tips

Topics to prepare for Apexon Software Engineer interview:
  • Java
Interview preparation tips for other job seekers - Study basics to advanced iN Java

I applied via Recruitment Consulltant and was interviewed before Aug 2021. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Java technical questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for theoretical Java questions with less coding.

I applied via Approached by Company and was interviewed before Jul 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Basic programming questions

Round 2 - HR 

(1 Question)

  • Q1. Salary and self intro discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basic interview questions and self intro

I applied via Company Website and was interviewed in Apr 2020. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Are you updating day by day yourself in technology ?
  • Q2. Yes, means you will definitely placed in technosoft.

Interview Preparation Tips

Interview preparation tips for other job seekers - I had done certification and learn the skill day by day, waiting for the opening in technosoft. I had attended three round of interview, if you have real skill and self confidence you will definitely placed in technosoft global services

I applied via LinkedIn and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basics Of JS

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Different types of No SQL DBs
  • Ans. 

    NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.

    • Document-oriented databases (MongoDB, Couchbase)

    • Key-value stores (Redis, Riak)

    • Column-family stores (Cassandra, HBase)

    • Graph databases (Neo4j, OrientDB)

  • Answered by AI
  • Q2. Different types of scaling
  • Ans. 

    Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.

    • Vertical Scaling: Adding more resources to a single node

    • Horizontal Scaling: Adding more nodes to a system

    • Load Balancing: Distributing the load across multiple nodes

    • Database Sharding: Splitting a database into smaller parts to distribute the load

    • Caching: Storing frequently accessed data in memory for faster acc

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on Problem solving. Have a good understanding on main concepts of DSA. Java technical side is just as same as other companies. Also if you are applying for senior positions. Prepare for System Design rounds

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Telephonic technical
  • Q2. Core Java related exception handling ,design pattern ,oops solid design principle, rest API, different annotations of spring and jpa
  • Q3. Same questions on telephonic round but detailed elaborate and given simple problem statement we had to justify that why it's time n space complexity valid. Rest API questions hibernate orm use
  • Q4. Manager round just to check whether you have actually worked on project or not stress testing performance questions scenario questions

Interview Preparation Tips

General Tips: Quite easy just go with preparation
Skills: Core Java sevlet JSP hibernate spring rest API, Communication, Body Language, Problem Solving, Analytical Skills, Decision Making Skills
Duration: 1-4 weeks

I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Technical questions & team leading

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview is not difficult..

CitiusTech Interview FAQs

How many rounds are there in CitiusTech HR Manager interview?
CitiusTech interview process usually has 4 rounds. The most common rounds in the CitiusTech interview process are Aptitude Test, Group Discussion and One-on-one Round.
What are the top questions asked in CitiusTech HR Manager interview?

Some of the top questions asked at the CitiusTech HR Manager interview -

  1. One on one round best performance �...read more
  2. One on one round best company �...read more

Tell us how to improve this page.

CitiusTech HR Manager Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.5k Interviews
Infosys Interview Questions
3.6
 • 7.6k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.8k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
LTIMindtree Interview Questions
3.8
 • 2.9k Interviews
Mphasis Interview Questions
3.4
 • 796 Interviews
View all
CitiusTech HR Manager Salary
based on 6 salaries
₹10 L/yr - ₹14 L/yr
5% more than the average HR Manager Salary in India
View more details

CitiusTech HR Manager Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
2.6k salaries
unlock blur

₹5.6 L/yr - ₹20 L/yr

Technical Lead
2k salaries
unlock blur

₹7.3 L/yr - ₹27.5 L/yr

Software Engineer
1.2k salaries
unlock blur

₹3 L/yr - ₹12.2 L/yr

Technical Lead 1
383 salaries
unlock blur

₹7 L/yr - ₹25.5 L/yr

Technical Lead 2
299 salaries
unlock blur

₹8 L/yr - ₹28 L/yr

Explore more salaries
Compare CitiusTech with

Accenture

3.8
Compare

Capgemini

3.7
Compare

Xoriant

4.1
Compare

HTC Global Services

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview