i
Dotnik Studio
Filter interviews by
Be the first one to contribute and help others!
Assignment Round - Complete the assignment within 3 days.
I applied via LinkedIn and was interviewed in Apr 2022. There were 4 interview rounds.
MENTAL FAMILIY RELATION
I applied via Walk-in and was interviewed before May 2023. There were 2 interview rounds.
Virtual Dom is a lightweight copy of the Real Dom, used for efficient updates in web development.
Virtual Dom is a lightweight copy of the Real Dom, used for efficient updates in web development.
Real Dom represents the actual structure of the web page, while Virtual Dom is a simplified version stored in memory.
Changes made to the Virtual Dom are compared with the Real Dom to determine the minimum number of updates neede...
posted on 16 Sep 2023
I applied via Referral and was interviewed before Sep 2022. There were 4 interview rounds.
Aptitude test and coding test
I applied via LinkedIn and was interviewed before Oct 2023. There were 3 interview rounds.
I am certified in AWS Certified Solutions Architect - Associate and Google Cloud Certified - Professional Cloud Architect.
Certified in AWS Certified Solutions Architect - Associate
Certified in Google Cloud Certified - Professional Cloud Architect
Questions about projects, DI in ASP.NET Core, React Element Tree
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Medium
The test consists of 2 sections: MCQ’s and 3 coding questions. It was a 90 minutes test, which could be started anytime between the time window of 2 hrs (In my case window was open from 4 PM to 6 PM). The test was proctored and any suspicious activity would have cancelled our test.
Rafiq loves to play with piles of dominoes, especially when they are of equal heights. His father gifted him 'N' piles of dominoes, each with a positive number of stacke...
Calculate minimum cost to make consecutive windows of domino piles equal in height.
Iterate through each window of size K and calculate the minimum cost to make piles equal in height.
Keep track of the running sum of domino heights in each window.
For each window, find the median height and calculate the cost to make all piles equal to the median height.
Ninja is creating a new game ‘String Ka Khel’ for his gaming shop. In this game, players are given ‘N’ strings. The objective is to find the maximum length of strings that...
Compute the maximum length of a string that can be formed by joining given strings based on a specific condition.
Iterate through each string and store the count of strings ending with 'R' and 'B'.
Check if there are any strings ending with 'R' and 'B' that can be combined to form a longer string.
Return the maximum length of the string that can be formed or 0 if no combination is possible.
Given an integer array ARR
of length N
where ARR[i] = (2*i + 1)
, determine the minimum number of operations required to make all the elements of ARR
equal. In a single...
The minimum number of operations required to make all elements of the given array equal.
Calculate the target value as the sum of all elements divided by the length of the array.
Find the absolute difference between each element and the target value to determine the number of operations needed.
Return the sum of all absolute differences as the minimum number of operations required.
Round duration - 60 Minutes
Round difficulty - Medium
It was a 60 minutes video call round held on Google Meet.The Interviewer was very helpful.
You are given two integers, X
and N
. Your task is to compute the value of X
raised to the power of N
(i.e., X^N
).
The first line contains an integer T
, the number of tes...
Compute the value of X raised to the power of N for given integers X and N.
Read the number of test cases T
For each test case, read the values of X and N
Calculate X^N for each test case
Print the result of X^N for each test case
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with methods getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in O(1) time complexity.
Handle edge cases like empty stack appropriately.
Implement the logic for each operation as specified in the question.
Test the implementation w...
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'.
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 exists in a hash set.
Sort the pairs based on the first element and then the second element.
Use a hash set to store elements as you iterate through the array to avoid duplicates.
Return the list of pairs that satisfy the sum condition.
Round duration - 60 Minutes
Round difficulty - Medium
You are provided with an infinite sorted array that consists exclusively of 0s followed by 1s. Your task is to determine the index of the first occurr...
Find the index of the first occurrence of 1 in an infinite sorted 0-1 array.
Use binary search to efficiently find the index of the first occurrence of 1.
Keep doubling the search range until you find a range that contains 1.
Update the search range based on the value at the mid index.
Return the index of the first occurrence of 1 once found.
Tip 1 : Do at least two good projects relevant to the company and role applying for.
Tip 2 : Always read the job description carefully and do some research about the company
Tip 3 : Have a good knowledge of Computer Science fundamentals.
Tip 1 : Include some relevant skills required in the job description.
Tip 2 : Make a single-page resume.
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
based on 2 reviews
Rating in categories
QuickRide
Tech Formation
sysotel.ai
Sekel Technologies