i
CitiusTech
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
Spring Boot is a framework that simplifies the development of Java applications by providing pre-configured settings and tools.
Spring Boot eliminates the need for manual configuration by providing defaults for most settings.
It allows for easy creation of stand-alone, production-grade Spring-based applications.
Spring Boot includes embedded servers like Tomcat, Jetty, or Undertow, making it easy to deploy applications.
It...
Redux is a predictable state container for JavaScript apps, commonly used with React for managing application state.
Redux helps manage the state of an application in a predictable way
It provides a single source of truth for the state of the application
Actions are dispatched to update the state in a predictable manner
Reducers specify how the state changes in response to actions
Redux is commonly used with React to manage
Context API in React is a way to pass data through the component tree without having to pass props down manually at every level.
Context API provides a way to share values like themes, user data, etc. across the component tree without having to pass props down manually.
It consists of three main parts: Provider, Consumer, and useContext hook.
Provider component allows the data to be passed down to the tree, Consumer compo...
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
Seeking new challenges and growth opportunities in a dynamic environment.
Desire for professional growth
Seeking new challenges
Interested in a more dynamic work environment
Count duplicates in an int array
Create a HashMap to store the count of each element in the array
Iterate through the array and update the count in the HashMap
Count the elements with count greater than 1 as duplicates
I appeared for an interview in Dec 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on Coding and core java based questions.
Given a string 'S' consisting of words, your task is to calculate how many times each word appears in the string. A word is a series of one or more non-space characters. In 'S', wor...
Count the frequency of each word in a given string.
Split the string by spaces to get individual words.
Use a hashmap to store each word and its frequency.
Iterate through the words and update the hashmap accordingly.
Print out the words and their frequencies in any order.
Comparable is an interface used for natural ordering, while Comparator is an interface used for custom ordering in Java.
Comparable interface is used to define the natural ordering of objects. It is implemented by the class whose objects are to be compared.
Comparator interface is used to define custom ordering of objects. It is implemented by a separate class.
Comparable interface has a single method, compareTo(), which ...
Round duration - 60 minutes
Round difficulty - Easy
This was a technical + managerial round.
Multithreading in Java allows for concurrent execution of multiple tasks, improving performance and responsiveness.
1. Improved performance by utilizing multiple CPU cores efficiently.
2. Enhanced responsiveness as tasks can run concurrently without blocking each other.
3. Simplified coding for complex tasks by breaking them into smaller threads.
4. Facilitates better resource utilization and scalability.
5. Examples: paral...
Azure and AWS are two major cloud service providers offering similar services but with some differences in features and pricing.
AWS is the oldest and most widely used cloud service provider, while Azure is catching up quickly.
Azure is known for its strong integration with Microsoft products and services, while AWS has a wider range of third-party integrations.
AWS has a larger global presence with more data centers worl...
Round duration - 30 minutes
Round difficulty - Easy
This was a typical HR round.
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.
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.
CitiusTech interview questions for designations
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
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.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
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
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.
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.
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 ...
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.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
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.
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...
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.
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...
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
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
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...
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
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...
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.
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.
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...
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
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.
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...
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.
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.
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.
I appeared for an interview before Mar 2016.
posted on 3 Feb 2021
based on 4 interviews
1 Interview rounds
based on 4 reviews
Rating in categories
Senior Software Engineer
2.6k
salaries
| ₹5.8 L/yr - ₹20 L/yr |
Technical Lead
2k
salaries
| ₹7.3 L/yr - ₹27.5 L/yr |
Software Engineer
1.2k
salaries
| ₹3 L/yr - ₹12 L/yr |
Technical Lead 1
382
salaries
| ₹7 L/yr - ₹25.4 L/yr |
Technical Lead 2
300
salaries
| ₹8 L/yr - ₹28 L/yr |
Accenture
Capgemini
Xoriant
HTC Global Services