Latest
Topics
Tags
News
Jobs
Tutorials
Forum
Join Us
Community
Problems
New Post
AlgoPath
Log In
New Post
AlgoPath
Latest
News
Jobs
Tutorials
Forum
Tags
Planet
Users
Log In
Sign Up
REGISTER NOW
Register Now
Request Recent Questions Now!
AlgoPath
A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness.
Visit AlgoPath
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 :
brillio
•
reset
0
Votes
3
Replies
121
Views
Brillio Technologies | Recent Off-Campus Assessment | Special Array & Distinct Years | String Parsing & Math Logic | March 12 | Brillio Coding Round
0 Votes | 3 Replies
off-campus
2026
brillio
OA
3 months ago
Rohit
• 40
1 result • Page
1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon
106
Google
51
Oracle
48
Uber
33
Flipkart
29
Microsoft
29
GoldmanSachs
28
Sprinklr
25
Cisco
24
Walmart
23
Atlassian
21
deshaw
21
IBM
20
Infosys
19
PhonePe
19
Intuit
17
media.net
17
VISA
17
BNY-Mellon
16
Salesforce
16
CodeNation
15
Airtel
14
ZScaler
14
Cred
13
DBOI
13
Paytm
13
Adobe
12
ByteDance
12
Zomato
12
PayPal
11
Publicis-Sapient
11
Razorpay
11
TCS
11
Accenture
10
Barclays
10
Amadeus
9
Linkedin
9
Nvidia
8
Rubrik
8
Samsung
8
Sigmoid
8
Swiggy
8
Capgemini
7
Cognizant
7
HCL
7
Increff
7
Meesho
7
saplabs
7
Tredence
7
wipro
7
arcesium
6
Confluent
6
Deloitte
6
GEDigital
6
Hexaware
6
HSBC
6
Juspay
6
Mastercard
6
standard-chartered
6
thoughtspot
6
TVS
6
American-Express
5
Apollo
5
CITI
5
curefit
5
Directi
5
graviton
5
Jaguar
5
JP-Morgan
5
Juniper
5
Morgan-Stanley
5
Navi
5
Qualcomm
5
ServiceNow
5
Siemens
5
Tiktok
5
uipath
5
Wells-Fargo
5
Alphagrep
4
AMD
4
Avalara
4
Goldman-Sachs
4
Hilabs
4
makemytrip
4
Optum
4
Persistent
4
Appdynamics
3
AQR
3
Blackrock
3
British-Telecom
3
CapitalOne
3
Citadel
3
Contlo
3
Hugosave
3
Jio
3
LTI
3
Mathworks
3
Mercari
3
Nagarro
3
OYO
3
Piramal
3
ringcentral
3
Rippling
3
Slice
3
Tekion
3
Trilogy-Innovations
3
urbancompany
3
Virtusa
3
Zepto
3
Air-India
2
Arzoo
2
BP
2
Celigo
2
Chalo
2
Dassault-Systems
2
DevRev
2
DXC-Technology
2
Edfora
2
Edgeverve
2
Gameskraft
2
Intel
2
Irage
2
MAQ-Software
2
MotorQ
2
Palo-Alto-Networks
2
relevel
2
Schrodinger
2
shopconnect
2
Tiger-Analytics
2
USTD3
2
Wissen-Technology
2
Audify-Tech
1
Bhanzu
1
Chargebee
1
Cogoport
1
colortokens
1
Credit-Suisse
1
darwinbox
1
Dpworld
1
Factset
1
Kickdrum
1
Morphel
1
Natwest
1
Niro-Money
1
Observe.ai
1
Pine-Labs
1
Prograd
1
QuantBox
1
Rakuten
1
Societe-Generale
1
Tech-Mahindra
1
Tibra
1
Trianz-Digital
1
Truminds
1
Veritas
1
Webstaff
1
Winzo
1
Bank-of-America
0
Flexcar
0
Hitachi
0
Hudson-River-Trading
0
Medianet
0
Mentor-Graphics
0
Newfold - Digital
0
Notion
0
Qburst
0
Steradian-Semiconductors
0
Toshiba
0
Recent Replies
Answer: Palo Alto Networks OA 2025 | Firewall Rule Resolution Engine
by
Sahil Jain
• 0
Solution 1 - Enterprise Packet Filter Rule Engine Strategy A brute-force solution would evaluate every packet against every firewall …
Answer: Uber OA 2025 | Grid Path Optimization with One Bypass
by
Sahil Jain
• 0
Solution 1 - Dynamic Ride-Matching Matrix Strategy A standard grid DP is insufficient because the optimal path depends on whether the…
Answer: Flexport OA 2025 | Cheapest Route with K Stops
by
Sahil Jain
• 0
Solution 1 - Supply Chain Carrier Routing Optimization Engine Strategy A traditional Dijkstra implementation cannot be applied direct…
Answer: Datadog OA 2025 | Sliding Window, Cycle Detection & Matrix Transpose
by
Sahil Jain
• 0
Solution 1 - Telemetry Stream Window Peak Detector Strategy A brute-force approach would evaluate every possible subarray and repeate…
Answer: Splunk OA 2025 | Log Deduplication, Connected Components & Sliding Window Maximu
by
Sahil Jain
• 0
Solution 1 - Indexer Telemetry Duplication Filter Strategy A brute-force approach would scan all previously processed logs for every …
Answer: Twilio OA 2025 | String Compression, Rate Limiting & BFS Routing
by
Sahil Jain
• 0
Solution 1 - SMS Payload Compression Engine Strategy A naive solution might repeatedly remove spaces and duplicate characters using s…
Answer: BlackRock OA 2025 | Pair Sums, Matrix Transpose & Stack Validation
by
Sahil Jain
• 0
Solution 1 - Corporate Dividend Pay-Out Calculations Strategy A brute-force pair comparison requires O(N²) time. Use a HashSe…
Answer: NOMURA OA 2023 | Number of Good Ways to Split a String | Java Solution | Prefix
by
Padala Indira Bhavani
• 0
Approach For every position: Count distinct characters from the left. Count distinct characters from the right. Compare both c…
Answer: CITADEL SECURITIES Off Campus OA 2023 | Maximum Profit with Future Stock Prices
by
Padala Indira Bhavani
• 0
Approach This is a classic 0/1 Knapsack Problem. Mapping Weight = present[i] Value = future[i] - present[i] Capacity = budget…
Answer: TWO SIGMA Off Campus OA 2023 | Number of Ways to Stay in the Same Place After So
by
Padala Indira Bhavani
• 0
Approach Use Dynamic Programming. Let: dp[pos] represent the number of ways to reach position pos after the current number of…
Answer: DE SHAW Hiring Off Campus OA 2022 | Maximum Profit with K Transactions | Dynami
by
Padala Indira Bhavani
• 0
Approach This problem is a Dynamic Programming optimization problem. Maintain two arrays: buy[j] → Maximum profit after bu…
Answer: ARCESIUM OA 2022 | Range Sum Query 2D | Mutable (2D Binary Indexed Tree / Fenwic
by
Padala Indira Bhavani
• 0
Approach A brute-force approach would recalculate the rectangle sum for every query. Update : O(1) Query : O(m × n) This bec…
Answer: F5 Networks OA 2022 | Find Critical and Pseudo Critical Edges in Minimum Spannin
by
Padala Indira Bhavani
• 0
Approach The solution is based on Kruskal's Algorithm and Disjoint Set Union (Union-Find). Step 1 Compute the original MST wei…
Answer: Akamai Technologies | Design Underground System | Online Assessment question 202
by
Padala Indira Bhavani
• 0
Approach We need to efficiently support: Store active check-ins. Record completed trips. Return average travel time quickly. …
Answer: Zscaler Hiring Challenge OA 2022 | Replace Words with Root (Trie-Based Stemmer)
by
Padala Indira Bhavani
• 0
Approach A brute-force solution would check every root against every word, resulting in high time complexity. A better approach is to…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Top Problem Solvers
Claim your TJO hamper 🎁
Loading...
This Month
Recent Votes
Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)
AlgoUniversity Technology Fellowship: Stage 2 || Important Questions
Flipkart | October, 2022 | Interview Questions
TCS | Online Assessments | Deleting Channel
MediaNet, Recently Asked Online Assessments in October, 2022 | Omega Primes | Fruits on Tree | Damaged Roads
Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)
How to get Premium Access?
Amazon, Recently Asked Online Assessments in 27 Aug, 2025 | Single Sign-On Security Code | Lexicographical Binary Strings | HackerRank Coding Assessment |
Comment: Amazon | Recent Online Assessment 2026 | Priority Bug Sorting | Package Prefix D
Comment: Amazon | Recent Online Assessment 2026 | Priority Bug Sorting | Package Prefix D
Recent Locations
Chāndpura,
52 minutes ago
Hyderabad,
2 hours ago
Ludhiana,
3 hours ago
Pune,
3 hours ago
Mumbai,
5 hours ago
Recent Awards
• All
Centurion
to
Sahil Jain
• 0
Centurion
to
Padala Indira Bhavani
• 0
Centurion
to
Pravardhan Aare
• 0
Rising Star
to
Sahil Jain
• 0
Rising Star
to
Padala Indira Bhavani
• 0
Rising Star
to
Pravardhan Aare
• 0
Appreciated
to
Ayush Gangwani
1.3k
Great Question
to
papa
430
Teacher
to
Apna_time _aayega
• 60
Great Question
to
admin
1.9k
1