AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clearwater Analytics Software Development Engineer Interview Questions and Answers
Clearwater Analytics Software Development Engineer Interview Experiences
1 interview found
vedika saxena
It's based on a coding platform, the interviewer will be present while you're solving the coding problem.
(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
Anonymous
I appeared for an interview before Sep 2020.
(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 ...
- 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
(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
Nrows andMcolumns, 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...
- Q2.
Largest Rectangle in Histogram Problem Statement
You are given an array/list
...HEIGHTSof lengthN, 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.
Interview Preparation Tips
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
Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT
Skills evaluated in this interview
I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.
E-commerce
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(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,
- 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
(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 elementARR[... - 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.
- 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, andCHILD, 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.
(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
Nrows andMcolumns, 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).
Interview Preparation Tips
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
Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects
Skills evaluated in this interview
I appeared for an interview in Sep 2020.
(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
ARRof lengthNand an integerTarget, your task is to return all pairs of elements such that they add up to theTarget.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.
- Q2.
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size
N * Mwhere 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.
(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.
- Q2.
Fire in the Cells Problem Statement
Given a matrix
MATof sizeN * 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.
(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
- 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'
(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.
(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.
- 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.
Interview Preparation Tips
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.
Tip 1 : You should have good projects to showcase.
Tip 2 : Keep it clean and simple.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(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
- Q2.
Dice Throws Problem Statement
You are given
Ddice, each havingFfaces numbered from 1 toF. 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 ...
(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
ARRconsisting ofNintegers and an integerX, find the first and last positions of occurrence ofXin 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.
- 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...
Round duration - 60 minutes
Round difficulty - Medium
9th July 2020
6:30PM to 7:30PM
(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
(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
Vand edgesE, your task is to calculate the total number of distinct paths from a given source nodeSto 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 ...
Interview Preparation Tips
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
Tip 1 : Mention projects and internships.
Tip 2 : Keep your resume short and crisp.
Skills evaluated in this interview
SAMKIT JAIN
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
- 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.
- 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)]
- 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
- 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 ...
- 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.
- 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)
Interview Preparation Tips
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
Interview Questionnaire
2 Questions
- Q1. Design Facebook
- Ans.
Designing Facebook involves creating a social networking platform with features like user profiles, news feed, messaging, and more.
Create a user registration and login system
Develop a news feed algorithm to display relevant content
Implement a messaging system for users to communicate
Design a user profile page with customizable options
Incorporate features like groups, events, and pages
Ensure scalability and security of
- Q2. Reverse the linked list
- Ans.
Reverse a linked list
Iterative approach using three pointers
Recursive approach with base case and recursive call
In-place reversal using stack
Interview Preparation Tips
Skills evaluated in this interview
Selected
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
(1 Question)
- Q1. Asked DSA array questions
Interview Preparation Tips
Selected
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
(4 Questions)
- Q1. Behavioural questions were asked
- Q2. What are your expectations from this job
- Q3. What are your plans ahead
- Q4. Where do you see yourself in 5 years ahead
Interview Preparation Tips
Clearwater Analytics Interview FAQs
Tell us how to improve this page.
Clearwater Analytics Interviews By Designations
- Clearwater Analytics Reconciliation Analyst Interview Questions
- Clearwater Analytics Implementation Analyst Interview Questions
- Clearwater Analytics Software Engineer Interview Questions
- Clearwater Analytics Software Developer Interview Questions
- Clearwater Analytics Senior Associate Interview Questions
- Clearwater Analytics Software Development Engineer Interview Questions
- Clearwater Analytics Financial Data Analyst Interview Questions
- Clearwater Analytics Process Specialist SME Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Clearwater Analytics Software Development Engineer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Clearwater Analytics Software Development Engineer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Reconciliation Analyst
95
salaries
|  ₹4 L/yr - ₹8.5 L/yr |
|
Software Development Engineer
67
salaries
| ₹6.5 L/yr - ₹25 L/yr |
|
Senior Software Development Engineer
30
salaries
| ₹25 L/yr - ₹58 L/yr |
|
Software Development Engineer II
30
salaries
| ₹11 L/yr - ₹20 L/yr |
|
Financial Data Analyst
26
salaries
| ₹4 L/yr - ₹8 L/yr |
Amazon
Uber
Fareportal
OLX
- Home >
- Interviews >
- Clearwater Analytics Interview Questions >
- Clearwater Analytics Software Development Engineer Interview Questions
