Join Us0 Votes | 0 Replies
2 days ago 
Nishant Agarwal • 0
Request Recent Questions Now!
Filter Posts by Company
Amazon 80 Google 40 Oracle 34 Sprinklr 22 Microsoft 21 Uber 20 GoldmanSachs 20 CodeNation 17 deshaw 17 BNY-Mellon 16 Atlassian 15 Airtel 14 ZScaler 14 Flipkart 14 media.net 14 Cisco 13 DBOI 13 PhonePe 13 ByteDance 11 Adobe 10 Walmart 10 TCS 9 Intuit 9 VISA 8 PayPal 8 Razorpay 8 Publicis-Sapient 7 Zomato 7 Barclays 7 Increff 7 Tredence 7 GEDigital 6 Rubrik 6 Paytm 6 TVS 6 Salesforce 6 saplabs 6 Samsung 5 Amadeus 5 Cred 5 HCL 5 JP-Morgan 5 Sigmoid 5 Nvidia 5 standard-chartered 5 Juspay 5 Mastercard 5 thoughtspot 5 uipath 5 curefit 5 IBM 5 Apollo 5 Jaguar 5 graviton 5 Alphagrep 4 Trilogy-Innovations 4 Directi 4 Credit-Suisse 4 arcesium 4 Confluent 4 American-Express 4 Wells-Fargo 4 Juniper 4 Infosys 4 Morgan-Stanley 4 Avalara 4 Accenture 4 Deloitte 3 Tiktok 3 Appdynamics 3 Jio 3 CapitalOne 3 QuantBox 3 Goldman-Sachs 3 Navi 3 Hilabs 3 Swiggy 3 AQR 3 Piramal 3 Meesho 3 OYO 3 Contlo 3 British-Telecom 3 Linkedin 3 Palo-Alto-Networks 3 Citadel 3 Dassault-Systems 2 Mercari 2 MAQ-Software 2 Schrodinger 2 Persistent 2 CITI 2 Celigo 2 Hugosave 2 Air-India 2 DevRev 2 USTD3 2 relevel 2 ringcentral 2 ServiceNow 2 Nagarro 2 Gameskraft 2 MotorQ 2 Arzoo 2 Tekion 2 Qualcomm 2 DXC-Technology 2 Hexaware 2 shopconnect 2 Chargebee 2 HSBC 2 Mathworks 2 Dpworld 2 Edfora 2 Pine-Labs 1 makemytrip 1 Slice 1 Siemens 1 AMD 1 Rippling 1 Cogoport 1 Virtusa 1 Optum 1 Kickdrum 1 Truminds 1 Irage 1 Mentor-Graphics 1 wipro 1 Rakuten 1 colortokens 1 Toshiba 1 Edgeverve 1 Tibra 1 Factset 1 Winzo 1 Niro-Money 1 Natwest 1 Zepto 1 Chalo 1 Prograd 1 Tiger-Analytics 1 Bhanzu 1 Societe-Generale 1 Notion 1 Intel 1 Trianz-Digital 1 Webstaff 1 Veritas 1 Observe.ai 1 Tech-Mahindra 1 Audify-Tech 1 BP 1 Wissen-Technology 1 darwinbox 1 Blackrock 1 Morphel 1 Capgemini 1 urbancompany 1 Newfold - Digital 0 Steradian-Semiconductors 0 Medianet 0 LTI 0 Hitachi 0 Flexcar 0 Cognizant 0 Bank-of-America 0 Qburst 0 Hudson-River-Trading 0
Recent Replies
Answer: Amazon Hackon coding round problem | Character Traversal | Lamp and Houses by priyam169 • 10
Problem 2 : USING BINARY SEARCH INTUITION: Monotonous , Since if with distance k , every house can be lighted then wit…
Answer: Navi OA by Yuvraj singh Kanoujia • 0
I have a doubt in this problem as this same problem is also present in the leetcode Link:-Problem Link But the solution that …
Answer: Graphs Contest: Editorials by Manas Kumar Verma by Chinmay Ravi Jha • 0
What should I put in the "referral" field? Or keep it blank?
Answer: Tiktok Singapore | Online Assessment | Sep 2022 by Vibhaas Nirantar Srivastava • 0
The 9th testcase for Problem 1 are probably wrong, seeing that problem author himself has incorrect solution. Here is an alternate solution…
Answer: SAP | OA | 2023 by Avikam Bir • 10
import java.util.Scanner; public class MartinJogging { public static void main(String[] args) { …
Comment: Oracle | 13th October | Online Assessments | Decrypt by Tafheem Ahemad • 0
int solve(int a,int b,int c){ int ans=0; for(int i=0;i<31;i++){ if((c>&…
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, Recently asked On-Campus OAs in IIT-D on 30th October, 2022 by Vedant • 0
Please give the complete code
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: Zepto, Recently Asked On-Campus Questions in IITs, October 2022 | A Sum of Coins by Akshat • 0
@admin can you tell how can one get premium for TJO?
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Ranchi, just now
Bengaluru, 19 minutes ago
Chennai, 1 hour ago
Hyderabad, 2 hours ago
Bengaluru, 2 hours ago
Ranchi, just now Bengaluru, 19 minutes ago Chennai, 1 hour ago Hyderabad, 2 hours ago Bengaluru, 2 hours agoRecent Awards • All
Centurion to Nishant Agarwal • 0
Rising Star to Nishant Agarwal • 0
Appreciated to John 910
Great Question to John 910
Great Question to John 910
Great Question to Delta 2.9k
Popular Question to Lovish Dua • 20
Great Question to Delta 2.9k
Great Question to admin 1.6k
Great Question to admin 1.6k
