Hello there, today we are going to solve Day 4: Count Objects Hacker Rank Solution in JavaScript which is a Part of 10 Days Of JavaScript Series.
Table Of Contents 👊Objective
In this challenge, we learn about iterating over objects.
Task
Complete the function in the editor. It has one parameter: an array, a, of objects. Each object in the array has two integer properties denoted by x and y. The function must return a count of all such objects o in array a that satisfy o.x == o.y.
Input Format
The first line contains an integer denoting n.
Each of the n subsequent lines contains two space-separated integers describing the values of x and y.
Constraints
- 5 <= n <= 10
- 1 <= x, y <= 100
Output Format
Return a count of the total number of objects o such that o.x == o.y. Locked stub code in the editor prints the returned value to STDOUT.
Sample Input 0
5
1 1
2 3
3 3
3 4
4 5
Sample Output 0
2
Explanation 0
There are n = 5 objects in the objects array:
- objects0 = {x: 1, y: 1}
- objects1 = {x: 2, y: 3}
- objects2 = {x: 3, y: 3}
- objects3 = {x: 3, y: 4}
- objects4 = {x: 4, y: 5}
Because we have two objects o that satisfy o.x == o.y(i.e., objects0 and objects2), we return 2 as our answer.
Solution - Day 4: Count Objects
'use strict';
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', inputStdin => {
inputString += inputStdin;
});
process.stdin.on('end', _ => {
inputString = inputString.trim().split('\n').map(string => {
return string.trim();
});
main();
});
function readLine() {
return inputString[currentLine++];
}
function getCount(objects) {
var count = 0;
for (var index in objects){
if (objects[index].x == objects[index].y){
count++;
}
}
return count;
}
function main() {
const n = +(readLine());
let objects = [];
for (let i = 0; i < n; i++) {
const [a, b] = readLine().split(' ');
objects.push({x: +(a), y: +(b)});
}
console.log(getCount(objects));
}
Disclaimer: The above Problem (Count Objects) is generated by Hacker Rank but the Solution is Provided by Sloth Coders. This tutorial is only for Educational and Learning Purpose.