Skip to content

Conversation

SathisKumar133
Copy link

No description provided.


You are given two integer arrays `nums1` and `nums2` of lengths `m` and `n` respectively. These arrays represent the digits of two numbers. You are also given an integer `k`.

Your task is to create the maximum number of length `k` (where `k ≤ m + n`) by selecting digits from the two arrays. The relative order of the digits from the same array must be preserved.
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

If it's inside a code block it's better to use <= to make it easier to type

@@ -0,0 +1,5 @@
## Self Crossing

You are given an array of integers `distance`. You start at the point (0, 0) on an X-Y plane, and you move `distance[0]` meters to the north, then `distance[1]` meters to the west, `distance[2]` meters to the south, `distance[3]` meters to the east, and so on. After each move, your direction changes counter-clockwise.
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

xy-plane

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants