---
title: "Charan R (@charanravi) | Hashnode"
description: "Strictly thinking decades. Read the latest articles by Charan R on Hashnode."
url: "https://hashnode.com/@charanravi"
---

@charanravi

# Charan R

@charanravi · Joined March 2025

Strictly thinking decades

### [Valid Anagram](https://blog.charanravi.com/valid-anagram--deleted?utm_source=hashnode&utm_medium=feed)

Check if two strings are anagrams of each other using a hashmap. Returns true or false

1 min read · [blog.charanravi.com](https://blog.charanravi.com/valid-anagram--deleted?utm_source=hashnode&utm_medium=feed)

[Apr 8, 2025](https://hashnode.com/posts/valid-anagram--deleted/67f49abcc20796d21f9693af)

### [Contains Duplicate](https://blog.charanravi.com/contains-duplicate-1--deleted?utm_source=hashnode&utm_medium=feed)

Algorithm to detect a duplicate element in an array

1 min read · [blog.charanravi.com](https://blog.charanravi.com/contains-duplicate-1--deleted?utm_source=hashnode&utm_medium=feed)

[Apr 8, 2025](https://hashnode.com/posts/contains-duplicate-1--deleted/67f48ead2d527e65b9d97811)

### [Top K Frequent Elements](https://blog.charanravi.com/top-k-frequent-elements--deleted?utm_source=hashnode&utm_medium=feed)

Learn how to find the top K frequent elements in an array using a hashmap and list sorting approach

2 min read · [blog.charanravi.com](https://blog.charanravi.com/top-k-frequent-elements--deleted?utm_source=hashnode&utm_medium=feed)

[Apr 7, 2025](https://hashnode.com/posts/top-k-frequent-elements--deleted/67f3710958ddbd265694077c)

### [Contains Duplicate](https://blog.charanravi.com/contains-duplicate--deleted?utm_source=hashnode&utm_medium=feed)

Check if an integer array contains duplicates by comparing its length to a set of its elements

2 min read · [blog.charanravi.com](https://blog.charanravi.com/contains-duplicate--deleted?utm_source=hashnode&utm_medium=feed)

[Apr 6, 2025](https://hashnode.com/posts/contains-duplicate--deleted/67f26a9b189603d63b4f34e8)
