Note : If you find any solutions here similar to what you people had written previously during the test then check them properly you might have missed to add suttle things like long long , and so on.
Credits :
Solutions in c++ provided by : Nishant Mohan
Solutions in python provided by : Yash Nandwana
Editorialist : Calan Pereira
MCQ’s :
Blockchain :
DSA :
General Reasoning :
Maths (AI/ML):
DBMS / Networking / Security :
DML(Data Manipulation Language)
Query
Relational Schema
DDL(Data Definition Language) (Correct answer)
OS / Hardware :
Microprocessor
Microcontroller (Correct answer)
Microcomputer
System On Chip (SoC).
NVMe SSD < SATA HDD < SATA SSD
SATA HDD < SATA SSD < NVMe SSD (Correct answer)
SATA SSD < NVMe SSD < SATA HDD
SATA HDD < NVMe SSD < SATA SSD.
Linux :
When the user is running as root.
after running the sudo su command successfully.
Both are true. (Correct answer)
None are true.
a UNIX system.
a UNIX like system. (Correct answer)
a UNIX descendent system.
a UNIX system predecessor.
Devops :
cri-o
lxc
mesos (Correct answer)
ansible
Distributes client requests or network load efficiently across multiple servers
Ensures high availability and reliability by sending requests only to servers that are online
Provides the flexibility to add or subtract servers as demand dictates
None of these (Correct answer)
Backend :
HTTP API
REST API
SOAP API
None of these (Correct answer)
Front End :
span (Correct answer)
div
container
textarea
Coding Problem :
Solution in cpp :
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
map<int,int>mapm;
int ans = -1;
for(int i = 0; i < n ; i++){
cin >> arr[i];
mapm[arr[i]]++;
if(mapm[arr[i]]==2){ans = arr[i];}
}
cout << ans << endl;
}
Solution in python :
n = int(input())
a = sorted(list(map(int, input().split())))
ans = None
for i in range(n - 1):
if a[i] == a[i + 1]:
ans = a[i]
break
print(ans)
C++ Solution :
#include<bits/stdc++.h>
using namespace std;
int main(){
long long x, p;
cin >> x >> p;
cout << p-x+1 << endl;
return 0;
}
Solution in python :
n, p = map(int, input().split())
print(p - n + 1)
Solution in c++ :
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
for(int i = 0; i < n ; i++){
cin >> arr[i];
}
sort(arr,arr+n);
int mid = (n+1)/2;
mid--;
cout << arr[mid] << endl;
}
Solution in python :
n = int(input())
a = list(map(int, input().split()))
a.sort()
print(a[n // 2])
Solution in c++ :
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s = "orz";
int k = 0;
for(int i = 0; i < n; i++){
k = n-i;
k--;
// k counts the spaces we have to print befor printing the "orz.." string!
while(k--){cout << " ";}
cout << s << endl;
s += "orz";
} return 0;
}
Solution in python :
n = int(input())
for i in range(1, n + 1):
print((n - i) * " " + i * "orz")
Solution in c++ :
#include<bits/stdc++.h>
using namespace std;
int main(){
long long x; cin >> x;
long long mul =1;
bool cond = false;
// x+2 because if mul can be x+1 then also we can get our answer!
while(mul<= x+2){
if(mul-1==x){cond = true;}
mul = 2*mul;
}
if(cond){cout << "YES";} else{cout << "NO";}
cout << endl;
}
Solution in python :
n = int(input())
if not ((n + 1) & n):
print("YES")
else:
print("NO")
Solution in c++ :
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin >> n;
long long int arr[n];
for(int i = 0; i < n ; i++){
cin >> arr[i];
}
long long int ans = -999999;
long long int sum = 0;
for(int i = 0;i < n ;i++){
sum+=arr[i];
ans = max(ans,sum);
if(sum<0){sum = 0;}
}
cout << ans << endl;
}
Solution in python :
n = int(input())
a = list(map(int, input().split(" ")))
max_so_far = -1e18 - 1
max_ending_here = 0
for i in range(n):
max_ending_here = max_ending_here + a[i]
if (max_so_far < max_ending_here):
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
print(max_so_far)