Leetcode Problem 1169. Invalid Transactions
Leetcode Solutions
Sorting and Hash Map Approach
- Create a list to store invalid transactions.
- Sort the transactions by time.
- Create a hash map to store transactions by name.
- Iterate through the sorted transactions.
- For each transaction, split it into name, time, amount, and city.
- Check if the amount exceeds $1000, if so, mark it as invalid.
- Check the hash map for other transactions with the same name.
- If another transaction is within 60 minutes and in a different city, mark both as invalid.
- Update the hash map with the current transaction.
- Return the list of invalid transactions.
Brute Force Approach
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...