Latest
Topics
Tags
News
Jobs
Tutorials
Forum
Join Us
Community
Problems
New Post
Log In
New Post
Latest
News
Jobs
Tutorials
Forum
Tags
Planet
Users
Log In
Sign Up
REGISTER NOW
Register Now
Request Recent Questions Now!
Limit to: all time
all time
today
this week
this month
this year
1 result • Page
1 of 1
Sort by: Default
Default
Post Creation date
Recent Activity
Views
Votes
Replies
Showing :
Leetcode
•
reset
0
Votes
0
Replies
10
Views
Thoughtspot | Online Assessment | 11th August | IIT BHU | Count subarrays with median k
0 Votes | 0 Replies
on-campus
Leetcode
thoughtspot
23 months ago
Laal_hai
• 0
1 result • Page
1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon
81
Google
40
Oracle
38
Sprinklr
22
Microsoft
21
Uber
20
GoldmanSachs
20
deshaw
17
CodeNation
17
Cisco
16
BNY-Mellon
16
Walmart
15
Atlassian
15
VISA
14
media.net
14
ZScaler
14
Flipkart
14
Airtel
14
DBOI
13
PhonePe
13
Paytm
11
ByteDance
11
Adobe
10
TCS
9
Intuit
9
Razorpay
8
PayPal
8
Tredence
7
Barclays
7
Publicis-Sapient
7
Amadeus
7
Zomato
7
Increff
7
Cred
7
Salesforce
6
GEDigital
6
TVS
6
Morgan-Stanley
6
saplabs
6
Rubrik
6
Credit-Suisse
6
Mastercard
5
thoughtspot
5
uipath
5
Apollo
5
curefit
5
IBM
5
Juspay
5
HCL
5
QuantBox
5
Sigmoid
5
Samsung
5
Nvidia
5
JP-Morgan
5
Jaguar
5
graviton
5
standard-chartered
5
Directi
4
Trilogy-Innovations
4
Confluent
4
Infosys
4
Hilabs
4
Palo-Alto-Networks
4
Juniper
4
American-Express
4
Alphagrep
4
arcesium
4
Avalara
4
Wells-Fargo
4
Accenture
4
Hugosave
3
Tiktok
3
Linkedin
3
Goldman-Sachs
3
British-Telecom
3
Niro-Money
3
Contlo
3
Qualcomm
3
CapitalOne
3
Jio
3
Meesho
3
OYO
3
Appdynamics
3
Deloitte
3
Swiggy
3
Navi
3
DevRev
3
AQR
3
Citadel
3
Piramal
3
Persistent
2
Air-India
2
Celigo
2
Gameskraft
2
MAQ-Software
2
Nagarro
2
Mathworks
2
Edfora
2
CITI
2
USTD3
2
Schrodinger
2
ringcentral
2
Mercari
2
MotorQ
2
Arzoo
2
ServiceNow
2
Chargebee
2
Dpworld
2
DXC-Technology
2
Tekion
2
shopconnect
2
Hexaware
2
Dassault-Systems
2
HSBC
2
relevel
2
Natwest
1
Audify-Tech
1
Zepto
1
Capgemini
1
Optum
1
Virtusa
1
Cogoport
1
Rippling
1
AMD
1
Slice
1
Pine-Labs
1
Tech-Mahindra
1
Observe.ai
1
Intel
1
Bhanzu
1
Chalo
1
Factset
1
Tibra
1
Edgeverve
1
Toshiba
1
colortokens
1
Mentor-Graphics
1
Irage
1
urbancompany
1
darwinbox
1
Blackrock
1
Morphel
1
Rakuten
1
Winzo
1
wipro
1
Prograd
1
Tiger-Analytics
1
Societe-Generale
1
Notion
1
Trianz-Digital
1
Webstaff
1
Veritas
1
makemytrip
1
Siemens
1
BP
1
Wissen-Technology
1
Kickdrum
1
Truminds
1
Medianet
0
Flexcar
0
Cognizant
0
Steradian-Semiconductors
0
Hudson-River-Trading
0
Qburst
0
Bank-of-America
0
LTI
0
Hitachi
0
Newfold - Digital
0
Recent Replies
Answer: Amazon Hack On Coding Round 28th May,2024
by
ANIRUDH
• 0
Problem 2 Project Management Solution : Dynamic Programming with Binary Search This is the most efficient and standard so…
Answer: Question from my last OA, Infeneon
by
AG
• 0
Can anybody solve it
Answer: Chargebee | 29 Sept | Internship | Online Assessments
by
Jay Samir Shah
• 0
the ans 1 3 1 is also valid for the first test case right?, yet it gives wrong ans. i have used sliding window for at each iterati…
Answer: Media.Net OA | XOR Subsequence | Help your Master 2 | Space Race 2025 | SRM | FT
by
Swagatika Rout
• 0
#include <bits/stdc++.h> using namespace std; #define MOD 1000000007 #define pii pair<int,int> #define ll long long in…
Answer: Alphagrep | IIT Madras | OA | 2023
by
Adarsh Maurya
• 0
first of all we have to store the unique values in an array in sorted order , as we know ,the values which are same will follow the same pa…
Comment: Media.Net OA | Help Your Master| XOR Subsequences | Read Books nCdKd | IIIT Lu
by
Ansh Patel
• 0
In Q2. We can use DP with states as dp[prev][xor_value] as boolean telling that is it possible to get xor_value with prev value... &…
Answer: Zomato, Recently Asked Questions in IITs, November, 2022 | Friends | The XOR Ope
by
Pankaj Kumar
• 0
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nul…
Answer: Goldman Sachs , Recent Online Assessment Questions | ASCII Encoded Strings | 20
by
Hrishabh Patel
• 10
#include<bits/stdc++.h> using namespace std; string decode(string &encoded){ string ans = ""; reverse(encoded.begin…
Answer: Goldman Sachs, Recent Online Assessment Questions | Encryption Validity | 2023
by
Hrishabh Patel
• 10
#include <bits/stdc++.h> using namespace std; vector<int> encryptionValidity(int instructionCount, int validityPeriod, in…
Answer: DE Shaw (DESIS Ascend) , Online Assessment Question (17th September 2023) | find
by
Shreyash Verma
• 0
Solution using Binary Search on Answers #include <bits/stdc++.h> using namespace std; #define ll long lo…
Comment: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr
by
a aryan
• 0
efficient simple way i store the val of each node in val array that i will get while backtracking and then check for no.of steps requ…
Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr
by
a aryan
• 0
#include <bits/stdc++.h> using namespace std; void dfs(int v,int par,vector<int> &val,vector<vector<int>>…
Comment: Google | Complex Subsequence | Subtree XOR
by
..
• 0
#include <bits/stdc++.h> using namespace std; #define int long long int binexp(int n, int e, int m = 1000000007) { …
Comment: Google Interview Experience | 2023 Graduate Offcampus
by
Aditya Kumar
• 0
void Spidycoder() { string s; cin >> s; int n = s.size(); int q; cin >> q; vector> v; for (int i = 0; i < q; i+…
Answer: Google | OA | 2022 | Balanced brackets | Maximize equal numbers | Diagonal numbe
by
Sourav Mohapatra
• 0
Problem 1: <code> #include <bits/stdc++.h> using namespace std; using ll = long long; void solve() { &n…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Top Problem Solvers
Claim your TJO hamper 🎁
Loading...
This Month
Recent Votes
Answer: Oracle, SDE-1 Interview Experience, On-Campus Server-Tech, IIT-BHU, December, 20
Google 2023 Summer Internship Interview Experience
Comment: RazorPay Online Assessment 22nd September
Answer: Goldman Sachs, Recent Online Assessment Questions | Encryption Validity | 2023
Media.Net OA | XOR Subsequence | Help your Master 2 | Space Race 2025 | SRM | FTE | 1st August 2023
Media.Net OA | Help Your Master| XOR Subsequences | Read Books nCdKd | IIIT Lucknow | 25th July 2023
Answer: Google | Complex Subsequence | Subtree XOR
Answer: Media.net OA IIT Roorkee 29th September 2023
AlgoUniversity Technology Fellowship: Stage 2 || Important Questions
Goldman Sachs, Recent Online Assessment Questions | Encryption Validity | 2023
Recent Locations
Noida,
just now
Prayagraj,
1 minute ago
Agra,
1 minute ago
Patna,
1 minute ago
Le Chesnay,
2 minutes ago
Recent Awards
• All
Appreciated
to
admin
1.7k
Great Question
to
John
940
Great Question
to
John
940
Great Question
to
admin
1.7k
Great Question
to
xINFERNOx
• 40
Appreciated
to
PoGo
2.4k
Appreciated
to
PoGo
2.4k
Great Question
to
PoGo
2.4k
Great Question
to
PoGo
2.4k
Great Question
to
PoGo
2.4k
1