Even Index Sum in JavaScript

AmitDiwan
Updated on 17-Apr-2021 11:52:45

629 Views

ProblemWe are required to write a JavaScript function that takes in an array of integers. Our function should return the sum of all the integers that have an even index, multiplied by the integer at the last index.const arr = [4, 1, 6, 8, 3, 9];Expected output −const output = 117;ExampleFollowing is the code − Live Democonst arr = [4, 1, 6, 8, 3, 9]; const evenLast = (arr = []) => {    if (arr.length === 0) {       return 0    } else {       const sub = arr.filter((_, index) => index%2===0)       const sum = sub.reduce((a,b) => a+b)       const posEl = arr[arr.length -1]       const res = sum*posEl       return res    } } console.log(evenLast(arr));OutputFollowing is the console output −117

Find If Undirected Graph Contains Cycle Using BFS in Python

AmitDiwan
Updated on 17-Apr-2021 11:50:55

480 Views

When it is required to find the sum of all the nodes of a tree, a class is created, and it contains methods to set the root node, add elements to the tree, search for a specific element, and add elements of the tree to find the sum and so on. An instance of the class can be created to access and use these methods.Below is a demonstration of the same −Example Live Demofrom collections import deque def add_edge(adj: list, u, v):    adj[u].append(v)    adj[v].append(u) def detect_cycle(adj: list, s, V, visited: list):    parent = [-1] * ... Read More

Find All Connected Components Using BFS in an Undirected Graph

AmitDiwan
Updated on 17-Apr-2021 11:50:37

745 Views

When it is required to find the sum of all the nodes of a tree, a class is created, and it contains methods to set the root node, add elements to the tree, search for a specific element, and add elements of the tree to find the sum and so on. An instance of the class can be created to access and use these methods.Below is a demonstration of the same −Example Live Democlass Graph_structure:    def __init__(self, V):       self.V = V       self.adj = [[] for i in range(V)]    def DFS_Utility(self, temp, ... Read More

Find All Nodes Reachable from a Node Using BFS in a Graph

AmitDiwan
Updated on 17-Apr-2021 11:50:18

819 Views

When it is required to find the sum of all the nodes of a tree, a class is created, and it contains methods to set the root node, add elements to the tree, search for a specific element, and add elements of the tree to find the sum and so on. An instance of the class can be created to access and use these methods.Below is a demonstration of the same −Example Live Demofrom collections import deque def add_edge(v, w):    global visited_node, adj    adj[v].append(w)    adj[w].append(v) def BFS_operation(component_num, src):    global visited_node, adj    queue ... Read More

Display Nodes of a Tree Using BFS Traversal in Python

AmitDiwan
Updated on 17-Apr-2021 11:49:49

930 Views

When it is required to display the nodes of a tree using the breadth first search traversal, a class is created, and it contains methods to set the root node, add elements to the tree, search for a specific element, perform ‘bfs’ (breadth first search) and so on. An instance of the class can be created to access and use these methods.Below is a demonstration of the same −Example Live Democlass Tree_struct:    def __init__(self, data=None):       self.key = data       self.children = []    def set_root(self, data):       self.key = data   ... Read More

Find the Sum of All Nodes in a Binary Tree using Python

AmitDiwan
Updated on 17-Apr-2021 11:49:29

267 Views

When it is required to find the sum of all the nodes of a tree, a class is created, and it contains methods to set the root node, add elements to the tree, search for a specific element, and add elements of the tree to find the sum and so on. An instance of the class can be created to access and use these methods.Below is a demonstration of the same −Example Live Democlass Tree_struct:    def __init__(self, data=None):       self.key = data       self.children = []    def set_root(self, data):       self.key = ... Read More

Filter String to Contain Unique Characters in JavaScript

AmitDiwan
Updated on 17-Apr-2021 11:49:16

811 Views

ProblemWe are required to write a JavaScript function that takes in a string str. Our function should construct a new string that contains only the unique characters from the input string and remove all occurrences of duplicate characters.ExampleFollowing is the code − Live Democonst str = 'hey there i am using javascript'; const removeAllDuplicates = (str = '') => {    let res = '';    for(let i = 0; i < str.length; i++){       const el = str[i];       if(str.indexOf(el) === str.lastIndexOf(el)){          res += el;          continue;       };    };    return res; }; console.log(removeAllDuplicates(str));OutputFollowing is the console output −Ymungjvcp

Separate Data Types from Array into Groups in JavaScript

AmitDiwan
Updated on 17-Apr-2021 11:42:09

613 Views

ProblemWe are required to write a JavaScript function that takes in an array of mixed data types. Our function should return an object that contains data type names as key and their value as array of elements of that specific data type present in the array.ExampleFollowing is the code − Live Democonst arr = [1, 'a', [], '4', 5, 34, true, undefined, null]; const groupDataTypes = (arr = []) => {    const res = {};    for(let i = 0; i < arr.length; i++){       const el = arr[i];       const type = typeof el;   ... Read More

Mathematics Summation Function in JavaScript

AmitDiwan
Updated on 17-Apr-2021 11:40:30

2K+ Views

ProblemWe are required to write a JavaScript function that takes in a number n. Our function should return the sum of all the natural numbers from 1 to n including both 1 and nExampleFollowing is the code − Live Democonst num = 34; const summation = (num = 1) => {    let res = 0;    for(let i = 1; i

Create All Possible Unique Permutations of a String in JavaScript

AmitDiwan
Updated on 17-Apr-2021 11:39:18

1K+ Views

ProblemWe are required to write a JavaScript function that takes in a string str. Our function should create all permutations of the input string and remove duplicates, if present. This means, we have to shuffle all letters from the input in all possible orders.ExampleFollowing is the code − Live Democonst str = 'aabb'; const permute = (str = '') => {    if (!!str.length && str.length < 2 ){       return str    }    const arr = [];    for (let i = 0; i < str.length; i++){       let char = str[i]       ... Read More

Advertisements