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
3 results • Page
1 of 1
Sort by: Default
Default
Post Creation date
Recent Activity
Views
Votes
Replies
Showing :
siemens
•
reset
0
Votes
1
Reply
4
Views
Siemens, Recently Asked Online Assessments in 5 Nov, 2025 | Task
0 Votes | 1 Reply
siemens
oa
coding-round
2025
6 weeks ago
admin
1.9k
0
Votes
1
Reply
3
Views
Siemens | Online Assessments | 7 Nov, 2025 | Task Scheduling Optimisation
0 Votes | 1 Reply
siemens
oa
coding-round
2025
6 weeks ago
admin
1.9k
1
Vote
0
Replies
2.2k
Views
Siemens , Recently Asked Online Assessments Questions (19th September 2023) | Account Information
1 Vote | 0 Replies
2023
Siemens
coding-round
free-public-post
on-campus
2.7 years ago
Delta
3.0k
3 results • Page
1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon
101
Google
44
Oracle
44
Microsoft
26
Flipkart
25
GoldmanSachs
25
Uber
25
Sprinklr
22
deshaw
20
Cisco
19
IBM
18
Walmart
18
VISA
17
BNY-Mellon
16
Infosys
16
media.net
16
PhonePe
15
Airtel
14
Atlassian
14
CodeNation
14
DBOI
13
ZScaler
13
Intuit
12
Paytm
12
Salesforce
12
ByteDance
11
Adobe
10
Cred
10
Publicis-Sapient
10
Razorpay
10
TCS
10
PayPal
9
Zomato
9
Barclays
8
Amadeus
7
HCL
7
Increff
7
Rubrik
7
saplabs
7
Sigmoid
7
Tredence
7
Accenture
6
Deloitte
6
GEDigital
6
Linkedin
6
Samsung
6
standard-chartered
6
Swiggy
6
TVS
6
American-Express
5
Apollo
5
arcesium
5
Capgemini
5
Cognizant
5
Confluent
5
curefit
5
graviton
5
HSBC
5
Jaguar
5
JP-Morgan
5
Juspay
5
Mastercard
5
Meesho
5
Nvidia
5
thoughtspot
5
uipath
5
Wells-Fargo
5
Alphagrep
4
Avalara
4
CITI
4
Hexaware
4
Hilabs
4
Juniper
4
Morgan-Stanley
4
Qualcomm
4
ServiceNow
4
Tiktok
4
wipro
4
AMD
3
Appdynamics
3
AQR
3
British-Telecom
3
CapitalOne
3
Contlo
3
Directi
3
Hugosave
3
Jio
3
Mathworks
3
Mercari
3
Nagarro
3
Navi
3
OYO
3
Piramal
3
ringcentral
3
Rippling
3
Siemens
3
Trilogy-Innovations
3
Air-India
2
Arzoo
2
Blackrock
2
BP
2
Celigo
2
Chalo
2
Citadel
2
Dassault-Systems
2
DevRev
2
DXC-Technology
2
Edfora
2
Edgeverve
2
Gameskraft
2
Goldman-Sachs
2
Irage
2
LTI
2
makemytrip
2
MAQ-Software
2
MotorQ
2
Optum
2
Palo-Alto-Networks
2
Persistent
2
relevel
2
Schrodinger
2
shopconnect
2
Tekion
2
Tiger-Analytics
2
urbancompany
2
USTD3
2
Virtusa
2
Wissen-Technology
2
Audify-Tech
1
Bhanzu
1
Chargebee
1
Cogoport
1
colortokens
1
Credit-Suisse
1
darwinbox
1
Dpworld
1
Factset
1
Intel
1
Kickdrum
1
Morphel
1
Natwest
1
Niro-Money
1
Observe.ai
1
Pine-Labs
1
Prograd
1
QuantBox
1
Rakuten
1
Slice
1
Societe-Generale
1
Tech-Mahindra
1
Tibra
1
Trianz-Digital
1
Truminds
1
Veritas
1
Webstaff
1
Winzo
1
Zepto
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: Google SWE Interview 2024 | DP & Backtracking | Arranging Bricks
by
Pravardhan Aare
• 0
Solutions for Question 1: Arranging Bricks Approach: Dynamic Programming & Backtracking This is a brilliant two-part problem. Bec…
Answer: Samsung R&D OA 2023 | DP & Strings | String Partitioning
by
Pravardhan Aare
• 0
Solutions for Question 1: String Partitioning Approach 1: Brute Force / Pure Recursion (Time Limit Exceeded) The simplest way to solv…
Answer: Infosys OA 2021 | Precomputation & Permutations | Smart Square
by
Pravardhan Aare
• 0
Solutions for Question 1: Smart Square Approach 1: Brute Force (Time Limit Exceeded) Since a Smart Square must consist of numbers 1 t…
Answer: GE Vernova Coding OA (2021) | Backtracking Algorithms | On-campus
by
Pravardhan Aare
• 0
Solution for Question 1: N - Queens Approach: Backtracking with O(1) Hashing To place a queen safely, we must check if a queen alread…
Answer: Salesforce HackerRank OA (2022) | Bit Manipulation (XOR) | Off-campus
by
Pravardhan Aare
• 0
Solution for Question 1: Sum of XOR of pairs Approach: Bit-by-Bit Evaluation A brute force O(N^2) approach will fail the time limits.…
Answer: Philips Innovation Campus OA (2022) | Combinatorics & Binary Search | On-Campus
by
Pravardhan Aare
• 0
Solution: Two Set Bits Approach: Pattern Observation and Binary Search Let's write down the binary representations of the sequenc…
Answer: Uber SDE-1 Assessment 2025-October | Greedy Sorting | Merge Intervals
by
Padala Indira Bhavani
• 0
Solution 1: Merge Intervals Approach: Sorting & Greedy First, we sort the intervals based on their starting points. Then, we push the…
Answer: LTIMindtree Technical OA 2025-September | Kadane's Algorithm | Maximum Subarray
by
Padala Indira Bhavani
• 0
Solution: Maximum Subarray Approach: Kadane's Algorithm Kadane's Algorithm is the most optimal way to find the max subarray s…
Answer: Zoho DSA Questions Asked in Online Assessment (2025) | Longest Substring Without
by
Padala Indira Bhavani
• 0
Question 1: Strategy A brute-force approach would check every possible subarray and calculate its sum. O(N²) or O(N³) which is too …
Answer: Cvent Coding Round 2026-January | String Parsing & Stacks | Valid Parentheses
by
Padala Indira Bhavani
• 0
Solution: Valid Parentheses Approach: Stack Data Structure A Stack is perfect for this problem because of its LIFO (Last In First Out…
Answer: Publicis Sapient OA 2025 -August | Advanced Binary Search | Rotated Arrays
by
Padala Indira Bhavani
• 0
Solution: Search in Rotated Sorted Array Approach: Modified Binary Search To maintain O(log N) complexity, we use Binary Search. The …
Answer: Persistent Systems Coding Assessment 2025-November | HashSets & Sequences | Long
by
Padala Indira Bhavani
• 0
Solution: Longest Consecutive Sequence Approach: HashSet To achieve O(N) time complexity, we add all numbers into a HashSet. We then …
Answer: EPAM Systems OA 2026-February | Missing Number Series | First Missing Positive |
by
Padala Indira Bhavani
• 0
Solution: First Missing Positive Approach: Cycle Sort The smallest missing positive integer must lie in the range [1, N+1]. We can pl…
Answer: Zoho SDE Interview 2025 | Arrays & Pointers | OA | Off-campus
by
Padala Indira Bhavani
• 0
Solution: Sort Colors Approach: Dutch National Flag Algorithm We can solve this efficiently using 3 pointers: low, mid, and high. The…
Answer: Amazon OA August-2025 | Server Clusters & Matrices | Number of Islands
by
Padala Indira Bhavani
• 0
Solution: Number of Islands Approach: Depth First Search (DFS) We can solve this problem by treating the grid as a graph. We traverse…
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
Kochi,
just now
Bengaluru,
just now
Kochi,
2 hours ago
Bengaluru,
2 hours ago
Kanpur,
2 hours ago
Recent Awards
• All
Appreciated
to
Ayush Gangwani
1.3k
Great Question
to
papa
430
Teacher
to
Apna_time _aayega
• 60
Great Question
to
admin
1.9k
Rising Star
to
Rohit
• 40
Scholar
to
Sarthak
• 10
Scholar
to
Rohit
• 40
Great Question
to
admin
1.9k
Appreciated
to
Akshay Sharma
1.1k
Appreciated
to
Akshay Sharma
1.1k
1