Problem: My Solution: cpp #include using namespace std; vector solve(vector talent, int talentsCount) { const int n = (int)talent.size(); map > cnt; for(int i = 0; i < n; i++) { cnt[talent[i]].push_back(i); } for(auto& [k,...

LeetCode Question · Oct 2022 · Washington DC

Atlassian India | Women In Tech | OA | 2022 | Problem 3 Solution

SWE OA

5 upvotes 649 views 1 reply

Question Details

Problem: My Solution: cpp #include<bits/stdc++.h> using namespace std; vector<int> solve(vector<int> talent, int talentsCount) { const int n = (int)talent.size(); map<int, vector<int>> cnt; for(int i = 0; i < n; i++) { cnt[talent[i]].push_back(i); }…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

General Experience

More from Atlassian

1p3a Atlassian SWE-II Backend Interview Experience P40 5 YOE 1p3a Atlassian Full Onsite Interview Experience for SDE Position 1p3a Atlassian technical phone interview: Department visit optimization coding GeeksforGeeks Atlassian Interview Experience | Atlassian Women in Tech program LeetCode Atlassian Interview DSA round

← All Atlassian questions Atlassian Software Engineer Questions → All Algorithms Questions →