preloader
  • Home
  • Previous Questions

Contains previous problem statements given by various recruitors during their selection process.

1st Jan, 0001

Atlassian

IDQuestions
6Zigzag Conversion
49Group Anagrams
56Merge Intervals
63Unique Paths II
88Merge Sorted Array
121Best Time to Buy and Sell Stock
136Single Number
153Find Minimum in Rotated Sorted Array
217Contains Duplicate
300Longest Increasing Subsequence
348Design Tic-Tac-Toe
353Design Snake Game
359Logger Rate Limiter
362Design Hit Counter
432All O`one Data Structure
441Arranging Coins
692Top K Frequent Words
730Count Different Palindromic Subsequences
741Cherry Pickup
759Set Intersection Size At Least Two
947Online Election
1125Design File System
1129Longest String Chain
1146Greatest Common Divisor of Strings
1352Maximum Profit in Job Scheduling
1423Maximum Number of Occurrences of a Substring
1429Verbal Arithmetic Puzzle
1456Find the City With the Smallest Number of Neighbors at a Threshold Distance
1483Rank Teams by Votes
1497Design a Stack With Increment Operation
1720Crawler Log Folder
1744Number of Ways to Form a Target String Given a Dictionary
2189Maximum Path Quality of a Graph
2577Count Palindromic Subsequences
2661Smallest Missing Non-negative Integer After Operations
2711Minimum Time to Visit a Cell In a Grid
3024String Transformation
3202High-Access Employees
3217Number of Possible Sets of Closing Branches
3219Make Lexicographically Smallest Array by Swapping Elements