---
title: "Divyansh Sareen (@miracleboy) | Hashnode"
description: "Developer Intern at DeepThought. Read the latest articles by Divyansh Sareen on Hashnode."
url: "https://hashnode.com/@miracleboy"
---

@miracleboy

# Divyansh Sareen

@miracleboy · Delhi, India · Joined May 2021

Developer Intern at DeepThought

[Website](https://www.divyanshsareen.com/)

### [Largest Sum of Contiguous Subarray](https://divyanshsareen.hashnode.dev/largest-sum-of-contiguous-subarray?utm_source=hashnode&utm_medium=feed)

This is a cool problem. We need to find the contiguous subarray with the largest sum in an array. We will start by writing a brute force approach and then w

2 min read · [divyanshsareen.hashnode.dev](https://divyanshsareen.hashnode.dev/largest-sum-of-contiguous-subarray?utm_source=hashnode&utm_medium=feed)

[Jul 11, 2023](https://hashnode.com/posts/largest-sum-of-contiguous-subarray/64ad64289503ca73ce830e69)

### [Cyclic Rotation of Array Elements](https://divyanshsareen.hashnode.dev/cyclic-rotation-of-array-elements?utm_source=hashnode&utm_medium=feed)

While the DSA 450 problem only asks you to rotate the array cyclically by one, we will go a step beyond the required and discuss how to cyclically rotate k

3 min read · [divyanshsareen.hashnode.dev](https://divyanshsareen.hashnode.dev/cyclic-rotation-of-array-elements?utm_source=hashnode&utm_medium=feed)

[Jul 10, 2023](https://hashnode.com/posts/cyclic-rotation-of-array-elements/64abfd6499666caf62d8d304)

### [Union and Intersection of two Arrays](https://divyanshsareen.hashnode.dev/union-and-intersection-of-two-arrays?utm_source=hashnode&utm_medium=feed)

In this article, we will go through two ways of finding union and two ways of finding intersection of arrays. But before that, let's take a look at what exa

5 min read · [divyanshsareen.hashnode.dev](https://divyanshsareen.hashnode.dev/union-and-intersection-of-two-arrays?utm_source=hashnode&utm_medium=feed)

[Jul 8, 2023](https://hashnode.com/posts/union-and-intersection-of-two-arrays/64a9b0c8523456d248754274)

### [Move all negative elements to end](https://divyanshsareen.hashnode.dev/move-all-negative-elements-to-end?utm_source=hashnode&utm_medium=feed)

This problem is the easier version of the problem we solved earlier in this series. So let's start by looking at the simple approach first.

2 min read · [divyanshsareen.hashnode.dev](https://divyanshsareen.hashnode.dev/move-all-negative-elements-to-end?utm_source=hashnode&utm_medium=feed)

[Jul 7, 2023](https://hashnode.com/posts/move-all-negative-elements-to-end/64a86c5073e4b63c10bd2d83)

### [Sorting Array of 0s, 1s and 2s](https://divyanshsareen.hashnode.dev/sorting-array-of-0s-1s-and-2s?utm_source=hashnode&utm_medium=feed)

One simple approach would be to find the frequency of each element(i.e. 0s, 1s and 2s) and create an array with this information. A better approach would be

4 min read · [divyanshsareen.hashnode.dev](https://divyanshsareen.hashnode.dev/sorting-array-of-0s-1s-and-2s?utm_source=hashnode&utm_medium=feed)

[Jul 7, 2023](https://hashnode.com/posts/sorting-array-of-0s-1s-and-2s/64a7d21cac427f04ab0b5307)
