Upload Button Icon Add office photos

Filter interviews by

Clearwater Analytics Software Development Engineer Interview Questions and Answers

Updated 14 Feb 2024

Clearwater Analytics Software Development Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

It's based on a coding platform, the interviewer will be present while you're solving the coding problem.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Share your expertise so far
  • Q2. Expplain what all you have done and how you've contributed to the company.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Online test which can be attempted anytime between 22 May 2020, 06:00 AM and 25 May 2020, 01:00 AM

  • Q1. 

    Postfix Expression Evaluation Problem Statement

    Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...

  • Ans. 

    Evaluate postfix expressions by applying operators to operands in a given order.

    • Iterate through the postfix expression and push operands onto a stack

    • When an operator is encountered, pop the required number of operands from the stack, apply the operator, and push the result back onto the stack

    • Continue until the entire expression is evaluated and the final result is left on the stack

  • Answered by AI
  • Q2. 

    Dice Throws Problem Statement

    You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...

  • Ans. 

    The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the number of ways to achieve each sum with different number of dice.

    • Iterate through the dice and sum possibilities to fill up the array.

    • Return the result modulo 10^9 + 7.

    • Optimize the solution ...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

June 25 2020
Timing: 12:00 pm to 1:00 pm
This round was completely devoted to coding. I was asked to introduce myself and then 2 coding questions were asked.

  • Q1. 

    Find First and Last Positions of an Element in a Sorted Array

    Given a sorted array ARR consisting of N integers and an integer X, find the first and last positions of occurrence of X in the array.

    Note:

    ...
  • Ans. 

    Find the first and last positions of an element in a sorted array efficiently.

    • Use binary search to find the first occurrence of X in the array.

    • Use binary search to find the last occurrence of X in the array.

    • Handle cases where X is not present or present only once.

    • Return the first and last positions as 0-based indices.

  • Answered by AI
  • Q2. 

    Maze with N Doors and 1 Key Problem Statement

    You are given an N x N maze where some cells have doors, and you have a key that can be used only once to open a door. Determine if there exists a path from t...

  • Ans. 

    Determine if there exists a path from the top-left cell to the bottom-right cell of a maze with N doors and 1 key.

    • Use depth-first search (DFS) or breadth-first search (BFS) to explore possible paths through the maze.

    • Keep track of the cells visited and use the key only once to open doors.

    • Check if the bottom-right cell is reachable after traversing the maze.

    • Handle edge cases such as the top-left and bottom-right cells ha...

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

9th July 2020
6:30PM to 7:30PM

Round 4 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

23-July 2020
4:00 PM to 5:00 PM
Coding questions + Several questions on computer fundamentals and networking were asked in a rapid-fire manner.

  • Q1. 

    Stock Trading Maximum Profit Problem

    Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...

  • Ans. 

    The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.

    • Iterate through the stock prices and buy on the days when the price is lower than the next day's price, and sell on the days when the price is higher than the next day's price.

    • Calculate the profit by summing up the differences between buying and selling prices.

    • Repeat the process for each test case and output

  • Answered by AI
Round 5 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

6- Aug 2020
3:00 PM to 4:00 PM
Resceduled to: @5:30 PM
Projects, Fundamentals check, Behavioral, Coding

  • Q1. 

    Path Counting in Directed Graph

    Given a directed graph with a specified number of vertices V and edges E, your task is to calculate the total number of distinct paths from a given source node S to all ot...

  • Ans. 

    Calculate total number of distinct paths from a given source node to all other nodes in a directed graph.

    • Use dynamic programming to keep track of the number of paths from the source node to each node.

    • Consider the modulo operation to handle large numbers efficiently.

    • Start by initializing the number of paths from the source node to itself as 1.

    • Iterate through all edges and update the number of paths for each destination ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. Eligibility criteriaDevelopment skills and leadership principlesAmazon interview preparation:Topics to prepare for the interview - Data structures, OOPS, Operating systems, DBMS, NetworkingTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be confident while answering questions
Tip 2 : Make the interview conversational and Always keep a smiling face
Tip 3 : Ask something at the end of the interview which shows your interest in the company
Tip 4 : Prepare projects on the skills mentioned in the resume

Application resume tips for other job seekers

Tip 1 : Mention projects and internships.
Tip 2 : Keep your resume short and crisp.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

Two coding questions were asked and 90 minutes of time was allotted to solve both the problems

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it exists, add the pair to the result. If not, add the element to the hash set.

    • Handle cases where the same element is used twice to form a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path in the binary matrix.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse the matrix.

    • Return -1 if no valid path exists from source to destination.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The duration was approx 1 hour. The interview was taken by a young SDE-2.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the count of the corresponding character in the array.

    • Print the array of frequencies as the output.

  • Answered by AI
  • Q2. 

    Fire in the Cells Problem Statement

    Given a matrix MAT of size N * M, where each cell is either on fire or safe, determine if a person can reach an escape cell without being burnt. The person starts from ...

  • Ans. 

    Determine if a person can reach an escape cell without encountering fire in a matrix.

    • Check if the person can reach an escape cell without encountering fire by simulating the movement of the person and fire spread.

    • If the person can reach an escape cell, return the time taken; otherwise, return -1.

    • Consider the constraints and edge cases while implementing the solution.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

The interviewer introduced himself and asked me to introduce myself.
I told him about the different projects that I had done and the work in the previous company.
I had worked on AWS(Amazon Web Services) so he asked me all the AWS services that I had worked with and to explain one of them. 
I explained about the working of ECS(Elastic Container Service).
After this, he moved to the coding questions.

  • Q1. 

    Maximum 0-1 Distance Problem Statement

    Given a binary matrix of size N*M, find the maximum distance 'di' for every 0-cell to its nearest 1-cell, where the distance is measured using Manhattan distance. Th...

  • Ans. 

    Find the maximum Manhattan distance from a 0-cell to its nearest 1-cell in a binary matrix.

    • Iterate through the matrix to find all 0-cells and calculate their distances to nearest 1-cells using Manhattan distance formula

    • Keep track of the maximum distance found so far and update it if a larger distance is encountered

    • Return the maximum distance as the final result

  • Answered by AI
  • Q2. 

    Search for Indices with Given Difference and Distance

    You are provided with an array containing 'N' non-negative integers, along with two other non-negative integers 'K' and 'M'. Your task is to identify ...

  • Ans. 

    Find a pair of indices in an array with given difference and distance constraints.

    • Iterate through the array and check all possible pairs of indices to satisfy the conditions

    • Use nested loops to compare each pair of indices and their corresponding elements

    • Return 'valid' if a pair of indices is found that meets the conditions, otherwise return 'invalid'

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer was a very senior person with at least 10-15 years of experience. He introduced himself and asked me to tell him about myself. (Leadership principle questions followed)
 

  • Q1. 

    Special Binary Tree Problem Statement

    Determine whether an arbitrary binary tree is special. A binary tree is called special if every node in this tree has either zero or two children.

    Example:

    Input:
    ...
  • Ans. 

    Determine if a binary tree is special if every node has zero or two children.

    • Traverse the tree and check if each node has either 0 or 2 children.

    • Use a recursive approach to check children of each node.

    • If any node has only one child, return false immediately.

    • Example: For the given input, the output should be true.

  • Answered by AI
Round 5 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interview started with introductions and some Leadership principle questions. The interviewer was again a senior person with at least 10-15 years of experience.

I was asked to explain some AWS services.
He asked me to tell about a time when I had a tight deadline and how I worked during it.
He asked me about a time when I took initiative and came up with something new which helped the entire team.
I had prepared well for the LP questions and was able to answer everything.
After this, we move on to coding questions.

  • Q1. 

    Word Presence in Sentence

    Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.

    Input:

    The first line contains an in...
  • Ans. 

    Check if a given word is present in a sentence as a complete word.

    • Split the sentence into words using spaces as delimiter.

    • Check if the given word matches any of the words in the sentence.

    • Ensure that the word is not just a substring of another word in the sentence.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly.

    • Ensure to handle cache capacity by evicting the least recently used item when the cache is full.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Visvesvaraya National Institute Of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteriaNoneAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, Graphs, TreesTime required to prepare for the interview - 7 MonthsInterview preparation tips for other job seekers

Tip 1 : Start with the basics if you have lost touch with competitive coding. Don't directly jump to interview questions.
Tip 2 : Create a timetable and set goals. Keep aside 3-4 hours for studying. Consistency is the key.
Tip 3 : Focus on medium and hard questions. Solving a lot of easy questions doesn't help.

Application resume tips for other job seekers

Tip 1 : You should have good projects to showcase.
Tip 2 : Keep it clean and simple.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Ninja's Pattern with Powers of 2

    Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...

  • Ans. 

    Generate a pattern of numbers in rows following a specific sequence based on powers of 2.

    • Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.

    • Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.

    • Output the pattern for a given number 'N' of rows.

    • Example: For N = 4, the pattern would be 1, 23, 4567,

  • Answered by AI
  • Q2. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions based on ds and algorithms

  • Q1. 

    Zig-Zag Array Rearrangement

    You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...

  • Ans. 

    Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.

    • Iterate through the array and swap elements to satisfy the zig-zag condition.

    • Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].

    • Multiple correct answers may exist for a given array.

  • Answered by AI
  • Q2. 

    Flatten a Linked List

    You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT, pointing to the next node in the list, and CHILD, pointing to a linked list. Each child linke...

  • Ans. 

    Flatten a linked list of sorted child linked lists into a single sorted linked list.

    • Traverse the linked list and maintain a priority queue to keep track of the next smallest element.

    • Merge the child linked lists into the priority queue while traversing the main linked list.

    • Pop elements from the priority queue to create the final flattened linked list.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or all cells are water (0s).

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of unique paths for each cell in the matrix.

    • Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.

    • For each cell ...

  • Answered by AI
  • Q2. 

    Most Frequent Word Problem Statement

    You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...

  • Ans. 

    Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.

    • Split strings 'A' and 'B' into words

    • Count frequency of each word in 'A'

    • Check if word is not in 'B' and is the most frequent and lexicographically smallest

    • Return the word or -1 if no such word exists

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. 

    Find the area of the largest rectangle that can be formed within the bounds of a given histogram.

    • Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

    • Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.

    • Update the maximum area found so far and return it as the result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Data structures , oops, operating systems, database management system , algorithmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that

Application resume tips for other job seekers

Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.

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 - Assignment 

E-commerce

Interview Preparation Tips

Interview preparation tips for other job seekers - Work from home Jobs so I am software engineer Java

Interview Questionnaire 

3 Questions

  • Q1. Some question on KMP
  • Q2. Simulation Question
  • Q3. Topological Sort Question

Interview Preparation Tips

Round: Test
Experience: Simple
Tips: Online Coding Questions
Duration: 60 minutes

Round: Technical Interview
Experience: Moderately difficult
Tips: Thorough understanding of all the algorithms is required.

Round: Technical Interview
Experience: Easy
Tips: Need to start a question afresh without attacking it the way you have solved questions in the past

Round: Technical Interview
Experience: Easy/moderately difficult
Tips: The idea was not that easy to click.

Skills: Coding
College Name: IIT BOMBAY
Motivation: Facebook has revolutionised social networking.

Interview Questionnaire 

15 Questions

  • Q1. Indexes in mysql
  • Ans. 

    Indexes in MySQL are used to improve query performance by allowing faster data retrieval.

    • Indexes are created on one or more columns of a table.

    • They work by creating a separate data structure that allows for faster data retrieval.

    • Indexes can be created using the CREATE INDEX statement.

    • Indexes can also be dropped using the DROP INDEX statement.

    • Indexes can be used to speed up SELECT, UPDATE, and DELETE statements.

    • Indexes ...

  • Answered by AI
  • Q2. Difference between include_once and require_once?
  • Ans. 

    include_once and require_once are PHP functions used to include files. The difference is in how they handle errors.

    • include_once will only include the file once, and will not throw a fatal error if the file is not found

    • require_once will also only include the file once, but will throw a fatal error if the file is not found

    • Both functions are used to include files that contain functions or variables that are needed in the

  • Answered by AI
  • Q3. Constructor and destrutor?
  • Q4. Sessions vs cookie. Detailed discussion
  • Ans. 

    Sessions and cookies are both used for maintaining user state, but sessions are server-side and cookies are client-side.

    • Sessions store user data on the server, while cookies store data on the client's browser

    • Sessions are more secure than cookies because the data is not accessible to the client

    • Cookies can be used for tracking user behavior and preferences

    • Sessions are typically used for authentication and authorization p...

  • Answered by AI
  • Q5. Some questions on lucene, solr as it was mentioned in my resume
  • Q6. 8 ball puzzle
  • Q7. Design patterns?
  • Q8. Array of first n numbers.One number is missing.Find missing number?
  • Ans. 

    To find missing number in an array of first n numbers.

    • Calculate the sum of first n numbers using formula n*(n+1)/2

    • Calculate the sum of given array using loop

    • Subtract the sum of array from sum of first n numbers to get the missing number

  • Answered by AI
  • Q9. What is memcache. Some discussion around it
  • Q10. Design a database schema for a chat application where user can send message to an individual or in group
  • Ans. 

    Design a database schema for a chat application with individual and group messaging.

    • Create a 'users' table with unique user IDs

    • Create a 'messages' table with message IDs, sender and receiver IDs, message content, and timestamp

    • Create a 'groups' table with unique group IDs and group names

    • Create a 'group_members' table with group ID and user ID to track group membership

    • Use foreign keys to link tables together

    • Consider inde

  • Answered by AI
  • Q11. Write sql to retrieve all unread messages when user sign in
  • Ans. 

    SQL query to retrieve all unread messages upon user sign in

    • Use a JOIN statement to combine the messages and user tables

    • Filter the results to only show messages that have not been read by the user

    • Use the user's sign in information to identify which messages are unread

  • Answered by AI
  • Q12. Why do you want to join OLX?
  • Ans. 

    I am excited to join OLX because of its innovative approach to online marketplaces and its commitment to customer satisfaction.

    • I am impressed by OLX's user-friendly platform and its ability to connect buyers and sellers from all over the world.

    • I am excited to work with a team of talented developers who are passionate about creating cutting-edge technology.

    • I believe that OLX's focus on customer satisfaction aligns with ...

  • Answered by AI
  • Q13. What difficulties have you faced
  • Ans. 

    I have faced difficulties in debugging complex code and managing project timelines.

    • Debugging complex code with multiple dependencies

    • Managing project timelines with changing requirements

    • Working with legacy code and outdated technologies

    • Collaborating with team members in different time zones

    • Dealing with unexpected bugs and errors

  • Answered by AI
  • Q14. How is the Employee hierarchy in your current organization.Whom do you report to
  • Ans. 

    I report to the Technical Lead and am part of the development team.

    • I report to the Technical Lead

    • I am part of the development team

  • Answered by AI
  • Q15. How much is the web traffic on your site etc
  • Ans. 

    Our website receives an average of 10,000 unique visitors per day.

    • Our website has a steady flow of traffic with a consistent number of unique visitors per day.

    • We use Google Analytics to track our web traffic and analyze user behavior.

    • Our peak traffic times are during weekdays from 9am to 5pm.

    • We have noticed an increase in mobile traffic over the past year.

    • Our website's traffic is primarily driven by organic search and

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Round 4 with CTO :It was a normal discussion.

General Tips: I got a call through recruiter. My telephonic interview got scheduled. Overall process was very fast. It took not more than 3-4 days till I received offer letter.
Skills: Algorithm, Data structure, SQL
College Name: na

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .

  • Q1. 

    K Closest Points to Origin Problem Statement

    Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...

  • Ans. 

    Find the K closest points to the origin in a 2-D plane using Euclidean Distance.

    • Calculate the Euclidean Distance of each point from the origin

    • Sort the points based on their distances

    • Return the first K points as the closest neighbors

  • Answered by AI
  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Ans. 

    Generate the power set of a sorted array of integers with individually sorted subsets.

    • Use recursion to generate all possible subsets by including or excluding each element in the array.

    • Sort each subset before adding it to the power set.

    • Handle base cases for empty array and single element array.

    • Ensure the subsets are unique by using a set data structure.

    • Time complexity can be exponential due to the nature of generating

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Hard

This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

  • Q1. 

    Roman Numeral to Integer Conversion

    Convert a string representing a Roman numeral into its integer equivalent and return the result.

    Explanation:

    Roman numerals are represented by seven different symbol...

  • Ans. 

    Convert a Roman numeral string to its integer equivalent.

    • Create a mapping of Roman numeral symbols to their integer values.

    • Iterate through the input string and add the corresponding integer values.

    • Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.

  • Q1. 

    Arithmetic Expression Evaluation Problem Statement

    You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

  • Ans. 

    Evaluate arithmetic expressions in infix notation with given operators and precedence rules.

    • Parse the infix expression to postfix using a stack.

    • Evaluate the postfix expression using a stack.

    • Handle operator precedence and parentheses while evaluating.

    • Ensure no division by zero cases and operands fit in 32-bit integer.

  • Answered by AI
  • Q2. 

    Remove Duplicates from Sorted Array Problem Statement

    You are given a sorted integer array ARR of size N. Your task is to remove the duplicates in such a way that each element appears only once. The outpu...

  • Ans. 

    Remove duplicates from a sorted array in-place with O(1) extra memory.

    • Use two pointers - one for iterating through the array and another for placing unique elements.

    • Compare current element with next element to identify duplicates and skip them.

    • Update array in-place by moving unique elements to the front.

    • Return the length of the array after removal of duplicates.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .

  • Q1. How does Facebook store likes and dislikes?
  • Ans. 

    Facebook stores likes and dislikes using a combination of databases and algorithms.

    • Likes and dislikes are stored in databases such as MySQL or Cassandra.

    • Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.

    • User interactions with posts, pages, and ads are tracked to determine likes and dislikes.

    • Likes and dislikes may also be used to personalize the user's feed and target ads mor

  • Answered by AI
  • Q2. How does Facebook implement graph search?
  • Ans. 

    Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.

    • Facebook uses a graph database to store connections between users, pages, groups, etc.

    • The graph search algorithm traverses the graph to find relevant connections based on user queries.

    • It takes into account factors like user relationships, interests, and interactions to provide personalized sea

  • Answered by AI
Round 5 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.

  • Q1. What is Hadoop and why is it used?
  • Ans. 

    Hadoop is a framework for distributed storage and processing of large data sets.

    • Hadoop is used for storing and processing big data across a distributed network of computers.

    • It is based on the MapReduce programming model, which allows for parallel processing of data.

    • Hadoop consists of HDFS for storage and YARN for resource management.

    • It is used for tasks like data warehousing, log processing, recommendation systems, and...

  • Answered by AI
  • Q2. How does Facebook Chat work?
  • Ans. 

    Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.

    • Facebook Chat uses websockets for real-time communication between the client and server.

    • Long polling is used to check for new messages when websockets are not supported.

    • Push technology is used to notify users of new messages even when the chat window is not open.

    • Messages are stored in a database an...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 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

Clearwater Analytics Interview FAQs

How many rounds are there in Clearwater Analytics Software Development Engineer interview?
Clearwater Analytics interview process usually has 2 rounds. The most common rounds in the Clearwater Analytics interview process are Coding Test and One-on-one Round.
How to prepare for Clearwater Analytics Software Development Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Clearwater Analytics. The most common topics and skills that interviewers at Clearwater Analytics expect are Javascript, Data Structures, Agile, Web Development and Analytics.

Tell us how to improve this page.

Clearwater Analytics Software Development Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5.1k Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
Uplers Interview Questions
4.0
 • 41 Interviews
Yahoo Interview Questions
4.6
 • 29 Interviews
Shaadi.com Interview Questions
3.4
 • 28 Interviews
Tokopedia Interview Questions
4.1
 • 25 Interviews
View all
Clearwater Analytics Software Development Engineer Salary
based on 67 salaries
₹6.5 L/yr - ₹25 L/yr
14% more than the average Software Development Engineer Salary in India
View more details

Clearwater Analytics Software Development Engineer Reviews and Ratings

based on 6 reviews

2.5/5

Rating in categories

3.1

Skill development

2.9

Work-life balance

3.0

Salary

3.0

Job security

2.9

Company culture

2.0

Promotions

2.3

Work satisfaction

Explore 6 Reviews and Ratings
Reconciliation Analyst
95 salaries
unlock blur

₹4 L/yr - ₹8.5 L/yr

Software Development Engineer
67 salaries
unlock blur

₹6.5 L/yr - ₹25 L/yr

Software Development Engineer II
30 salaries
unlock blur

₹11 L/yr - ₹20 L/yr

Senior Software Development Engineer
30 salaries
unlock blur

₹25 L/yr - ₹58 L/yr

Financial Data Analyst
25 salaries
unlock blur

₹4 L/yr - ₹8 L/yr

Explore more salaries
Compare Clearwater Analytics with

Amazon

4.0
Compare

Uber

4.2
Compare

Fareportal

3.4
Compare

OLX

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