Upload Button Icon Add office photos

Khoros

Compare button icon Compare button icon Compare

Filter interviews by

Khoros Software Engineer2 Interview Questions, Process, and Tips

Updated 21 Mar 2024

Khoros Software Engineer2 Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Mar 2023. There were 4 interview rounds.

Round 1 - Coding Test 

(1 Question)

  • 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
Round 2 - One-on-one 

(2 Questions)

  • 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
  • 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
Round 3 - One-on-one 

(2 Questions)

  • 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
  • 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
Round 4 - Behavioral 

(1 Question)

  • Q1. Discussion about the Projects

Skills evaluated in this interview

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. About projects

Interview Preparation Tips

Interview preparation tips for other job seekers - Be transparent and real. Don't bluff :)
Fingent has got a good number of people in the interview panel(my personal experience)
Even if you do not know the answer, the panel will explain it to you.

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.

  • Q1. 

    Valid Parentheses Problem Statement

    Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.

    Input:

    The first line contains an...
  • Ans. 

    The task is to determine if a given string of parentheses is balanced or not.

    • Iterate through the characters of the string and use a stack to keep track of opening parentheses.

    • When encountering an opening parenthesis, push it onto the stack. When encountering a closing parenthesis, check if it matches the top of the stack.

    • If the stack is empty at the end or there are unmatched parentheses, the string is not balanced.

    • Exa...

  • Answered by AI
  • Q2. 

    Palindrome Linked List Problem Statement

    Determine if a given singly linked list of integers is a palindrome. Return true if it is a palindrome, otherwise return false.

    Example:

    Input:
    1 -> 2 -> ...
  • Ans. 

    Check if a given singly linked list of integers is a palindrome.

    • Use two pointers to find the middle of the linked list.

    • Reverse the second half of the linked list.

    • Compare the first half with the reversed second half to determine if it is a palindrome.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical and managerial round. The interviewer gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.

  • Q1. What is a virtual function?
  • Ans. 

    A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.

    • Virtual functions allow for dynamic polymorphism in object-oriented programming.

    • They are used to achieve runtime polymorphism by enabling late binding.

    • Virtual functions are declared in a base class and can be overridden in derived classes.

    • Example: v...

  • Answered by AI
  • Q2. Can you explain how to perform a level order traversal of a binary tree in spiral form?
  • Ans. 

    Level order traversal of a binary tree in spiral form involves alternating between left and right while traversing each level.

    • Start by pushing the root node into a queue.

    • While the queue is not empty, pop a node, print its value, and push its children into the queue.

    • For each level, alternate between popping nodes from the queue and printing their values from left to right or right to left.

    • Continue this process until all

  • Answered by AI
  • Q3. What are abstract classes in C++?
  • Ans. 

    Abstract classes in C++ are classes that cannot be instantiated and are designed to be base classes for other classes.

    • Abstract classes may contain pure virtual functions, making them incomplete and unable to be instantiated.

    • Derived classes must implement all pure virtual functions from the abstract class in order to be concrete classes.

    • Abstract classes can have non-virtual functions and member variables like regular cl...

  • Answered by AI
Round 3 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was also a technical round. He asked to optimize the code I wrote in coding round. Then he asked me a few puzzles and questions on OOPS, OS and DBMS.

  • Q1. Can you explain the ACID properties in the context of database management systems?
  • Ans. 

    ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that either all operations in a transaction are completed successfully or none of them are.

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

    • Isolation ensures that the e...

  • Answered by AI
  • Q2. What is the difference between paging and segmentation in operating systems?
  • Ans. 

    Paging and segmentation are memory management techniques in operating systems.

    • Paging divides physical memory into fixed-size blocks called pages, while segmentation divides logical memory into variable-size segments.

    • Paging allows for efficient memory allocation and management, while segmentation provides protection and sharing of memory.

    • Paging is simpler to implement but can lead to internal fragmentation, while segmen...

  • Answered by AI
  • Q3. What is concurrency control?
  • Ans. 

    Concurrency control is a technique used in databases to manage simultaneous access and modification of data by multiple users or processes.

    • Concurrency control ensures that transactions are executed in a way that maintains data consistency and integrity.

    • Techniques like locking, timestamp ordering, and optimistic concurrency control are used to implement concurrency control.

    • For example, in a banking system, concurrency c...

  • Answered by AI
  • Q4. What is the difference between String Buffer and String Builder in Java?
  • Ans. 

    String Buffer is synchronized and thread-safe, while String Builder is not synchronized and faster.

    • String Buffer is synchronized, making it thread-safe for use in multi-threaded environments.

    • String Builder is not synchronized, resulting in faster performance but not thread-safe.

    • String Builder is preferred for single-threaded operations, while String Buffer is preferred for multi-threaded operations.

  • Answered by AI
  • Q5. What are smart pointers in C++?
  • Ans. 

    Smart pointers in C++ are objects that act like pointers but provide automatic memory management.

    • Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.

    • Examples include unique_ptr, shared_ptr, and weak_ptr.

    • unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.

  • Answered by AI
  • Q6. What is the difference between a mutex and a semaphore?
  • Ans. 

    Mutex is used for exclusive access to a resource, while semaphore is used for controlling access to a resource by multiple threads.

    • Mutex is binary and allows only one thread to access the resource at a time.

    • Semaphore can have a count greater than one, allowing multiple threads to access the resource simultaneously.

    • Mutex is typically used for protecting critical sections of code, while semaphore is used for synchronizat...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAYodlee interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Write a program for snake traversal of binary tree
  • Ans. 

    Program for snake traversal of binary tree

    • Use a stack to keep track of nodes to be visited

    • Start with the root node and push it onto the stack

    • While the stack is not empty, pop a node and print its value

    • If the level is even, push the left child first and then the right child onto the stack

    • If the level is odd, push the right child first and then the left child onto the stack

  • Answered by AI
  • Q2. To write code to check linked list is palindrome or not, in a single traversal and without using any other data structure
  • Ans. 

    Code to check if linked list is palindrome without using any other data structure and in a single traversal.

    • Traverse the linked list using two pointers, one slow and one fast

    • Reverse the first half of the linked list while traversing

    • Compare the reversed first half with the second half of the linked list

  • Answered by AI
  • Q3. Asked about OOPS concepts like abstraction, encapsulation, inheritance and polymorphism in detail and how they are implemented while programming

Interview Preparation Tips

Round: Test
Experience: It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
Coding part had questions like balanced parenthesis check, etc.


Round: Technical Interview
Experience: Technical and managerial. Gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
Then he asked 25 horses puzzle (-----.php/puzzles/25-horses-3-fastest-5-races-puzzle/). I solved it.
He then asked me to code it. I wrote an algorithm first and then the code. He was very impressed.
He asked about virtual functions, abstract classes, pure virtual functions.


Round: Technical Interview
Experience: He asked to optimize the code I wrote in coding round.
Then he asked me candle puzzle on how to measure 30 min and 45 min.
Then he asked me the chocolate puzzle (-----.html).
What is paging and segmentation?
What are ACID properties in DBMS?
What is transaction and how is concurrency control done?
What is the difference between string builder and string buffer?
What is string pool in java?
What is JVM, JRE, JDK?
Differentiate between mutex and semaphore?
Can you override private and static members?
Contiguous and non-contiguous memory allocation?
What are Smart pointers?


Skills:
College Name: NIT Jalandhar

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Apr 2022. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Programming basics questions
Round 2 - One-on-one 

(1 Question)

  • Q1. Details about work done

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what u do so that they get idea
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

30 mins interview. Asked about resume, APIs, Stack DSA question and one Sorting algorithm question.

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Hackerrank algorithms and ds test

Round 3 - One-on-one 

(1 Question)

  • Q1. Technical on java and aws
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jan 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Logical Reasoning, Questions on distances, Questions on directions

Round 2 - Coding Test 

1- Difference between array list and linked list.
2- Reverse the linked list

Round 3 - Coding Test 

1-Difference between Arraylist and Linked list.
2-Check if strings are anagram.

Interview Preparation Tips

Interview preparation tips for other job seekers - Study java OOPS concept, Collections and Basdic array and DS
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Nov 2023. There was 1 interview round.

Round 1 - Coding Test 

Basic maths question - given a number a and b get the nth number which is divisible by both a and b. And one sql query of concatinating the string in the column results.

Other - which movie you watched?
why do you watch?
who is your role model?
Why? What? How? Where?
Silly questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't join
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Sorting of an array
  • Q2. Bubble sorting algorithm
Round 2 - Technical 

(1 Question)

  • Q1. Java oops question
Round 3 - Technical 

(1 Question)

  • Q1. API questions related to put and patch api

Khoros Interview FAQs

How many rounds are there in Khoros Software Engineer2 interview?
Khoros interview process usually has 4 rounds. The most common rounds in the Khoros interview process are One-on-one Round, Coding Test and Behavioral.
What are the top questions asked in Khoros Software Engineer2 interview?

Some of the top questions asked at the Khoros Software Engineer2 interview -

  1. Generate the Permutations for the given Str...read more
  2. Cloning a Singly Linked List with Random Point...read more
  3. Zig Zag Tree Traver...read more

Tell us how to improve this page.

Khoros Software Engineer2 Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Fingent Interview Questions
4.4
 • 22 Interviews
Backbase Interview Questions
3.8
 • 22 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
Bottomline Interview Questions
3.3
 • 17 Interviews
ValGenesis Interview Questions
3.2
 • 17 Interviews
TEOCO Software Interview Questions
3.9
 • 14 Interviews
View all
Khoros Software Engineer2 Salary
based on 12 salaries
₹18 L/yr - ₹25.9 L/yr
9% more than the average Software Engineer2 Salary in India
View more details

Khoros Software Engineer2 Reviews and Ratings

based on 2 reviews

2.4/5

Rating in categories

1.0

Skill development

1.0

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 2 Reviews and Ratings
Technical Support Engineer
38 salaries
unlock blur

₹7.8 L/yr - ₹16.8 L/yr

Software Engineer III
28 salaries
unlock blur

₹25 L/yr - ₹40 L/yr

Associate Technical Support Engineer
24 salaries
unlock blur

₹7.6 L/yr - ₹10.5 L/yr

Software Engineer
20 salaries
unlock blur

₹7.8 L/yr - ₹25.2 L/yr

Software Engineer II
14 salaries
unlock blur

₹17 L/yr - ₹30 L/yr

Explore more salaries
Compare Khoros with

Yodlee

3.8
Compare

Fingent

4.4
Compare

Bravura Solutions

3.9
Compare

TEOCO Software

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview