---
title: "Kumar Spandan Pattanayak (@5p7Ro0t) | Hashnode"
description: "Student | LeetCoder | Tech Freak | Fast Learner. Read the latest articles by Kumar Spandan Pattanayak on Hashnode."
url: "https://hashnode.com/@5p7Ro0t"
---

@5p7Ro0t

# Kumar Spandan Pattanayak

@5p7Ro0t · Bhubaneswar, India · Joined October 2022

Student | LeetCoder | Tech Freak | Fast Learner

### [Solving Leetcode 2872: Find the Maximum K-Divisible Components](https://5p7ro0t.hashnode.dev/leetcode-2872?utm_source=hashnode&utm_medium=feed)

Leetcode Question Link: https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Intuition Initially, I thought of approaching it with array and tree traversal but didn't think of any other method. I got struck on how to pr...

2 min read · [5p7ro0t.hashnode.dev](https://5p7ro0t.hashnode.dev/leetcode-2872?utm_source=hashnode&utm_medium=feed)

[Dec 21, 2024](https://hashnode.com/posts/leetcode-2872/6766bf740e04aa9dc410ba29)

### [Valid Anagram Solution - LeetCode 242](https://5p7ro0t.hashnode.dev/valid-anagram-solution-leetcode-242?utm_source=hashnode&utm_medium=feed)

Intuition After seeing the problem statement, I thought of the best one HashMap :)To store the frequency of one string and compare that with another string's frequency. However, we can also minimize the extra computation of importing and implementing...

2 min read · [5p7ro0t.hashnode.dev](https://5p7ro0t.hashnode.dev/valid-anagram-solution-leetcode-242?utm_source=hashnode&utm_medium=feed)

[May 31, 2023](https://hashnode.com/posts/valid-anagram-solution-leetcode-242/64775ef596611f4367665705)