One problem a day logo One problem a day
Browse problems
All problems 944 About this project

Categories

  • Array & Hashmap 217
  • Backtracking 33
  • Binary Search 27
  • Bit Manipulataion 25
  • Design 46
  • Dynamic Programming 85
  • Graph 74
  • Greedy 59
  • Heap 44
  • Intervals 16
  • Linked List 50
  • Math & Germetry 85
  • Queue 15
  • Sliding Window 29
  • Stack 48
  • Tree 122
  • Trie 14
  • Two Pointers 31

© 2026 One problem a day

Problems Concatenation of array
array and hashmap May 6, 2023

Concatenation of array

Time O(n) Space O(1) Open original problem

We can just merge the array with itself and return.

class Solution:
    def getConcatenation(self, nums: List[int]) -> List[int]:
        return nums + nums

Time complexity: O(n)
Space complexity: O(1)

Previous problem ← Find score of an array after marking all elements
Next problem Sort array by increasing frequency →

On this page

Start typing to search all 944 problems.
↑↓ Navigate ↵ Open Powered by Fuse.js