Jobs

Interviews

Discussions

Interviews
Companies
Citrix

Citrix Interview Guide

Showing 6 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Citrix. The higher the ranking, the more likely you'll encounter it in a Citrix interview.

Question

Frequency

Difficulty

Maximum Performance of a Team

You are given the speed and efficiency of several engineers. Select a team of at most k engineers to maximize the team's performance, which is calculated as the sum of their speeds multiplied by the minimum efficiency within the team.

ArraysGreedy Algorithms

Very likely

If you have a Citrix interview, it's very likely that you will get this question

Hard

#1. Maximum Performance of a Team

Hard

ArraysGreedy Algorithms

This question is very likely to be asked in your Citrix interview

Check if Strings Can be Made Equal With Operations II

You are given two strings of the same length. Determine if you can make them equal by swapping characters at even indices in the first string with characters at even indices in the second, and similarly for odd indices.

ArraysStrings

Somewhat likely

If you have a Citrix interview, you might get this question

Medium

#2. Check if Strings Can be Made Equal With Operations II

Medium

ArraysStrings

This question is somewhat likely to be asked in your Citrix interview

Find All Groups of Farmland

You are given a rectangular grid representing farmland. Identify and return the coordinates of all rectangular groups of connected farmland cells.

ArraysGraphs

Somewhat likely

If you have a Citrix interview, you might get this question

Medium

#3. Find All Groups of Farmland

Medium

You are given a rectangular grid representing farmland. Identify and return the coordinates of all rectangular groups of connected farmland cells.

ArraysGraphs

This question is somewhat likely to be asked in your Citrix interview

Check if Strings Can be Made Equal With Operations I

You are given two strings of the same length. Determine if you can make the first string equal to the second by swapping characters at even indices or swapping characters at odd indices.

Strings

Not likely

If you have a Citrix interview, it's unlikely that you will get this question. Citrix does ask it, but it's rare

Easy

#4. Check if Strings Can be Made Equal With Operations I

Easy

You are given two strings of the same length. Determine if you can make the first string equal to the second by swapping characters at even indices or swapping characters at odd indices.

Strings

This question is not likely to be asked in your Citrix interview

LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked Lists

Not likely

If you have a Citrix interview, it's unlikely that you will get this question. Citrix does ask it, but it's rare

Medium

#5. LRU Cache

Medium

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked Lists

This question is not likely to be asked in your Citrix interview

Pairs of Songs With Total Durations Divisible by 60

You are given a list of song durations. Find the number of pairs of songs whose total duration is divisible by 60.

Arrays

Not likely

If you have a Citrix interview, it's unlikely that you will get this question. Citrix does ask it, but it's rare

Medium

#6. Pairs of Songs With Total Durations Divisible by 60

Medium

You are given a list of song durations. Find the number of pairs of songs whose total duration is divisible by 60.

Arrays