890 results • Page 1 of 23
Interview questions
0 Votes | 0 Replies
24 days ago
Rashi Raj
• 0
Phonepe OA
1 Vote | 2 Replies
12 weeks ago
buzz
• 10
IBM INTERVIEW QUESTIONS
0 Votes | 0 Replies
3 months ago
Akansha
• 0
Zomato OA 2024
1 Vote | 0 Replies
3 months ago
hiiiii
• 10
Consulting Engineer
0 Votes | 0 Replies
3 months ago
Ajay Kumar
• 0
PhonePe OA | NSUT | 17th July 2024
2 Votes | 0 Replies
3 months ago
Akshit Singhal
• 20
Premium User at TJO
2 Votes | 0 Replies
3 months ago
Aryan Mishra
• 20
String replacement
1 Vote | 0 Replies
3 months ago
bhooli
• 10
DE shaw latest questions
0 Votes | 1 Reply
4 months ago
Hritik Kumar
• 0
Amazon Hack On Coding Round 28th May,2024
4 Votes | 3 Replies
4 months ago
Arpan
• 70
Job: Comprar Ozempic Online
0 Votes | 0 Replies
7 months ago
Test
• 0
Public Post: Mastercard Internship OA September 2023
0 Votes | 0 Replies
10 months ago
Vedant
• 0
How to get Premium access?
8 Votes | 2 Replies
11 months ago
Jaskaran Kamboj
• 80
Oracle Online Test
1 Vote | 0 Replies
11 months ago
Likitha M
• 10
axis bank test
0 Votes | 0 Replies
12 months ago
xor
• 0
890 results • Page 1 of 23
Request Recent Questions Now!
Filter Posts by Company
Amazon 59 Google 40 Oracle 25 Sprinklr 21 Microsoft 21 Uber 20 GoldmanSachs 20 deshaw 17 CodeNation 17 BNY-Mellon 16 Atlassian 15 media.net 14 Airtel 14 ZScaler 14 DBOI 13 Cisco 13 PhonePe 11 Flipkart 11 Adobe 10 Walmart 10 ByteDance 10 Intuit 9 TCS 9 PayPal 8 Razorpay 8 VISA 8 Barclays 7 Tredence 7 Zomato 7 Publicis-Sapient 7 Salesforce 6 GEDigital 6 saplabs 6 Rubrik 6 Paytm 6 TVS 6 Mastercard 5 Sigmoid 5 JP-Morgan 5 Jaguar 5 IBM 5 Samsung 5 Apollo 5 Nvidia 5 curefit 5 uipath 5 standard-chartered 5 Cred 4 American-Express 4 Trilogy-Innovations 4 thoughtspot 4 Directi 4 Infosys 4 Avalara 4 Wells-Fargo 4 Accenture 4 Juspay 4 Morgan-Stanley 4 arcesium 4 Amadeus 4 Alphagrep 4 Juniper 4 Linkedin 3 OYO 3 Contlo 3 British-Telecom 3 Palo-Alto-Networks 3 Navi 3 Tiktok 3 Jio 3 Piramal 3 Citadel 3 Appdynamics 3 AQR 3 CapitalOne 3 graviton 3 Credit-Suisse 3 Goldman-Sachs 3 Hilabs 3 Swiggy 3 MotorQ 2 Nagarro 2 Chargebee 2 Hexaware 2 Gameskraft 2 relevel 2 Dassault-Systems 2 HSBC 2 Qualcomm 2 Confluent 2 Arzoo 2 ringcentral 2 Schrodinger 2 Edfora 2 Persistent 2 Meesho 2 Celigo 2 Mathworks 2 CITI 2 Tekion 2 shopconnect 2 USTD3 2 ServiceNow 2 Mercari 2 MAQ-Software 2 Hugosave 2 DXC-Technology 2 Dpworld 2 Air-India 2 DevRev 2 Deloitte 2 Winzo 1 Natwest 1 wipro 1 colortokens 1 Prograd 1 Toshiba 1 HCL 1 Tiger-Analytics 1 Kickdrum 1 Societe-Generale 1 Notion 1 Rakuten 1 QuantBox 1 Wissen-Technology 1 Capgemini 1 Morphel 1 Blackrock 1 darwinbox 1 urbancompany 1 Irage 1 Mentor-Graphics 1 Edgeverve 1 Trianz-Digital 1 Tibra 1 Truminds 1 Webstaff 1 Veritas 1 Factset 1 Niro-Money 1 Chalo 1 Increff 1 Bhanzu 1 Intel 1 makemytrip 1 Observe.ai 1 Tech-Mahindra 1 Siemens 1 Pine-Labs 1 Slice 1 AMD 1 Zepto 1 Rippling 1 Cogoport 1 Virtusa 1 Optum 1 Audify-Tech 1 BP 1 Medianet 0 Cognizant 0 Hudson-River-Trading 0 Steradian-Semiconductors 0 Newfold - Digital 0 Flexcar 0 Bank-of-America 0 LTI 0 Hitachi 0 Qburst 0

Recent Replies

Answer: ThoughtSpot , Online Assessment (IIT Kanpur) | Cover them All | Flip Operations by Sahil Das • 10
Flip Operations Solution-> #include<bits/stdc++.h> using namespace std; class Solution { public:     int n; &n…
Answer: Webstaff, Web Developer Test, Online Assignment Test (20/9/2023) | Hiring Drive by Mousam Kumari • 0
Code of above ⬆ it will give tle please optimize it. #include<bits/stdc++.h> using namespace std; #define int long long in…
Answer: GE Digital - Set 2 | NIT Jamshedpur 2023 | Number Game | Equations and queries by yash • 0
#include <iostream> #include <vector> using namespace std;   const int MOD = 1e9 + 7; const int MAX_N = 100…
Comment: Uber OA (on campus) | 6 Month Intern by Md Nihal • 0
no you can move in any 4 directions it will cover only 2 directions left and down
Answer: Uber OA (on campus) | 6 Month Intern by Md Nihal • 0
 1. #include<bits/stdc++.h> using namespace std; void __solve() { int n, m; cin >> n >> m; vector&l…
Comment: Goldman Sachs | 30th September | Online Coding Rounds | Traveler Fund | Jewelle by mhdi • 0
I guess we can also solve using tries. we will count the longest branch with consicutive end points.
Comment: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by Nalluri Uday Subrahmanya Kishore • 0
The TC of your algorithm is exponential as we end up adding n^(m) elements to the queue  
Comment: Google | Complex Subsequence | Subtree XOR by Vivek • 0
code you provide a code for this :)  
Answer: AQR, Recent Online Assessment Questions (30th August 2023) | Program to accept ( by Ignotus2614 • 0
from collections import deque dx = [1, 1, -1, -1] dy = [-1, 1, 1, -1] def read_input():     n = int(input())     vec …
Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by Rishikesh • 0
Bro, I found it. the test case's expected output is wrong try changing the condition of when 2 heros occur at same coordinate (p1 occur…
Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by Rishikesh • 0
Bro, same issueee here did you find why were you getting WA on 17?
Comment: CRED | 20th October | Online Assessments by jolly • 0
did u check for the and ?? , as I think question is stating about a marathon meaning each node is visited only once during a path from star…
Comment: Flipkart | October, 2022 | Interview Questions by jolly • 0
can anyone share testcase 2 as the code for same is working on leetcode for same problem but failing here so I wanna know what is the testc…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now
Top Problem Solvers
This Month
Meet the Champions