Khoros Interview Questions, Process, and Tips

Once your CV is shortlisted then they will send you one online aptitude test link.
You will have 20 minutes to answer 40 questions.

Q1. Will ask some technical questions. And one coding questin (LC easy/medium).
Add your answer
Q2. Remove duplicates from the array
Ans. 
Remove duplicates from an array
• Use a hash table to keep track of seen elements

• Iterate through the array and add non-duplicate elements to a new array

• Use the Set data structure to remove duplicates
Answered by AI
Add your answer

Q1. Behavioral questions. * What is your role in your team? * What are your strength and weaknesses? * Why you are looking for a change?
Add your answer

Q1. Normal Discussion. Why do you want to change? Why do you want to join us?
Add your answer

Q1. Check Valid Anagrams
Ans. 
Check if two strings are valid anagrams of each other
• Create a character count map for each string

• Compare the character count maps to check if they are equal

• Return true if they are valid anagrams, false otherwise
Answered by AI
Add your answer

Q1. Zig Zag Tree Traversal
Ans. 
Zig Zag Tree Traversal is a method of traversing a binary tree in a zig-zag pattern.
• Start traversal from the root node

• Alternate between going left and right at each level

• Use a stack or queue data structure for traversal

• Example: For a binary tree with nodes 1, 2, 3, 4, 5, the zig-zag traversal would be 1, 3, 2, 4, 5
Answered by AI
Add your answer
Q2. Cloning a Singly Linked List with Random Pointers
Ans. 
Cloning a singly linked list with random pointers involves creating a deep copy of the list while maintaining the random pointers.
• Create a new node for each node in the original list and insert it next to the original node.

• Update the random pointers of the new nodes to point to the corresponding new nodes.

• Separate the original and cloned lists by adjusting the next pointers.
Answered by AI
Add your answer

Q1. Generate the Permutations for the given String
Ans. 
Generate permutations of a given string
• Use recursion to generate all possible permutations

• Swap characters in the string to create different permutations

• Base case: when the string length is 1, return the string as a permutation
Answered by AI
Add your answer
Q2. Maximum in a Sliding Window
Ans. 
Find the maximum value in a sliding window of a given size in an array.
• Use a deque to store indices of elements in the current window

• Keep the deque sorted in decreasing order of element values

• Pop elements from the deque that are out of the current window

• The front of the deque will always have the maximum element in the window
Answered by AI
Add your answer

Q1. Discussion about the Projects
Add your answer

Easy & Medium Java programs

Q1. Java programs and java concepts
Add your answer

It's just to access candidates vocabulary , logical and reasoning skills

Q1. 1)Roles and responsibilities 2)Java basic questions 3)Coding - Interviewer will be guiding and assisting you incase you are stuck with syntax .Be logically correct !
Add your answer