Cred Interview process and experience for Automation Engineer.
Round 1 (Online Coding Assessment):
It was a 105-minute online proctored test conducted on the platform, HackerRank. It had 3 DSA-based coding questions.
Question 1:
CID Episode 100:
Dr. Salunkhe has a floor of size N x M in his chemical lab, where each tile's size is 1x1. If a drop of chemical solution falls on a tile, then it will combine to form a bigger drop if there is some chemical solution drop in an adjacent tile sharing a common side.
Note: If chemical solution drops fall on the same tile, the size remains the same.
Constraints:
1 ≤ N×M ≤ 2×105
1 ≤ x ≤ N
1 ≤ y ≤ M
Input:
- The first line contains three integers N, M, and Q, where:
- N is the number of rows,
- M is the number of columns,
- Q is the number of queries.
- The next `Q` lines represent the queries of two types:
- d x y: A drop is dripped at tile (x, y).
- c: Output the number of distinct drop areas (connected components of drops) on the floor so far.
Output:
For each query of type c, print the number of distinct connected drop areas on the floor.
Question 2:
No Pairs Allowed:
For each word in a list of words, if any two adjacent characters are equal, change one of them. Determine the minimum number of substitutions so the final string contains no adjacent equal characters.
Constraints:
1 ≤ n ≤ 100
1 ≤ length of words[i] ≤ 100
Solution Can Be Found Here: Solution Link
Question 3:
Go Green Marathon
Link To Problem: https://thejoboverflow.com/problem/126/
