---
title: "Ramandeep Singh (@ramandeepSingh) | Hashnode"
description: "Enlivening the Dreams :D. Read the latest articles by Ramandeep Singh on Hashnode."
url: "https://hashnode.com/@ramandeepSingh"
---

@ramandeepSingh

# Ramandeep Singh

@ramandeepSingh · Rajasthan, India · Joined April 2023

Enlivening the Dreams :D

### [Distinct numbers](https://ramandeepsingh.hashnode.dev/distinct-numbers?utm_source=hashnode&utm_medium=feed)

You are given a list of N integers, and your task is to calculate the number of distinct values in the list. Input The first input line has an integer n: the number of values. The second line has the integers x1,x2,…,xn. Output Print one integer: the...

1 min read · [ramandeepsingh.hashnode.dev](https://ramandeepsingh.hashnode.dev/distinct-numbers?utm_source=hashnode&utm_medium=feed)

[Feb 14, 2024](https://hashnode.com/posts/distinct-numbers/65cc1b4c1817c53f3cf8ce50)

### [Trailing Zeroes](https://ramandeepsingh.hashnode.dev/trailing-zeroes?utm_source=hashnode&utm_medium=feed)

Your task is to calculate the number of trailing zeroes in the factorial n! for example, 20! = 2432902008176640000 Input The only input line has an integer n. Output Print the number of trailing zeros in n! Constraints 1 <= n <= 10^9 Example Input:...

1 min read · [ramandeepsingh.hashnode.dev](https://ramandeepsingh.hashnode.dev/trailing-zeroes?utm_source=hashnode&utm_medium=feed)

[Feb 7, 2024](https://hashnode.com/posts/trailing-zeroes/65c3360bad28a253ea0d40c9)

### [Bit Strings](https://ramandeepsingh.hashnode.dev/bit-strings?utm_source=hashnode&utm_medium=feed)

Your task is to calculate the number of bit strings of length n. For example, if n=3, the correct answer is 888, because the possible bit strings are 000, 001, 010, 011, 100, 101, 110, and 111. Input The only input line has an integer n. Output Print...

2 min read · [ramandeepsingh.hashnode.dev](https://ramandeepsingh.hashnode.dev/bit-strings?utm_source=hashnode&utm_medium=feed)

[Feb 7, 2024](https://hashnode.com/posts/bit-strings/65c32e0219fea7fa0fc33ab6)

### [Permutations](https://ramandeepsingh.hashnode.dev/permutations?utm_source=hashnode&utm_medium=feed)

A permutation of integers 1,2,…,n is called beautiful if there are no adjacent elements whose difference is 111. Given nnn, construct a beautiful permutation if such a permutation exists. Input The only input line contains an integer on n. Output Pri...

2 min read · [ramandeepsingh.hashnode.dev](https://ramandeepsingh.hashnode.dev/permutations?utm_source=hashnode&utm_medium=feed)

[Jan 29, 2024](https://hashnode.com/posts/permutations/65b777e0617be5cc4db58e8b)

### [Repetitions](https://ramandeepsingh.hashnode.dev/repetitions?utm_source=hashnode&utm_medium=feed)

You are given a DNA sequence: a string consisting of characters A, C, G, and T. Your task is to find the longest repetition in the sequence. This is a maximum-length substring containing only one type of character. Input The only input line contains ...

1 min read · [ramandeepsingh.hashnode.dev](https://ramandeepsingh.hashnode.dev/repetitions?utm_source=hashnode&utm_medium=feed)

[Jan 29, 2024](https://hashnode.com/posts/repetitions/65b71e88a06bee91f3219f16)
