Software Engineer Intern @BuiltVisor Pvt. Ltd. || Full Stack(MERN) Developer
BuiltVisor Pvt. Ltd. - SWE Intern
Mahatma Jyotiba Phule Rohilkhand University 2024
My Stats
EXP gained
21450
Level
7 (Expert)
Community stats
Discussions
2
5
Know more
Weekend contest rating
Contest attended
Problems solved
2021 2023
Better than %
Weekend contest rating
Contest attended
Problems solved
2021 2023
Better than %
410
Total problems solved
259
Easy
124
Moderate
27
Hard
0
Ninja

Current streak:

1 day

Longest streak:

6 days

Less

More

Achievements
5
Ronin
Topics
Binary Search Trees
Trees
+ 3 more
4
Samurai
Topics
Arrays
Sorting
Strings
+ 1 more
1
Sensei
Topics
1
Sensei
Guided path
+ 1 more
Discussions
Partially Accepted Solution 10/11 Test Cases solved
Interview problems

Very Easy to Understand C++ Solution

``````#include <bits/stdc++.h>
vector<int> maxOfSubarray(vector<int> nums, int n, int k)
{
vector<int> ans;
for(int i = 0; i<n-k+1; i++){
int Max=INT_MIN;
for(int j = 0; j<k; j++){
Max=max(Max,nums[i+j]);
}
ans.push_back(Max);
}
return ans;
}``````
Published On 23-Oct-2023
34 views
1 replies
SQL Easy to understand Solution
Interview problems
``````select '[0-5>' as bin,
count() as total from sessions where duration >= 0 and duration<300
union
select '[5-10>' as bin,
count(1)as total from sessions where duration >= 300 and duration<600
union
select '[10-15>' as bin,
count(1) as total from sessions where duration >= 600 and duration <900
union
select '15 or more' as bin,
count(1) as total from sessions where duration >= 900``````
Published On 11-Sep-2023
255 views
0 replies
very easy to understand c++ solution
Interview problems
``````#include <bits/stdc++.h>
void helper(vector<vector<int>>&mat, int i, int j,int m, int n, vector<int>&curr, vector<vector<int>>&v){
curr.push_back(mat[i][j]);
if(i == m-1 and j == n-1){
v.push_back(curr);
curr.pop_back();
return;
}

if(i+1 < m) helper(mat,i+1,j,m,n,curr,v);
if(j+1 < n) helper(mat,i,j+1,m,n,curr,v);
curr.pop_back();
}
vector<vector <int> > printAllpaths(vector<vector<int> > & mat , int m , int n)
{
vector<vector<int>>v;
vector<int> curr;
helper(mat, 0, 0, m, n, curr, v);
return v;
}
``````
Published On 17-Aug-2023
35 views
0 replies
Quick Sort C++ Solution with High element as pivot
Interview problems
``````#include <bits/stdc++.h>
int partition(vector<int>&arr, int low, int high){
int pivot = arr[high];
int i = low-1;
for(int j = low; j<high; j++){
if(arr[j]<pivot){
i++;
swap(arr[i],arr[j]);
}
}
swap(arr[i+1],arr[high]);
return i+1;
}

void QuickSort(vector<int>&arr,int low, int high){
if(low>high)return;
int pi = partition(arr, low, high);
QuickSort(arr,low,pi-1);
QuickSort(arr,pi+1,high);
}
vector<int> quickSort(vector<int> arr)
{
int n = arr.size();
QuickSort(arr,0,n-1);
return arr;
}``````
Published On 05-Aug-2023
117 views
0 replies