i
CitiusTech
Filter interviews by
I applied via Campus Placement
Basic maths and reasoning
Baic knowledge in number system and traditional aptitude questions can we expect
Artificial Intelligence (AI) is the current growing technology.
AI is being used in various industries such as healthcare, finance, and transportation.
Machine learning and deep learning are key components of AI.
Examples of AI applications include virtual assistants, autonomous vehicles, and fraud detection systems.
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 2 interview rounds.
Encapsulation is the process of hiding implementation details and restricting access to an object's data and methods.
Encapsulation helps in achieving data abstraction and security.
It allows for better control over the data and prevents accidental modification.
It also enables easy modification of implementation details without affecting the rest of the code.
For example, a class can have private variables and public meth...
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Logical reasoning related aptitude regular exam
During my campus placement, I developed a web-based inventory management system to streamline stock tracking and reporting.
Technology Stack: I used HTML, CSS, JavaScript for the front end, and Node.js with Express for the back end, ensuring a full-stack approach.
Database Integration: Implemented MongoDB to store inventory data, allowing for efficient querying and data manipulation.
User Authentication: Integrated user a...
What people are saying about CitiusTech
I applied via Referral and was interviewed before Jun 2022. There were 4 interview rounds.
Basic aptitude like logical verbal and coding question
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Question related to dilr, aptitude were asked.
Easy level questions were asked
I applied via LinkedIn and was interviewed before Feb 2021. There were 3 interview rounds.
Basic Java programs related to string and array manipulation
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
posted on 3 Feb 2021
posted on 29 Apr 2021
based on 4 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Senior Software Engineer
2.7k
salaries
| ₹8.4 L/yr - ₹15.8 L/yr |
Technical Lead
2.2k
salaries
| ₹12.5 L/yr - ₹22 L/yr |
Software Engineer
1.3k
salaries
| ₹3.8 L/yr - ₹9.1 L/yr |
Technical Lead 1
414
salaries
| ₹12.2 L/yr - ₹21.8 L/yr |
Technical Specialist
348
salaries
| ₹18.5 L/yr - ₹32.5 L/yr |
Accenture
Capgemini
Xoriant
HTC Global Services