0
Total Solved
0
Easy
0
Medium
0
Hard
๐
Top Strengths
๐๏ธ Needs Work
Core fundamentals with lowest solve count
๐ฏ Job Readiness
Recent Accepted Submissions Log
| # | Problem | Difficulty | Status | Runtime | Time |
|---|---|---|---|---|---|
| No submissions loaded yet. | |||||
โฑ๏ธ High-Pressure Mock Interview
Immerse yourself into a live 45-minute technical screener featuring an unseen Medium problem perfectly calibrated to a targeted FAANG company blueprint.
โฑ๏ธ Phase: Technical Screener
45:00
Two Sum
// Your solution here
class Solution {
public int[] twoSum(int[] nums, int target) {
}
}