---
title: "Discussion on \"Leetcode - 1D array\" | Hashnode"
description: "Discussion on \"Leetcode - 1D array\". There are few interesting algorithms to approach 1D array problems. First, Kadane’s algorithm. This is useful to find local max in 1D array. Second, two pointer technique. One pointer starts from the beginning of 1D array and another pointer starts f..."
url: "https://hashnode.com/posts/leetcode-1d-array/67e7c5a10075a2b6be9689eb"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Leetcode - 1D array](https://hyunwoochoi.hashnode.dev/leetcode-1d-array?utm_source=hashnode&utm_medium=feed)

There are few interesting algorithms to approach 1D array problems. First, Kadane’s algorithm. This is useful to find local max in 1D array. Second, two pointer technique. One pointer starts from the beginning of 1D array and another pointer starts f...

Mar 29, 2025 · 4 min read · hyunwoochoi.hashnode.dev  
Read the article

-   [#1d-array](https://hashnode.com/tag/1d-array)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#array](https://hashnode.com/tag/array)
-   [#kadanes-algorithm](https://hashnode.com/tag/kadanes-algorithm)
-   [#two-pointers](https://hashnode.com/tag/two-pointers)
-   [#rotate-array](https://hashnode.com/tag/rotate-array)

## Written by

[Hyunwoo Choi](https://hashnode.com/@choi)

@choi · Minneapolis, MN

  
[View profile](https://hashnode.com/@choi)

#firmware engineer #C/C++ #TDD #embedded system #ARM processor

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
