Cloudstrats Technologies Data Analyst Interview Questions and Answers

Q1. DAX Related Syntax and Codes
Add your answer
Q2. Data Modelling, SQL, Python
Add your answer

Q1. No Response from HR after calling of selection after Round 1
Add your answer

Q1. Self introduction
Add your answer
Q2. What is mean by aml
Ans. 
AML stands for Anti-Money Laundering, which refers to a set of laws, regulations, and procedures designed to prevent criminals from disguising illegally obtained funds as legitimate income.
• AML is a regulatory framework used by financial institutions to detect and prevent money laundering activities.

• It involves monitoring customer transactions and reporting any suspicious activity to authorities.

• Examples of AML measures...read more
Answered by AI
Add your answer

Q1. What are the different kinds of joins
Ans. 
Different kinds of joins include inner join, outer join, left join, and right join.
• Inner join: Returns only the rows that have matching values in both tables.

• Outer join: Returns all rows when there is a match in one of the tables.

• Left join: Returns all rows from the left table and the matched rows from the right table.

• Right join: Returns all rows from the right table and the matched rows from the left table.
Answered by AI
Add your answer
Q2. What is the difference between columns and measures in power BI
Ans. 
Columns are the fields in a dataset, while measures are calculations based on those fields in Power BI.
• Columns are the raw data fields in a dataset, such as 'Sales Amount' or 'Product Category'.

• Measures are calculations performed on columns, like sum, average, count, etc.

• Measures are created using DAX (Data Analysis Expressions) in Power BI.

• Columns are used for grouping, filtering, and slicing data, while measures are
Answered by AI
Add your answer
Q3. How can you remove duplicates in sql
Ans. 
Use the DISTINCT keyword in a SELECT statement to remove duplicates in SQL.
• Use the DISTINCT keyword in a SELECT statement to retrieve unique values.

• Example: SELECT DISTINCT column_name FROM table_name;

• Another way is to use the GROUP BY clause to remove duplicates.

• Example: SELECT column_name FROM table_name GROUP BY column_name;
Answered by AI
Add your answer

Q1. Interesting facts about ourselves
Add your answer
Q2. Introduced about ourselves
Add your answer

It was not easy only people can clear who are better in pandas and numpy

Q1. Mostly focus on graphs and dp
Add your answer

First round is Dax,2 nd is SQL queries,3 is python

Q1. Mostly from basic sql
Add your answer

Q1. Mostly basic sql
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were around 30 questions ranging from DBMS, OOPS + 2 coding questions to be solved in 90 minutes. MCQ's were easy to solve as they had been covered in my college's curriculum. It was a webcam monitored test.

Q1. Chocolate Problem
Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number...read more
Ans. Recursion
The idea is that generate all the possible subsets of size ‘M’ and checks the minimum difference that can be possible from all subsets. 
 
1. This problem can be solved using recursion and the idea behind this is to generate all the possible minimum differences from the given array.
2. To store minimum difference we use a variable (say, ‘minVal’) and the initial value is ‘INFINITE’
3. For each element we will hav...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Ninja and substrings
Ninja has been given a string 'STR' containing only lowercase alphabetic characters. Ninja has to find the number of all the different possible substrings of size two that appe...read more
Ans.  Brute Force
The basic idea is to iterate through the ‘STR’ and store all the substrings of size 2 in a HashSet and finally return the size of this HashSet.
 
The steps are as follows:
 
1. Declare a HashSet ’DIFFERENT_SUB_STRINGS’ in which we will store all the substrings of size 2.
2. Run a loop from ‘i’ = 0 to length of ’STR’ - 1:
   1. Add substring of ’STR’ from ’i’ to ’i’ + 1 in ’DIFFERENT_SUB_STRINGS’.
3. Finally, return the...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 50 minutes
Round difficulty - Medium

This was a technical round. I got the call after getting shortlisted in the Aptitude + Coding test. This round lasted for 50 minutes and started around 12 PM. The meeting was conducted on a Microsoft Teams call. 
I was asked questions based on my resume and my projects for the most part of the interview. Towards the end of the interview, I was asked 1 Problem based on Prefix arrays. Initially I presented the brute force O(N*2) solution followed by the optimal O(N) solution. This round went good for me.

Q1. Time To Burn Tree
You have been given a binary tree of 'N' unique nodes and a Start node from where the tree will start to burn. Given that the Start node will always exist in the tree, your task i...read more
Ans. Using BFS
The idea is to first create an undirected graph of the given binary tree and then doing a bfs traversal of the undirected graph starting from the start node. We will keep a variable ‘count’ that will be incremented at each level of bfs traversal. ‘count-1’ is the required time needed to burn the whole tree.
 
Algorithm
 
• Initialize an unordered map ‘M’ that maps from integer to array of integers that sto...read more
Answered by CodingNinjas
View 2 more amswers