---
title: "Sirisha Challagiri (@Siri2316) | Hashnode"
description: "Sirisha Challagiri (@Siri2316) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@Siri2316"
---

@Siri2316

# Sirisha Challagiri

@Siri2316 · Joined November 2023

### [Amazon - How Many X’s In a Range](https://sirishachallagiri.hashnode.dev/amazon-how-many-xs-in-a-range?utm_source=hashnode&utm_medium=feed)

Given two integers L, R, and digit X. Find the number of occurrences of X in all the numbers in the range (L, R) excluding L and R. Example 1: Input: L=10, R=19, X=1 Output: 9 Explanation: There are 9 1s (11, 12, 13, 14, 15, 16, 17, 18) in the number...

2 min read · [sirishachallagiri.hashnode.dev](https://sirishachallagiri.hashnode.dev/amazon-how-many-xs-in-a-range?utm_source=hashnode&utm_medium=feed)

[Dec 7, 2023](https://hashnode.com/posts/amazon-how-many-xs-in-a-range/6571851ed21f8935942f3f0d)

### [657\. Robot Return to Origin](https://sirishachallagiri.hashnode.dev/657-robot-return-to-origin?utm_source=hashnode&utm_medium=feed)

There is a robot starting at the position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves. You are given a string moves that represents the move sequence of the robo...

3 min read · [sirishachallagiri.hashnode.dev](https://sirishachallagiri.hashnode.dev/657-robot-return-to-origin?utm_source=hashnode&utm_medium=feed)

[Dec 4, 2023](https://hashnode.com/posts/657-robot-return-to-origin/656e00524c1a5d582a165a31)

### [1160\. Find Words That Can Be Formed by Characters](https://sirishachallagiri.hashnode.dev/1160-find-words-that-can-be-formed-by-characters?utm_source=hashnode&utm_medium=feed)

You are given an array of strings words and a string chars. A string is good if it can be formed by characters from chars (each character can only be used once). Return the sum of lengths of all good strings in words. Example 1: Input: words = \["cat"...

3 min read · [sirishachallagiri.hashnode.dev](https://sirishachallagiri.hashnode.dev/1160-find-words-that-can-be-formed-by-characters?utm_source=hashnode&utm_medium=feed)

[Dec 2, 2023](https://hashnode.com/posts/1160-find-words-that-can-be-formed-by-characters/656b2c40153fe7d1aeae53fd)

### [125\. Valid Palindrome](https://sirishachallagiri.hashnode.dev/125-valid-palindrome?utm_source=hashnode&utm_medium=feed)

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, re...

3 min read · [sirishachallagiri.hashnode.dev](https://sirishachallagiri.hashnode.dev/125-valid-palindrome?utm_source=hashnode&utm_medium=feed)

[Dec 1, 2023](https://hashnode.com/posts/125-valid-palindrome/65699b5274c19a72dd3cf0e9)

### [1704\. Determine if String Halves Are Alike](https://sirishachallagiri.hashnode.dev/1704-determine-if-string-halves-are-alike?utm_source=hashnode&utm_medium=feed)

You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', '...

4 min read · [sirishachallagiri.hashnode.dev](https://sirishachallagiri.hashnode.dev/1704-determine-if-string-halves-are-alike?utm_source=hashnode&utm_medium=feed)

[Nov 28, 2023](https://hashnode.com/posts/1704-determine-if-string-halves-are-alike/6565affbee23955f64effeaa)
