Atlassian Interview Questions — 73 DSA Problems

66 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Atlassian LeetCode questions for software engineering interviews.

• Rank Teams by Votes (MEDIUM) — Array, Hash Table, String, Sorting, Counting
• Design Snake Game (MEDIUM) — Array, Hash Table, Design, Queue, Simulation
• Stock Price Fluctuation (MEDIUM) — Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set
• All O`one Data Structure (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• High-Access Employees (MEDIUM) — Array, Hash Table, String, Sorting
• Logger Rate Limiter (EASY) — Hash Table, Design, Data Stream
• Merge Intervals (MEDIUM) — Array, Sorting
• Maximum Good Subarray Sum (MEDIUM) — Array, Hash Table, Prefix Sum
• Minimum Cost to Convert String I (MEDIUM) — Array, String, Graph, Shortest Path
• Minimum Cost to Convert String II (HARD) — Array, String, Dynamic Programming, Graph, Trie, Shortest Path
• Maximum Square Area by Removing Fences From a Field (MEDIUM) — Array, Hash Table, Enumeration
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Maximum Area of Longest Diagonal Rectangle (EASY) — Array
• Number of Possible Sets of Closing Branches (HARD) — Bit Manipulation, Graph, Heap (Priority Queue), Enumeration, Shortest Path
• Verbal Arithmetic Puzzle (HARD) — Array, Math, String, Backtracking
• Cherry Pickup (HARD) — Array, Dynamic Programming, Matrix
• Smallest Missing Non-negative Integer After Operations (MEDIUM) — Array, Hash Table, Math, Greedy
• Make Lexicographically Smallest Array by Swapping Elements (MEDIUM) — Array, Union Find, Sorting
• Minimum Time to Visit a Cell In a Grid (HARD) — Array, Breadth-First Search, Graph, Heap (Priority Queue), Matrix, Shortest Path
• Find the Width of Columns of a Grid (EASY) — Array, Matrix
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Text Justification (HARD) — Array, String, Simulation
• Design File System (MEDIUM) — Hash Table, String, Design, Trie
• Longest String Chain (MEDIUM) — Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting
• Longest Increasing Subsequence (MEDIUM) — Array, Binary Search, Dynamic Programming
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Majority Element II (MEDIUM) — Array, Hash Table, Sorting, Counting
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Can Place Flowers (EASY) — Array, Greedy
• String Transformation (HARD) — Math, String, Dynamic Programming, String Matching
• Online Election (MEDIUM) — Array, Hash Table, Binary Search, Design
• The Time When the Network Becomes Idle (MEDIUM) — Array, Breadth-First Search, Graph
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Russian Doll Envelopes (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Two Sum (EASY) — Array, Hash Table
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Count Vowels Permutation (HARD) — Dynamic Programming
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Nth Highest Salary (MEDIUM) — Database
• Pairs of Songs With Total Durations Divisible by 60 (MEDIUM) — Array, Hash Table, Counting
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Crawler Log Folder (EASY) — Array, String, Stack
• Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy
• Boats to Save People (MEDIUM) — Array, Two Pointers, Greedy, Sorting
• Design Tic-Tac-Toe (MEDIUM) — Array, Hash Table, Design, Matrix, Simulation
• Maximum Number of Occurrences of a Substring (MEDIUM) — Hash Table, String, Sliding Window
• Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)