DEV Community: Madalina Pastiu

Anagram Detection

Madalina Pastiu — Thu, 10 Jul 2025 23:56:00 +0000

Instructions:

An anagram is the result of rearranging the letters of a word to produce a new word (see wikipedia).

Note: anagrams are case insensitive

Complete the function to return true if the two arguments given are anagrams of each other; return false otherwise.

Examples
"foefet" is an anagram of "toffee"

"Buckethead" is an anagram of "DeathCubeK"

Solution:

var isAnagram = function(test, original) {
  const ordered = str => str.toLowerCase().split('').sort().join();
  return ordered(test) === ordered(original);
};

Thoughts:

I created a function named ordered that takes a string and transforms it 1st to lower case, then will split to an array of letters and sort it alphabetically. At the ens it does join the string back together in the new order.
I do compare through the function above the 1st string to the 2nd string and returned true or false.

This is a CodeWars Challenge of 7kyu Rank

Welcome!

Madalina Pastiu — Wed, 09 Jul 2025 21:23:00 +0000

Instructions:

Your start-up's BA has told marketing that your website has a large audience in Scandinavia and surrounding countries. Marketing thinks it would be great to welcome visitors to the site in their own language. Luckily you already use an API that detects the user's location, so this is an easy win.

The Task
Think of a way to store the languages as a database. The languages are listed below so you can copy and paste!
Write a 'welcome' function that takes a parameter 'language', with a type String, and returns a greeting - if you have it in your database. It should default to English if the language is not in the database, or in the event of an invalid input.
The Database
Please modify this as appropriate for your language.

[ ("english", "Welcome")
, ("czech", "Vitejte")
, ("danish", "Velkomst")
, ("dutch", "Welkom")
, ("estonian", "Tere tulemast")
, ("finnish", "Tervetuloa")
, ("flemish", "Welgekomen")
, ("french", "Bienvenue")
, ("german", "Willkommen")
, ("irish", "Failte")
, ("italian", "Benvenuto")
, ("latvian", "Gaidits")
, ("lithuanian", "Laukiamas")
, ("polish", "Witamy")
, ("spanish", "Bienvenido")
, ("swedish", "Valkommen")
, ("welsh", "Croeso")
]

Solution:

function greet(language) {
  const languages = [
    ["english", "Welcome"],
    ["czech", "Vitejte"],
    ["danish", "Velkomst"],
    ["dutch", "Welkom"],
    ["estonian", "Tere tulemast"],
    ["finnish", "Tervetuloa"],
    ["flemish", "Welgekomen"],
    ["french", "Bienvenue"],
    ["german", "Willkommen"],
    ["irish", "Failte"],
    ["italian", "Benvenuto"],
    ["latvian", "Gaidits"],
    ["lithuanian", "Laukiamas"],
    ["polish", "Witamy"],
    ["spanish", "Bienvenido"],
    ["swedish", "Valkommen"],
    ["welsh", "Croeso"]
  ];

  for (let i = 0; i < languages.length; i++) {
    if (languages[i][0] === language) {
      return languages[i][1];
    }
  }
  return languages[0][1];
}

Thoughts:

1.I decided to store the input into an array. I loop through the array and if the language was found, will return the greeting in the found language. Otherwise will return 'Welcome' as default.

This is a CodeWars Challenge of 8kyu Rank

#1 School Paperwork

Madalina Pastiu — Tue, 08 Jul 2025 20:06:00 +0000

Instructions:

Your classmates asked you to copy some paperwork for them. You know that there are 'n' classmates and the paperwork has 'm' pages.

Your task is to calculate how many blank pages do you need. If n < 0 or m < 0 return 0.

Example:
n= 5, m=5: 25
n=-5, m=5: 0

Solution:

function paperwork(n, m) {
  if(n<0 || m<0) return 0;
  return n*m;
}

Thoughts:

1.I do create an if statement to verify any of the conditions imposed by instructions.If any of the conditions are met is returning 0 otherwise the return is m*n.

This is a CodeWars Challenge of 8kyu Rank

Find the capitals

Madalina Pastiu — Mon, 07 Jul 2025 17:32:00 +0000

Instructions:

Write a function that takes a single non-empty string of only lowercase and uppercase ascii letters (word) as its argument, and returns an ordered list containing the indices of all capital (uppercase) letters in the string.

Example (Input --> Output)
"CodEWaRs" --> [0,3,4,6]

Solution:

var capitals = function (word) {
    // Write your code here
  const indexes = [];
  for (let i = 0; i < word.length; i++) {
    if (word[i] === word[i].toUpperCase()) {
      indexes.push(i);
    }
  }
  return indices;
  }

Thoughts:

I initialize the indexes as an array and loop through the string word with for loop.
If the letter ( index of the word) matches the condition, the index will be addes to the indexes array.

This is a CodeWars Challenge of 7kyu Rank

Break camelCase

Madalina Pastiu — Sun, 06 Jul 2025 17:23:00 +0000

Instructions:

Complete the solution so that the function will break up camel casing, using a space between words.

Example
"camelCasing" => "camel Casing"
"identifier" => "identifier"
"" => ""

Solution:

function solution(string) {
  return arr = string.split('').map(l => l !== l.toUpperCase() ? l : ' ' + l).join('');

}

Thoughts:

1.I transform the string into an array to be able to iterate easily through each letter/element of the array.
2.I use the function map in order to go through each letter and transformed it based on the condition: l !==l.toUpperCase() .If the original letter is not upper case we return the letter as it is, in case it is upper case , we add a space before the upper letter.

I join the array to a string and return it .

This is a CodeWars Challenge of 6kyu Rank

What's the real floor?

Madalina Pastiu — Sat, 05 Jul 2025 16:06:00 +0000

Instructions:

Americans are odd people: in their buildings, the first floor is actually the ground floor and there is no 13th floor (due to superstition).

Write a function that given a floor in the american system returns the floor in the european system.

With the 1st floor being replaced by the ground floor and the 13th floor being removed, the numbers move down to take their place. In case of above 13, they move down by two because there are two omitted numbers below them.

Basements (negatives) stay the same as the universal level.

More information here

Examples
1 => 0
0 => 0
5 => 4
15 => 13
-3 => -3

Solution 1:

function getRealFloor(n) {
  if(n <13 && n>0) return n-1;
  else if(n>=13) return n-2;
  else return n;
}

Solution 2:

function getRealFloor(n) {
  return n > 13 ? n-2 : n > 0 ? n-1 : n
}

Thoughts:

Just an easy if else function that returns different numbers based on conditions.
I use ternary operator for Solution 2 which do exactly the same.

This is a CodeWars Challenge of 8kyu Rank

Filter out the geese

Madalina Pastiu — Fri, 04 Jul 2025 15:54:00 +0000

Instructions:

Write a function that takes a list of strings as an argument and returns a filtered list containing the same elements but with the 'geese' removed.

The geese are any strings in the following array, which is pre-populated in your solution:

["African", "Roman Tufted", "Toulouse", "Pilgrim", "Steinbacher"]
For example, if this array were passed as an argument:

["Mallard", "Hook Bill", "African", "Crested", "Pilgrim", "Toulouse", "Blue Swedish"]
Your function would return the following array:

["Mallard", "Hook Bill", "Crested", "Blue Swedish"]
The elements in the returned array should be in the same order as in the initial array passed to your function, albeit with the 'geese' removed. Note that all of the strings will be in the same case as those provided, and some elements may be repeated.

Solution:

function gooseFilter(birds) {
  var geese = ["African", "Roman Tufted", "Toulouse", "Pilgrim", "Steinbacher"];
  const newBirds = birds.filter((bird) => !geese.includes(bird));
  return newBirds;
};

Thoughts:

After I define the geese, I filter the birds to return only the ones that do not match with any of the geese elements

This is a CodeWars Challenge of 8kyu Rank

Remove the minimum

Madalina Pastiu — Thu, 03 Jul 2025 15:50:00 +0000

Instructions:

The museum of incredibly dull things wants to get rid of some exhibits. Miriam, the interior architect, comes up with a plan to remove the most boring exhibits. She gives them a rating, and then removes the one with the lowest rating.

However, just as she finished rating all exhibits, she's off to an important fair, so she asks you to write a program that tells her the ratings of the exhibits after removing the lowest one. Fair enough.

Task
Given an array of integers, remove the smallest value. Do not mutate the original array/list. If there are multiple elements with the same value, remove the one with the lowest index. If you get an empty array/list, return an empty array/list.

Don't change the order of the elements that are left.

Examples

Input: [1,2,3,4,5], output = [2,3,4,5]
Input: [5,3,2,1,4], output = [5,3,2,4]
Input: [2,2,1,2,1], output = [2,2,2,1]

Solution:

function removeSmallest(numbers) {
  const num = [...numbers]
  const min = Math.min(...num);
  num.splice(num.indexOf(min), 1);
  return num;
}

Thoughts:

1.I do create a new copy of the original array named num, so it will not modify the original one.
2.I find the min number of the array, the index of the min number and I remove the min number from it.

This is a CodeWars Challenge of 7kyu Rank

Detect Pangram

Madalina Pastiu — Wed, 02 Jul 2025 15:00:00 +0000

Instructions:

A pangram is a sentence that contains every single letter of the alphabet at least once. For example, the sentence "The quick brown fox jumps over the lazy dog" is a pangram, because it uses the letters A-Z at least once (case is irrelevant).

Given a string, detect whether or not it is a pangram. Return True if it is, False if not. Ignore numbers and punctuation.

Try 1:

function isPangram(string) {
  const alphabet = [
    "a",
    "b",
    "c",
    "d",
    "e",
    "f",
    "g",
    "h",
    "i",
    "j",
    "k",
    "l",
    "m",
    "n",
    "o",
    "p",
    "q",
    "r",
    "s",
    "t",
    "u",
    "v",
    "w",
    "x",
    "y",
    "z",
  ];
  const newArray = [...new Set(string.toLowerCase().split(""))];
  const index1 = newArray.indexOf(" ");
  if (index1 !== -1) newArray.splice(index1, 1);
  const index2 = newArray.indexOf(".");
  if (index2 !== -1) newArray.splice(index2, 1);

  return newArray.length === alphabet.length ? true : false;
}

Thoughts 1:

I do split the string into an array of letters and store it in a set type, so I will only have unique letters.I store everything into the newArray variable.
I identify the indexes of the space(' ') and period('.') punctuation and delete them from the array.
Finally, I do compare the length of the newArray with the alphabet length. Taking into account that each letter in the new array is unique, if the lengths are equal results the string is a pangram. 4.The solution above was my 1st try to solve the challenge and does not work. ### Solution:

function isPangram(string) {
  const alphabet = [
    "a",
    "b",
    "c",
    "d",
    "e",
    "f",
    "g",
    "h",
    "i",
    "j",
    "k",
    "l",
    "m",
    "n",
    "o",
    "p",
    "q",
    "r",
    "s",
    "t",
    "u",
    "v",
    "w",
    "x",
    "y",
    "z",
  ];
   const newArr = [...new Set(string.toLowerCase().split(""))]
    .filter(
      (letter) =>
        letter !== " " &&
        letter !== "." &&
        letter !== "," &&
        isNaN(Number(letter))
    );

  return newArr.length === alphabet.length ? true : false;

}

Thoughts 2:

I have modify my function to include numbers and to eliminate my errors.
I do split the string into an array of letters and store it in a set type, so I will only have unique letters. I store everything into the newArr variable. Then filter the resulted array, making sure they respect all the conditions, no punctuation or numbers.

.filter(
      (letter) =>
        letter !== " " &&
        letter !== "." &&
        letter !== "," &&
        isNaN(Number(letter))
    );

Finally, I do compare the length of the newArray with the alphabet length. Taking into account that each letter in the new array is unique, if the lengths are equal results the string is a pangram.

This is a CodeWars Challenge of 6kyu Rank

Parse nice int from char problem

Madalina Pastiu — Tue, 01 Jul 2025 13:02:00 +0000

Instructions:

You ask a small girl,"How old are you?" She always says, "x years old", where x is a random number between 0 and 9.

Write a program that returns the girl's age (0-9) as an integer.

Assume the test input string is always a valid string. For example, the test input may be "1 year old" or "5 years old". The first character in the string is always a number.

Thoughts:

First I want to isolate the 1st string element,since is always a number.After this, I transform it into a number.

Solution:

function getAge(inputString){
// return the girl's correct age as an integer. Happy coding :) 
  return Number(inputString[0]);
}

This is a CodeWars Challenge of 8kyu Rank

Reverse List Order

Madalina Pastiu — Tue, 01 Jul 2025 00:54:49 +0000

Instructions:

In this kata you will create a function that takes in a list and returns a list with the reverse order.

Examples (Input -> Output)

[1, 2, 3, 4] -> [4, 3, 2, 1]
[9, 2, 0, 7] -> [7, 0, 2, 9]

Thoughts:

For this requirement arrays has the reverse() method, that reverse the array/list.

Solution:

function reverseList(list) {
  return list.reverse();
}

This is a CodeWars Challenge of 8kyu Rank

Are they the "same"?

Madalina Pastiu — Tue, 03 Jun 2025 04:00:00 +0000

Instructions:

Given two arrays a and b write a function comp(a, b) (orcompSame(a, b)) that checks whether the two arrays have the "same" elements, with the same multiplicities (the multiplicity of a member is the number of times it appears). "Same" means, here, that the elements in b are the elements in a squared, regardless of the order.

Examples
Valid arrays
a = [121, 144, 19, 161, 19, 144, 19, 11]

b = [121, 14641, 20736, 361, 25921, 361, 20736, 361]
comp(a, b) returns true because in b 121 is the square of 11, 14641 is the square of 121, 20736 the square of 144, 361 the square of 19, 25921 the square of 161, and so on. It gets obvious if we write b's elements in terms of squares:

a = [121, 144, 19, 161, 19, 144, 19, 11]
b = [11*11, 121*121, 144*144, 19*19, 161*161, 19*19, 144*144, 19*19]
Invalid arrays
If, for example, we change the first number to something else, comp is not returning true anymore:

a = [121, 144, 19, 161, 19, 144, 19, 11]

b = [132, 14641, 20736, 361, 25921, 361, 20736, 361]
comp(a,b) returns false because in b 132 is not the square of any number of a.

a = [121, 144, 19, 161, 19, 144, 19, 11]

b = [121, 14641, 20736, 36100, 25921, 361, 20736, 361]
comp(a,b) returns false because in b 36100 is not the square of any number of a.

Remarks
a or b might be [] or {} (all languages except R, Shell).
a or b might be nil or null or None or nothing (except in C++, COBOL, Crystal, D, Dart, Elixir, Fortran, F#, Haskell, Nim, OCaml, Pascal, Perl, PowerShell, Prolog, PureScript, R, Racket, Rust, Shell, Swift).
If a or b are nil (or null or None, depending on the language), the problem doesn't make sense so return false.

Thoughts 1:

Initially, I approached the problem by checking if each number from the first array, when squared, exists in the second array. However, during submission, I encountered errors that made me realise the importance of accounting for multiplicity. Specifically, after matching a squared value from the first array in the second array, I need to remove it from the second array to prevent it from being matched again incorrectly.

Solution 1:

function comp(array1, array2) {
  const arrValue = array2.includes(Math.pow(a,2));
  if (compare.includes(false)) console.log(false);
  else console.log(true);
}

Thoughts 2:

In this solution, I started by checking if either input array is null, as the problem specifies that in such cases we should return false.
Then, for each element in array1, I calculated its square, checked if the square exists in array2 and if it does, I removed that specific squared value from array2 using splice to ensure proper handling of duplicate values (i.e., correct multiplicity).
I collected the result of each comparison in a new array called compare. If any element from array1 did not have a matching square in array2, the final result is false. Otherwise, if all elements matched correctly, I return true.
This logic ensures that:
- The multiplicities are respected.
- The order of elements doesn’t matter.
- Only valid matches are considered, with used elements removed to avoid false positives.

Solution 2:

function comp(array1, array2){
 if( array1 === null || array2 ===null) return false;
 const compare = array1.map(a =>{  
  function removeIndex(){
    var index = array2.indexOf(Math.pow(a,2));
    if (index !== -1) array2.splice(index, 1);
  }
  const arrValue = array2.includes(Math.pow(a,2));
  if(arrValue === true) removeIndex();
  return arrValue;
  });
  if(compare.includes(false)) return false;
  else return true;
}

This is a CodeWars Challenge of 6kyu Rank