Request Recent Questions Now!
Filter Posts by Company
Amazon 57 Google 38 Oracle 25 Microsoft 21 Sprinklr 21 GoldmanSachs 20 Uber 20 BNY-Mellon 16 deshaw 16 CodeNation 16 Atlassian 15 ZScaler 14 media.net 14 Airtel 14 Cisco 13 DBOI 13 Flipkart 11 PhonePe 10 Walmart 10 Adobe 10 ByteDance 10 Intuit 9 TCS 9 Razorpay 8 VISA 8 PayPal 8 Zomato 7 Barclays 7 Publicis-Sapient 7 saplabs 6 Salesforce 6 Paytm 6 TVS 6 Rubrik 6 GEDigital 6 Tredence 6 Jaguar 5 Apollo 5 JP-Morgan 5 Sigmoid 5 IBM 5 Samsung 5 Nvidia 5 standard-chartered 5 Mastercard 5 uipath 5 curefit 5 Accenture 4 Juniper 4 thoughtspot 4 Avalara 4 Cred 4 Wells-Fargo 4 Juspay 4 arcesium 4 Directi 4 Morgan-Stanley 4 Alphagrep 4 American-Express 4 Trilogy-Innovations 4 Goldman-Sachs 3 Tiktok 3 Linkedin 3 Navi 3 Piramal 3 OYO 3 Amadeus 3 Palo-Alto-Networks 3 Appdynamics 3 Swiggy 3 AQR 3 Jio 3 Hilabs 3 Credit-Suisse 3 CapitalOne 3 Contlo 3 British-Telecom 3 shopconnect 2 Nagarro 2 Chargebee 2 Hexaware 2 Gameskraft 2 relevel 2 Dassault-Systems 2 HSBC 2 Qualcomm 2 Confluent 2 Infosys 2 Arzoo 2 MotorQ 2 ringcentral 2 Schrodinger 2 Edfora 2 Persistent 2 Meesho 2 Celigo 2 graviton 2 Mathworks 2 CITI 2 Tekion 2 USTD3 2 ServiceNow 2 Mercari 2 MAQ-Software 2 Hugosave 2 DXC-Technology 2 Dpworld 2 Citadel 2 Air-India 2 Irage 1 Mentor-Graphics 1 DevRev 1 colortokens 1 Winzo 1 Toshiba 1 Natwest 1 Kickdrum 1 HCL 1 Rakuten 1 QuantBox 1 Morphel 1 Blackrock 1 darwinbox 1 Truminds 1 wipro 1 urbancompany 1 Edgeverve 1 Prograd 1 Tibra 1 BP 1 Deloitte 1 Tiger-Analytics 1 Zepto 1 Factset 1 Societe-Generale 1 Notion 1 Niro-Money 1 Chalo 1 Trianz-Digital 1 Increff 1 Wissen-Technology 1 Audify-Tech 1 Webstaff 1 Veritas 1 Bhanzu 1 Intel 1 Capgemini 1 Observe.ai 1 Tech-Mahindra 1 Pine-Labs 1 Slice 1 makemytrip 1 AMD 1 Rippling 1 Cogoport 1 Siemens 1 Virtusa 1 Optum 1 Medianet 0 Qburst 0 Cognizant 0 Newfold - Digital 0 Steradian-Semiconductors 0 LTI 0 Hitachi 0 Hudson-River-Trading 0 Bank-of-America 0 Flexcar 0

Recent Replies

Comment: Sprinklr, Online Assessment | Splitting edges | Kevin's small talk | Profits | by Sumit Das • 30
Profits:   #include <bits/stdc++.h> using namespace std; #define int long long signed main(){     int n,k;   &…
Comment: Sprinklr, Online Assessment | Splitting edges | Kevin's small talk | Profits | by Sumit Das • 30
Splitting Edges:   #include <bits/stdc++.h> using namespace std; #define int long long vector<vector<int>> adj; v…
Answer: Amazon | 10th October | Online Assessments | Good String by AYUSH KUMAR • 0
Q1, Solution:  Intuition and Explanation Problem Understanding The task involves handling two types of queries on a string of lower…
Answer: ZScaler, Online Assessments Questions | Maximum Distinct | Perfect Pairs | Shopp by Abhishek Gupta • 30
Maxium Distinct #include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back using pi = pair<in…
Answer: ZSCALER, Online Assessment Questions | BITS Archive | 2023 by Abhishek Gupta • 30
Solution- analysis- The question asks to find number of pairs for which [a|b] + [a&b]…
Answer: Microsoft OA Nov 2022 IITB by Adarsh Sen Singh • 0
Sir can u provide me test case 8 , i am getting failed over there.
Answer: Oracle, Recent Online Assessment Questions (30th August 2023) | Optimal Points S by Prasad Vavdane • 0
Can anyone provide apporch or code for Subsequences Sort which was able to clear all the test cases 
Answer: TCS NQT | 9th October | Online Assessment by Banavathu. Lakshmi • 10
n=int(input()) arr=list(map(int,input().split())) arr.sort() for i in range(1,n):     if arr[i]<=arr[i-1]:     …
Answer: Google | OA | 2022 | Balanced brackets | Maximize equal numbers | Diagonal numbe by Mayank Jain • 10
Problem 2 Used a Sliding window kind of approach import java.util.*; public class Main { public static void main(String[] arg…
Answer: Amazon | 10th October | Online Assessments | Good String by compiler • 0
Question 4: i may be wrong for input s = ba output should be = ba not ab   #include<bits/stdc++.h> using names…
Answer: Amazon | 10th October | Online Assessments | Good String by compiler • 0
Question 3: sample Input: 3 0 1 1 2 3 0 0 sample output: 3 code: #include<bits/stdc++.h> using namespace std;…
Answer: Tibra Australia | Quant Trader Developer | Online Assessment | Maximum Path | by Viraj Dhirajbhai Pansuriya • 10
Question 2: Maximum Path.. Intuition:  you hvae to keep track of 2 variables : depth and side where from depth you can find starting…
Comment: Google Interview Experience | 2023 Graduate Offcampus by Ashutosh Saini • 10
Should not the overall TC be: O(N*M*log(k)), 

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now
Top Problem Solvers
This Month