Join Us1 Vote | 0 Replies
11 weeks ago 
namansingh.singh9 • 30
4 Votes | 0 Replies
3 months ago 
messiah 150
3 Votes | 1 Reply
0 Votes | 0 Replies
0 Votes | 0 Replies
19 months ago 
mrinal.shashwat • 30
0 Votes | 0 Replies
19 months ago 
mod2 • 830
0 Votes | 0 Replies
19 months ago mod2 • 830
0 Votes | 2 Replies
21 months ago 
admin 1.1k
0 Votes | 3 Replies
22 months ago admin 1.1k • updated 22 months ago 
_______________ • 40
0 Votes | 0 Replies
0 Votes | 0 Replies
23 months ago admin 1.1k
0 Votes | 0 Replies
24 months ago mod2 • 830
0 Votes | 1 Reply
24 months ago mod2 • 830 • updated 15 months ago 
Vasu Bansal • 0
13 Votes | 8 Replies
9 Votes | 5 Replies
0 Votes | 0 Replies
1 Vote | 1 Reply
2.0 years ago 
utopia • 120 • updated 16 months ago Vasu Bansal • 0
3 Votes | 0 Replies
2.0 years ago 
Shubhendu Goel • 430 • updated 2.0 years ago admin 1.1k
1 Vote | 2 Replies
2.1 years ago mod2 • 830 • updated 24 months ago 
mishra.saurabh7f • 30
1 Vote | 0 Replies
2.2 years ago Shubhendu Goel • 430 • updated 2.2 years ago admin 1.1k
1 Vote | 0 Replies
2.2 years ago mod2 • 830
4 Votes | 1 Reply
2.2 years ago mod2 • 830
1 Vote | 0 Replies
2.3 years ago mod2 • 830
Join us on Telegram for instant updates
Contest Registration Successful!
You have successfully registered to our first ever Exclusive Contest!
We will reach out to you on your registered Email ID regarding the contest details.
Our First Ever Contest
FAANG Contest SeriesFilter Posts by Company
Amazon 29 Google 28 Uber 10 ByteDance 10 TCS 9 Sprinklr 9 CodeNation 8 Adobe 7 Oracle 7 Microsoft 7 Publicis-Sapient 6 JP-Morgan 5 Atlassian 5 Paytm 5 PayPal 5 Walmart 5 Cred 4 PhonePe 4 standard-chartered 4 Flipkart 4 Zomato 4 Avalara 4 Morgan-Stanley 3 Credit-Suisse 3 Tiktok 3 VISA 3 Salesforce 3 Intuit 2 Nagarro 2 Jaguar 2 Rubrik 2 OYO 2 Chargebee 2 Hexaware 2 Razorpay 2 Cisco 2 Mastercard 2 Gameskraft 2 BNY-Mellon 2 relevel 2 Jio 2 Dassault-Systems 2 HSBC 2 Alphagrep 2 Wells-Fargo 2 Hilabs 2 Qualcomm 2 Accenture 2 Navi 2 AMD 1 Trilogy-Innovations 1 American-Express 1 Infosys 1 Apollo 1 Virtusa 1 Juspay 1 Goldman-Sachs 1 Rippling 1 Optum 1 Slice 1 Appdynamics 1 CITI 1 Bhanzu 1 Pine-Labs 1 Audify-Tech 1 wipro 1 Medianet 1 Tech-Mahindra 1 Palo-Alto-Networks 1 Observe.ai 1 Capgemini 1 Barclays 1 Zepto 1 Intel 1 Confluent 1 HCL 1 IBM 1 uipath 1 Cogoport 1 Swiggy 1 ZScaler 1 saplabs 1 Qburst 0 Hitachi 0 Flexcar 0 LTI 0 Hudson-River-Trading 0 Toshiba 0 Cognizant 0
Recent Votes
Recent Locations • All 
codingkaro.in, 7 hours ago
Delhi, 1 day ago
Bangalore, 5 days ago
Nagpur, 27 days ago
India, 5 weeks ago
codingkaro.in, 7 hours ago Delhi, 1 day ago Bangalore, 5 days ago Nagpur, 27 days ago India, 5 weeks agoRecent Awards • All
Student to Aman Pratap Singh • 30
Good Question to shahinmansoori28 • 50
Teacher to eulersgamma • 40
Student to shahinmansoori28 • 50
Teacher to Gurankit Pal Singh 110
Good Question to Nitin Kumar • 50
Scholar to Gurankit Pal Singh 110
Recent Replies
Answer: Microsoft OA Nov 2022 IITB by Lokesh 230
**Q2** ***` Solution:`*** - Order {`i,j,k`} doesn't matter, so sort arrays `A, B, C` - Initially, find the number of elements in `C` great…
Answer: Microsoft OA Nov 2022 IITB by Lokesh 230
**Q1** ***`Solution`*** - As written by Sahil Just consider the elements x, where `x=a[i]=b[i]` And find the minimum missing positive ele…
Comment: Microsoft OA Nov 2022 IITB by Sahil • 40
For all indices i such that A[i]=B[i] , put A[i] in an array and then find the first missing positive in the new array. You can use [this][…
Answer: Bhanzu OA by Ujjwal Srivastava 160
## Question 3 ## **Overview** - Given an integer array **A** of length **N** and the sum of the elements of this array is **X**. - You …
Comment: Bhanzu OA by kb • 10
Thanks for posting the solution of Question 1 !! Could you please post solutions for Questions 2 and 3 as well @Manas-2756
Answer: Bhanzu OA by Manas 150
**Question 1** * Solution : We are given an array of starting and ending positions of the jumps. For all jumps one gold coin is added to a…
Answer: BNY Mellon, Recently Asked Questions in IIT-G, November, 2022 by Manas 150
**Question 1** * Observation 1 - There can be n final positions at max, all that matters is if a position is possible or not, if a positio…
Answer: Morgan Stanley, Recent On-Campus Assessments Asked in IIT-M, November, 2022 by Manas 150
**Question 1** The Question can be easily solved using a hash_map. We would maintain 2 hash maps for each array. In each hash_map we will …
Answer: Oracle, Asked for On-campus Assessments at NIT-K, October, 2022 by Manas 150
**Solution** * Observation 1 - It can be noted that if we have 3 continuous numbers which have the same MSB (most significant bit), i.e 3 c…
