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
14 results • Page
1 of 1
Sort by: Default
Default
Post Creation date
Recent Activity
Views
Votes
Replies
Showing :
Airtel
•
reset
0
Votes
1
Reply
2.0k
Views
Airtel, Recently Asked Online Assessment Question (28th September 2023) | Special Array | Find the Odd One Out
0 Votes | 1 Reply
coding-round
on-campus
Airtel
free-public-post
2.1 years ago
Delta
3.0k
0
Votes
0
Replies
1.9k
Views
Airtel, Recently Asked Online assessment Questions (28th September 2023) | Maximum Difference Sum | No Difference
0 Votes | 0 Replies
on-campus
coding-round
Airtel
free-public-post
2.1 years ago
Delta
3.0k
1
Vote
0
Replies
1.6k
Views
Airtel, Recently Asked Online Assessment Questions | Ice Cream Distribution | 2023
1 Vote | 0 Replies
coding-round
free-public-post
on-campus
Airtel
2.1 years ago
Delta
3.0k
0
Votes
0
Replies
2.5k
Views
Airtel, Online Assessment Questions (23rd September 2023) | Mighty Area | Test Laptop
0 Votes | 0 Replies
on-campus
coding-round
free-public-post
Airtel
2.1 years ago
Delta
3.0k
0
Votes
2
Replies
1.5k
Views
Airtel Payments Bank, Recently asked Online Assessment Questions (19th September 2023) | Largest Value Possible
0 Votes | 2 Replies
Airtel
free-public-post
coding-round
on-campus
2.1 years ago
Delta
3.0k
0
Votes
0
Replies
1.4k
Views
Airtel Payments Bank, Recently asked online Assessment Questions | Alternating prime | Delete TV Channels | 19th August 2023
0 Votes | 0 Replies
Airtel
free-public-post
coding-round
on-campus
2.1 years ago
Delta
3.0k
0
Votes
1
Reply
1.4k
Views
Airtel, Online Assessment Questions (13th September 2023) | Rearrange Array to give the largest Value
0 Votes | 1 Reply
coding-round
free-public-post
Airtel
on-campus
2.1 years ago
Delta
3.0k
1
Vote
1
Reply
1.5k
Views
Airtel, Online Assessment Bank (13th September 2023) | Superior Array element | Cost to Company
1 Vote | 1 Reply
Airtel
coding-round
free-public-post
on-campus
2.1 years ago
Delta
3.0k
2
Votes
3
Replies
2.3k
Views
Airtel, Recent Online Assessment Questions | Weird Number | Maximizing the Array
2 Votes | 3 Replies
on-campus
Airtel
free-public-post
coding-round
2.1 years ago
PoGo
2.5k
1
Vote
1
Reply
2.6k
Views
Airtel Payment's Bank, Recent Online Assessment Questions (25th August 2023) | Minimum Difference of Sub Arrays | Path to element
1 Vote | 1 Reply
on-campus
Airtel
free-public-post
coding-round
2.1 years ago
PoGo
2.5k
4
Votes
2
Replies
3.0k
Views
Airtel Payments Bank, Online Assessment Questions ( 16th August 2023 - SET 3) | String Shortening | Branching and Palindrome
4 Votes | 2 Replies
free-public-post
Airtel
coding-round
on-campus
2.2 years ago
PoGo
2.5k
1
Vote
3
Replies
3.3k
Views
Airtel Payments Bank , Online Assessment Questions (16th August 2023 - SET- 2 ) | Creating Polygon | Equal Nodes In the Binary Tree
1 Vote | 3 Replies
free-public-post
Airtel
coding-round
on-campus
2.2 years ago
PoGo
2.5k
0
Votes
2
Replies
3.2k
Views
Airtel Payments Bank, Recent Online Assessment Questions (16th August 2023 - SET 1) | Find the Total | Count Product Sequence
0 Votes | 2 Replies
free-public-post
Airtel
coding-round
on-campus
2.2 years ago
PoGo
2.5k
1
Vote
0
Replies
2.7k
Views
Airtel Payments Bank, Recent Online Assessment Questions (15th August 2023) | Happy Strings | Representatives
1 Vote | 0 Replies
on-campus
free-public-post
Airtel
coding-round
2.2 years ago
Delta
3.0k
14 results • Page
1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon
81
Google
40
Oracle
38
Sprinklr
22
Microsoft
21
GoldmanSachs
20
Uber
20
CodeNation
17
deshaw
17
Cisco
16
BNY-Mellon
16
media.net
15
Walmart
15
Atlassian
15
VISA
14
ZScaler
14
Flipkart
14
Airtel
14
PhonePe
13
DBOI
13
ByteDance
11
Paytm
11
Adobe
10
Intuit
9
TCS
9
PayPal
8
Razorpay
8
Publicis-Sapient
7
Amadeus
7
Tredence
7
Barclays
7
Zomato
7
Cred
7
Increff
7
Morgan-Stanley
6
TVS
6
GEDigital
6
Salesforce
6
Rubrik
6
saplabs
6
Credit-Suisse
6
Juspay
5
thoughtspot
5
Samsung
5
QuantBox
5
Nvidia
5
standard-chartered
5
JP-Morgan
5
Jaguar
5
Apollo
5
curefit
5
graviton
5
Mastercard
5
HCL
5
IBM
5
uipath
5
Sigmoid
5
Hilabs
4
Trilogy-Innovations
4
Directi
4
Confluent
4
Infosys
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: GOOGLE OA | SWE Internship 2023 | Cost of Groups | Queries and Arrays | 22nd Ju
by
Kaushik K S
• 0
//COST OF GROUPS import java.util.*; import java.io.*; public class CostOfGroupsNaive { static List<Integer>[] tree; …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Kaushik K S
• 0
//HYBRID MAXIMUM import java.util.Scanner; public class HybridMaximum { // maX VAL of the expression public static int …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Kaushik K S
• 0
// PRIME PATH import java.util.*; import java.io.*; public class Main { static int N; static int[][] G; static int[][…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Kaushik K S
• 0
//MEDIAN PATHS import java.util.*; /* * Approach * Use an adjacency list. * DFS Traversal & track paths(odd-len) * go …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Kaushik K S
• 0
//FINDING ARRAYS import java.util.*; public class FindingArrays { static final int MOD = 1000000007; // digitSumBuc…
Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path
by
annu sevada
• 0
def count_substrings_more_ones(s): n = len(s) nums = [1 if c == '1' else -1 for c in s] …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Reddiwary Dhrutvan Reddy
• 0
hybrid maximum #include <bits/stdc++.h> using namespace std; int hybridMaximum(int N, vector<int>& A, int M, vector&…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Reddiwary Dhrutvan Reddy
• 0
Prime path #include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 10; vector<int> spf(MAX); // Small…
Answer: DE Shaw OA | BITS PILANI | SWE Internship | 30th July 2023
by
Reddiwary Dhrutvan Reddy
• 0
Q1) #include <bits/stdc++.h> using namespace std; int smallest_subarray_infinite(vector<int>& arr, int k) { …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Reddiwary Dhrutvan Reddy
• 0
finding arrays #include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; // Precompute all numbers 1..1000…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
by
Reddiwary Dhrutvan Reddy
• 0
Median path: #include <bits/stdc++.h> using namespace std; void dfs(int node, int parent, vector<int>& val, vector&l…
Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S
by
Nihal Reddy
• 0
def solve_op(): t = int(input()) for _ in range(t): n = int(input()) costs = list(map(int, input().split())) …
Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path
by
Nihal Reddy
• 0
def merge_count_inversions(arr, temp, left, mid, right): i = left j = mid + 1 k = left inv_count = 0 while…
Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr
by
Nihal Reddy
• 0
from collections import defaultdict, deque def getMinOperations(gnodes, kap, edges): adj = defaultdict(list) for u, v in edg…
Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr
by
Nihal Reddy
• 0
def getSmallestSortedArray(arr): n = len(arr) sarr = [str(x) for x in arr] res = [""] * n # last element res[-…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Top Problem Solvers
Claim your TJO hamper 🎁
Loading...
This Month
Recent Votes
Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu
Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path
Answer: Nvidia, Recent Online Assessment Question | String Search | 2023
How to get Premium Access?
Answer: Uber OA (on campus) | 6 Month Intern
AlgoUniversity Technology Fellowship: Stage 2 || Important Questions
PhonePe | 9th October | Online Assessments
Answer: Question from my last OA, Infeneon
Answer: Question from my last OA, Infeneon
Recent Locations
New Delhi,
6 minutes ago
Patna,
26 minutes ago
Patna,
32 minutes ago
Roorkee,
34 minutes ago
New Delhi,
36 minutes ago
Recent Awards
• All
Great Question
to
John
1.0k
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
1.0k
Popular Question
to
pillaisamarth
• 30
1