Citrix R&d India Pvt. Lit Software Developer Interview Questions and Answers

Comprehensive questions

Java strings programs

Q1. Core java basic details
Add your answer
Q2. Everything related to basic core java
Ans. Learn deeply into basic core java concepts
Answered Anonymously
Add your answer

Find out a string is palindrome or not

Q1. ACID properties
Ans. 
ACID properties are a set of properties that guarantee database transactions are processed reliably.
• ACID stands for Atomicity, Consistency, Isolation, Durability

• Atomicity ensures that all operations in a transaction are completed successfully or none at all

• Consistency ensures that the database remains in a consistent state before and after the transaction

• Isolation ensures that transactions are executed independently of...read more
Answered by AI
Add your answer
Q2. Event loop in node js
Ans. 
Event loop in Node.js manages asynchronous operations by executing callback functions when certain events occur.
• Event loop is responsible for handling I/O operations, timers, and callbacks in Node.js

• It allows Node.js to perform non-blocking operations efficiently

• Event loop continuously checks the event queue and executes callback functions when events are triggered
Answered by AI
Add your answer
Q3. Trigger and cursor
Add your answer
Q4. Primary vs foreign vs unique key
Ans. 
Primary key uniquely identifies a record, foreign key links to a primary key in another table, unique key ensures uniqueness of a column or set of columns.
• Primary key: uniquely identifies each record in a table (e.g. employee_id in an employees table)

• Foreign key: links to a primary key in another table to establish a relationship (e.g. department_id in an employees table linking to department_id in a departments table)

• ...read more
Answered by AI
Add your answer
Q5. Project related Questions and whats your job role in that project
Add your answer
Q6. Variable hoisting in js
Ans. 
Variable hoisting is a behavior in JavaScript where variable declarations are moved to the top of their scope during compilation.
• Variable declarations are hoisted to the top of their function or global scope.

• Only the declarations are hoisted, not the initializations.

• Hoisting allows you to use a variable before it is declared, but it is best practice to declare variables at the top of the scope.

• Example: console.log(myV
Answered by AI
Add your answer
Q7. Function closure in js
Ans. 
Function closure in JavaScript allows a function to access variables from its outer scope even after the outer function has finished executing.
• Function closures occur when a function is defined within another function and the inner function has access to the outer function's variables.

• Closures are commonly used to create private variables and functions in JavaScript.

• Example: function outerFunction() { let outerVar = 'I...read more
Answered by AI
Add your answer
Q8. Shallow vs deep copy in js
Ans. 
Shallow copy creates a new object but references the same nested objects, while deep copy creates a new object with copies of all nested objects.
• Shallow copy only copies the top-level object, not the nested objects.

• Deep copy creates new copies of all nested objects, ensuring they are independent.

• In JavaScript, shallow copy can be achieved using Object.assign or spread operator, while deep copy can be achieved using JSO
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was in the morning. The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 40mins.Questions were mainly from Data structure, OS, DBMS, SQL.

Q1. 
Morty's Array Challenge
Rick has provided Morty with an array 'Arr' of length 'N' and an integer 'K'. Morty needs to split the array into non-empty sub-arrays to achieve the minimum possible cost, subject...read more
Ans. Naive Approach
The basic idea is to generate all the possible subarrays and find the cost of every possible split and then returning the minimum cost from all of them. 
The steps are as follows:
 
1. Recursively go through every possible split of the array Arr.
2. Store all the subarrays of one split into a vector<vector<int>> split.
3. Now go through every subarray of that split and find the frequency of every ...read more
Answered Anonymously
Add your answer
Q2. 
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...read more
Ans. Dynamic Programming
The simplest idea is to consider all subsequences of arr1[] and check if all numbers in this subsequence are prime and appear in arr2[]. Then find the longest length of these subsequences. But the time complexity for this operation will be O(M * (2 ^ N)) where ‘M’ is the length of the first array and ‘N’ is the length of the second array.
 
We can think of an efficient solution in which first we c...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was conducted in the evening around 4:30PM-5:30PM. Questions were bit difficult. Questions were mainly from Data Structures and there was total of 3 questions.

Q1. 
Split Array Problem Statement
You are given an integer array/list arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurrence of every disti...read more
Ans. Iterative
The key idea in this problem is storing the first and last occurrence index of every element. So, we can store the first and last index and then iterate over the array, and in each iteration, we check if the maximum index of the last occurrence of all the previous elements of the current subarray is less than or equal to the current index. 
 
We use array hash to store the last occurrence of an elemen...read more
Answered Anonymously
Add your answer
Q2. 
Split Array into 'K' Consecutive Subarrays Problem
Given an integer array arr of size N, determine if it is possible to split the array into K consecutive non-overlapping subarrays of length M such that e...read more
Ans. Array Traversal.
We will be solving this problem using a simple array traversal. At each position, we will check if the element at the current index i and (i + M) are the same or not. Moreover, if it is the same, then we will increment the counter, and as soon as our counter becomes equal to K, it means the array can be split, and we will return the answer at that step. If, after all, iterations are still if the count i...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

It was in the evening. Interviewer first ask simple questions to keep me calm and it was nice interaction with her the environment created by her was very interesting to answer