Citrix R&d India Pvt. Lit Manager II Interview Questions and Answers

Q1. Predecessor of a node in bst
Ans. 
Predecessor of a node in a Binary Search Tree (BST) is the largest node in the left subtree of the given node.
• In a BST, the predecessor of a node can be found by going to the left child of the node and then traversing to the rightmost node in the subtree.

• If the left child of the node is null, then the predecessor will be the parent of the node or the ancestor node that is on the right side of the parent.

• Example: In a B...read more
Answered by AI
Add your answer

Q1. Cache low level design
Ans. 
Designing a cache system to improve performance by storing frequently accessed data in memory.
• Identify the data that needs to be cached based on frequency of access

• Choose an appropriate caching algorithm (LRU, LFU, etc.)

• Decide on the cache size and eviction policy

• Implement cache invalidation strategies to keep data up to date

• Consider thread safety and concurrency issues
Answered by AI
Add your answer

It is Hacker rank test ,asked 2 questions and needs to solve in 1 hour

Q1. Tested problem solving
Add your answer

Q1. Low level designing
Add your answer

Q1. It is managerial round
Add your answer

Q1. What did you do in your previous org?
Add your answer
Q2. How did you help with hiring?
Add your answer

Q1. Promises, basic output questions, let vs const, hoisting
Add your answer

Q1. Currying, Event Bubbling, DOM Manipulation, Medium Level Output Questions, Design Patterns
Add your answer

Q1. Previous work experience and tech stack used, OOPs concepts
Add your answer

It was easy

Q1. Nice question based on core java
Add your answer
Q2. Opps, new keyword, immutable class, exception
Add your answer

Q1. What is your family background?
Add your answer
Q2. Share details of your previous job.
Add your answer
Q3. Why should we hire you?
Add your answer

Q1. What are your strengths and weaknesses?
Add your answer
Q2. Strengths and weaknesses
Add your answer

Prepare DSA very well and also one common question which is very frequently asked ks design Hashmap and also implement LRU cache.

Q1. Tell me about yourself.
Add your answer

They asked me to create a live working project and sufficient time was provided.

Q1. Detailed discussion around the project created in round 1. Each and every details were asked and discussion on approach.
Add your answer

Q1. This was final managerial round.
Add your answer