## Citrix Interview Experience | Set 5 (On-Campus)

Round 1(2 hrs): It had two sections: 1. 50 Mcqs in 60 minutes. The questions included were related to networking, OS, quantitative aptitude, c, c++,… Read More »

- Number of substrings that start with "geeks" and end with "for"
- Count number of substrings of a string consisting of same characters
- Count all substrings having character K
- Lexicographically smallest string of length N and sum K
- Compare two strings considering only alphanumeric characters
- Minimum given operations required to convert a given binary string to all 1's
- Check duplicates in a stream of strings
- Queries for rotation and Kth character of the given string in constant time
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Print characters having even frequencies in order of occurrence
- Minimum cost to convert str1 to str2 with the given operations
- Reverse the given string in the range [L, R]
- Modulo of a large Binary String
- Check if expression contains redundant bracket or not | Set 2
- Reverse every word of the string except the first and the last character
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Largest substring of str2 which is a prefix of str1
- Find the character made by adding all the characters of the given string
- Find the occurrence of the given binary pattern in the binary representation of the array elements
- Print characters in decreasing order of frequency
- Longest substring such that no three consecutive characters are same
- Sort groups of numbers and characters separately in a String
- Expand the string according to the given conditions
- Find the number of strings formed using distinct characters of a given string
- Lexicographical ordering using Heap Sort
- Program to Encrypt a String using ! and @
- Concatenate the strings in an order which maximises the occurrence of subsequence "ab"
- Contiguous unique substrings with the given length L
- Minimum number of additons to make the string balanced

Round 1(2 hrs): It had two sections: 1. 50 Mcqs in 60 minutes. The questions included were related to networking, OS, quantitative aptitude, c, c++,… Read More »

Phone interview Deep copy of linked list Onsite interview Question on map reduce, find if all words in a file are palindrome Design Elevator with… Read More »

Given two sequences A, B, find out number of unique ways in sequence A, to form a subsequence of A that is identical to the… Read More »

To understand what a pangrammatic lipogram is we will break this term down into 2 terms i.e. a pangram and a lipogram Pangram: A pangram… Read More »

Given a string of characters of length less than 10. We need to print all the alpha-numeric abbreviation of the string. The alpha-numeric abbreviation is… Read More »

Given a string, the task is to return the length of its longest possible chunked palindrome. It means a palindrome formed by substring in the… Read More »

Given a binary string, task is to erase exactly one integer in the array so that the XOR of the remaining numbers is zero. The… Read More »

Given a string, we need to find the minimum number of rotations required to get the same string. Examples: Input : s = “geeks” Output… Read More »

Given a string, the task is to find the number of such balancing positions in the string from where the left and the right part… Read More »

You are given a string of 2N characters consisting of N ‘[‘ brackets and N ‘]’ brackets. A string is considered balanced if it can… Read More »

I was interviewed for Oracle Hyderabad for Java developer role. The interview was at Noida office. 1st round: Tell me about yourself. Programming questions on… Read More »

A null cipher, also known as concealment cipher, is an ancient form of encryption where the plaintext is mixed with a large amount of non-cipher… Read More »

Given an array of n words. Some words are repeated twice, we need count such words. Examples: Input : s[] = {“hate”, “love”, “peace”, “love”,… Read More »

Given a string consisting only of 1’s and 0’s. In one flip we can change any continuous sequence of this string. Find this minimum number… Read More »

Given a stream of characters and we have to find first non repeating character each time a character is inserted to the stream. Examples: Input… Read More »