WellDev Ltd
Introduction
WellDev Ltd is a software company based in Zurich, Switzerland, specializing in software development and IT services. It has offices in Bangladesh (Dhaka), South Africa, Canada etc.
Interview Stages
- Initial Screening: After dropping CV they take a MCQ Round, almost every candidate gets an email for participation in this round.
- Round 1: The first round is a technical round and generally lasts for an hour.
- Round 2: The second round is divided into two part. The first part is a behavioural part taken by HR of the company. For the second part two software engineer conducts the technical sessions.
- COO Round: The final round is taken by the COO of the company
MCQ Round
A Broad Range of Topics
This round consisted of a multiple-choice questionnaire covering these topics. The test required me to share my screen with Quillgo and keep my camera on. It covers wide range of topics like JavaScript fundamentals, OOP, DBMS, SWE principles, Networking, Rest API knowledge, Analytical reasoning, DSA (time complexity, sorting, binary trees, MST, greedy algorithms).
First Round Questions
Hands-On Problem Solving
What will the output of this code in C Programming Language and why? Cint arr[3] = {1, 2, 3};
if(&arr[0] == &arr){
printf("They are the same!");
}else {
printf("Not same");
}
int arr[3] = {1, 2, 3};
if(&arr[0] == &arr){
printf("They are the same!");
}else {
printf("Not same");
}The name of the array is a pointer to the first item of the Array. So it will print "They are the same!"
Given an array, what will be the base address if we print the array name only (e.g., printf(ara))?
It will print the address of the first item of the array. In C, you can't pass array to functions by "Pass by value". So when you pass an array to an function (for example: printf(arr)), the compiler will actually pass the pointer to the first element. You can easily test this hypothesis by doing something like this:
int arr[1] = {100};
if(arr == &arr){
printf("Yay!\n");
}
if(arr == &arr[0]){
printf("Damn!");
}The above code should print
Yay!
Damn!pythonarr = [1, 2, 3, 4]
print(arr[2])
What is the time complexity of the print statement? if it's O(1) why is that? Is it the same case for Linked List? If it's not, why it isn't the same case?
arr = [1, 2, 3, 4]
print(arr[2])O(1) why is that? Is it the same case for Linked List? If it's not, why it isn't the same case?Tip: Learn about stack and heap memory and their use cases when memory is allocated. Learn about compile time and runtime memory allocation.
Can we run binary search on a sorted LinkedList? If we can, what issues we might face?
Hint: Think about how and why arrays can be divided easily but LinkedList can't be.
Write a code to delete the middle element of a stack without using any additional data structure while preserving the original order. Input: [1, 2, 3, 4, 5]. Output: [1, 2, 4, 5]
pythondef fn(n):
if n == 0:
return 0
return n + fn(n-1)
Given the above function, rename the function according to what the function tries to achive.
2nd Iteration: Write the same function but in a iterative manner. Does the both implementations have same Time Complexity and Space Complxity?
def fn(n):
if n == 0:
return 0
return n + fn(n-1)2nd Iteration: Write the same function but in a iterative manner. Does the both implementations have same Time Complexity and Space Complxity?Hint and Tips: Write down the stack trace of the recursive function and try to speak aloud while doing so. After getting what the function returns, rename the function accordingly.
For the second iterations, a simple loop will be the answer. However, think deeply about the fundamental difference between the two implementations. One of the implementation uses a Data structure, one doesn't. So their space complexity won't be same.
What is the time complexity of the following code? Cint fun(int n) {
if(n <= 1) return n;
int x = fun(n - 1);
int y = fun(n - 2);
return x + y;
}
int fun(int n) {
if(n <= 1) return n;
int x = fun(n - 1);
int y = fun(n - 2);
return x + y;
}Explain the order of SQL query execution (e.g., FROM, WHERE, GROUP BY, HAVING, SELECT).
Given a table with redundant data in multiple columns, how would you optimize it? (Hint: Normalization)
Given a Java code, identify issues that violate access modifiers.
Explain the basic concepts of Object-Oriented Programming (OOP).
What are the ACID properties in DBMS?
ACID is a set of properties of database transactions intended to guarantee data validity despite errors, power failures, and other mishaps. Databases that support this are called ACID compliance. The properties are
- Atomicity: Each statement in a transaction (to read, write, update or delete data) is treated as a single unit. Either the entire statement is executed, or none of it is executed.
- Consistency: Ensures the databases remain consistent following some predefined business logic both before and after the transaction
- Isolation: Each transaction executes in such a way that one is not affected by other s though they were occurring only one.
- Durability: The data changes by a successfull transaction is saved even in the event of system failure
IMPORTANT
Atomicity, isolation and durability are properties of the database, whereas consistency is a property of the application. The C in ACID was tossed in to make the acronym work. [ref: Martin Kleppmann, Designing Data Intensive Applications]
A basic GRE-like math question.
Write a SQL query to show all the duplicate rows in a table.
Can we make a stack with a queue?
Hint: Think multiple queue.
Second Round Questions
Write an API call to check whether the system is running properly and explain a GET API call.
Write a code to create a directory and a text file inside it with “Hello World” written.
What happens if two people try to reserve the same ticket simultaneously in a ticket reservation system? How would you solve this problem in a ticket management system? What will be your idea in this regard?
How many APIs are required to solve the above ticket reservation problem?
How can passwords be secured so that no one (even the administrator) can view them? How can password hashing be strengthened? What techniques do you know? (Hint: Salting and hashing techniques)
What is a trigger in DBMS, and what does cascading mean?
If we need to display a large amount of data on a website, what technique should be followed? (Hint: Pagination)
What happens when we browse a website? How are the contents rendered?
What is the difference between SQL and NoSQL?
For storing values from cache memory to RAM, should we use SQL or NoSQL?
Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.
// src: https://www.geeksforgeeks.org/largest-rectangular-area-in-a-histogram-using-stack/
int largestRectangleArea(vector<int>& hist) {
int n = hist.size();
stack<int> s;
int max_area = 0;
int tp;
int area_with_top;
int i = 0;
while (i < n) {
if (s.empty() || hist[s.top()] <= hist[i]){
s.push(i++);
} else {
tp = s.top();
s.pop();
area_with_top = hist[tp] * (s.empty() ? i : i - s.top() - 1);
max_area = max(max_area,area_with_top);
}
}
while (s.empty() == false) {
tp = s.top();
s.pop();
area_with_top = hist[tp] * (s.empty() ? i : i - s.top() - 1);
max_area = max(max_area,area_with_top);
}
return max_area;
}#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
const int MAX = 1e9+5;
const int N = 200005;
pii segtree[4*N];
int ara[N],n;
void build(int node,int l,int r ){
if( l == r ){
segtree[node] = {ara[l],l};
return;
}
int mid = (l+r)/2;
build(node*2,l,mid);
build(node*2+1,mid+1,r);
segtree[node] = min( segtree[node*2],segtree[node*2+1] );
}
pii query(int node,int L,int R,int l,int r){
if( l>R or r<L ) return {MAX,-1};
if( l>=L and r<=R ) return segtree[node];
int mid = (l+r)/2;
return min( query(node*2,L,R,l,mid), query(node*2+1,L,R,mid+1,r) );
}
ll getRect(int l,int r){
if( l>r ) return 0;
auto pp = query(1,l,r,0,n-1);
ll res = (r-l+1)*pp.F;
return max({ res, getRect(l,pp.S-1),getRect(pp.S+1,r) });
}
int main(){
cin>>n;
for(int i=0;i<n;i++) cin>>ara[i];
build(1,0,n-1);
cout<<getRect(0,n-1);
}You have a 100-story building, and two marbles. A marble will break if dropped from a certain height (from any floor). Find the highest floor you can lift by dropping or utilizing exactly two marbles.
Given a table with product_id, price, and product_name, write a query to find products with the same price.
What is the difference between DELETE, TRUNCATE, and DROP in SQL?
Explain threading in OOP.
How do you check for changes in a database?
Many questions from my CV (all practical, not just asking what you have done).
Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
void moveZeroes(vector<int>& nums) {
int i = 0;
for(int j=0;j<nums.size();j++){
swap(nums[i], nums[j]);
if( nums[i] != 0 ) i++;
}
}