1 result • Page 1 of 1
Showing : `BP`reset
1 result • Page 1 of 1

Recent Replies

Comment: Goldman Sachs, Summer Internship 2023 and Previosuly Asked Intern Questions, 202 by chiranjivi keshav • 0
time complexity for first question is nLog(n)    Explaination:     we can find min-max array using sliding window wit…
Answer: Flipkart , Online Assessment Questions (17th August 2023 | SDE Intern) | Items S by aryan jangra • 0
In which college were these questions asked? Does the difficulty level of quesstions changes depending upon what college they're asked …
Answer: PhonePe , Recent Online Assessment Questions | PhonePe Fun Day | Shortest God St by siister • 0
Question 1 Fun Day from collections import deque n=int(input()) x,y=list(map(int,input().split())) k=int(input()) n-=1 q=de…
Answer: Morgan Stanley | Online Assement by Odin • 0
I think question is wrong as in the accepted codes 5 7 1 0 -1 0 1 -1 0 2 -1 2 1 -1 1 3 -1 3 4 -1 4 0 -1 this test case gives -3 b…
Answer: Morgan Stanley | September, 2022 | Online Assessments by Deepa Pandey • 0
#include <bits/stdc++.h> using namespace std; int dp[1001][1001][2]; long long solve(vector<long long> &arr, long lo…
Answer: Morgan Stanley | Online Assement by Lokesh Wagh • 0
what about the cases where the cycles are merged?? i that case the answer regarding a single cycle will not work
Comment: Morgan Stanley | Online Assement by Believe_It • 0
Gives Memory Limit Exceeded.
Comment: Amazon Hack On Coding Round 28th May,2024 by Arpan • 70
They were from different sets
Answer: Salesforce OA | MNIT Jaipur | SWE Internship | 2023 | Kitty in horror house | Op by Arpan • 70
Problem 2: This problem can be solved by checking for very subarray .But you might think this will exceed time limit.Here is something i…
Answer: Salesforce OA | MNIT Jaipur | SWE Internship | 2023 | Kitty in horror house | Op by Arpan • 70
Problem 1: It can be solved using recursion .We will check at every index we are at if the string made till now is present in the dictiona…
Answer: Oracle, SDE-1 Interview Experience, On-Campus Server-Tech, IIT-BHU, December, 20 by Lokesh Wagh • 0
#include <bits/stdc++.h> using namespace std; void clear(stack<int>&st){   while(!st.empty()){     st.po…
Answer: DE SHAW OA | IIT Madras | SWE Internship | 2023 by Kaushan Dey • 30
Question 2 #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define vll vector&…
Comment: DE SHAW OA , VNIT Nagpur | SWE Internship, 2023 | SORT THE ARRAY by Shishir Shahi • 0
it should as for every index we are going through 9^3 of length at max , which makes  27*10^5 which is admissible