TheJobOverflow

Only Premium Users can view the Question

Only Premium Users can view the Question

Request Recent Questions Now!

Showing : flipkart • reset

47 Votes | 14 Replies

free-public-post product interview Flipkart coding-round

2 Votes | 0 Replies

FTE sde OA sde1 Flipkart

22 months ago

Jatin Gupta • 20

6 Votes | 4 Replies

on-campus coding-round Flipkart free-public-post

0 Votes | 1 Reply

off-campus coding-round free-public-post Flipkart

14 Votes | 7 Replies

free-public-post flipkart on-campus coding-round

8 Votes | 2 Replies

coding-round Flipkart free-public-post on-campus

26 Votes | 13 Replies

free-public-post coding-round on-campus Flipkart

2 Votes | 1 Reply

on-campus free-public-post flipkart

9 Votes | 4 Replies

on-campus free-public-post OA flipkart IIT

15 Votes | 3 Replies

product on-campus free-public-post flipkart coding-round

4 Votes | 5 Replies

flipkart coding-round off-campus hackathon free-public-post

11 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: Microsoft , Recent Online Assessment (18th August 2023) | Car Manufacturer | Li by Nitin Singh • 0

```#include <bits/stdc++.h> using namespace std; #define ll long long vector<int>par(26,-1); int find(int u){ …

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by Pritam Kumar Choudhary • 0

#include<bits/stdc++.h> using namespace std; #define ll long long #define fastio ios_base::sync_with_stdio(false), cin.tie(nullp…

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20

unequal elements (tle on larger test cases) 3D dp approach #include <bits/stdc++.h> using namespace std; …

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20

Infection Sequences #include <bits/stdc++.h> using namespace std; const int MOD = 1e9+7; long long factorial(int …

Answer: Uber OA (on campus) | 6 Month Intern by Abhijit Mishra • 10

3. #include <iostream> #include <vector> void solve() { long long n, m, k; long long x1, y…

Answer: Barclays, Recent Online Assesment Questions | String Generation | Insurance (SQ by Alok kumar • 10

#include<bits/stdc++.h> using namespace std; string findNewString(string &s1,string &s2) { …

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Munnanur • 0

n = 6 arr = 10 2 14 4 7 6 k = 3 x = 5

Answer: Question from my last OA, Infeneon by Vatsal Patel • 0

Solution Okay, the given example seems to be missing value 2. But if we join the pieces, the grid should look something like this/ 3…

Answer: Oracle | 13th October | Online Assessments | Decrypt by .. • 0

#include <bits/stdc++.h> using namespace std; #define int long long void solve(){ int n; cin>>n; …

Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0

Problem-2 LOST IN THE WOODS This problem requires generating a navigation signal string to guide a person named Bob from a starting point …

Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0

Problem-1 FURIOUS-DHONI In this problem, we are given an NtimesM grid of integer values. The goal is to find the maximum possible score …

Answer: Barclays | 12th October | Online Assessments | The Chemist | Maximum Partition | by HEET KEYUR SHAH • 0

QUESTION 1 #include <bits/stdc++.h> using namespace std; void solve(){ in…

Answer: Amazon | SDE | 25 November by Suryansh Rishit • 0

Approach The task is to replace all spaces in a string with %20 considering only the first trueLength characters. We iterate through th…

Answer: Amazon | OA 2020 | Shortest Distance Between Robots | August 19, 2020 by Suryansh Rishit • 0

Approach We need to find the smallest squared distance between any two robots in a 2D plane. A brute force approach would check all pairs,…

Answer: Uipath, Online Assessment (IIT Roorkee) | Maximum Common Companies | Grouping Ma by Srivarsha • 20

Solution for Common Companies: Approach: Reading Input : Read all edges as (u, v, company) into edges[]. …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Visa, Recent Online Assessment Questions (21st August 2023) | Two Cities (A And B) | Nservers | Number line | String Word

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au

Tredence Analytics, Online Assessment Questions (18th September 2023) | Master Chefs | Game of Thrones | Parenting Study | Mystery Keys | T-Missing Element

Zscaler, Recently Asked Online Assessment Questions (26th September 2023) | Range Selection | Transferable Weights

Answer: Uber OA (on campus) | 6 Month Intern

Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters | Minimize Travel Tax | Expected Path Length - III | Three Subarrays

Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters | Minimize Travel Tax | Expected Path Length - III | Three Subarrays

Media.net OA | 29 july | MNIT JAIPUR

Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March

Recent Locations

Bengaluru, just now

Varanasi, 5 minutes ago

Indore, 7 minutes ago

Hyderabad, 8 minutes ago

Guwahati, 8 minutes ago

Recent Awards • All

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to John 970

Popular Question to pillaisamarth • 30

Student to pillaisamarth • 30