Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings
View efarioli's full-sized avatar

Highlights

  • Pro

Block or report efarioli

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. Find all Anagrams. Given a very long... Find all Anagrams. Given a very long list of words: find all the sets of anagrams, print each set, print the total quantity of sets and print the total quantity of words.
    1
    using System;
    2
    using System.Collections.Concurrent;
    3
    using System.Collections.Generic;
    4
    using System.Diagnostics;
    5
    using System.IO;
  2. You will be provided with an initial... You will be provided with an initial array (the first argument in the destroyer function), followed by one or more arguments. Remove all elements from the initial array that are of the same value as these arguments.
    1
    //javascript
    2
    function destroyer(arr) {
    3
      var argLen = arguments.length;
    4
      console.log(argLen);
    5
      var arr2 = [];
  3. One of the simplest and most widely ... One of the simplest and most widely known ciphers is a Caesar cipher, also known as a shift cipher
    1
    //javascript
    2
    /*One of the simplest and most widely known ciphers is a Caesar cipher, also known as a shift cipher. In a shift cipher the meanings of the letters are shifted by some set amount.
    3
    
                  
    4
    A common modern use is the ROT13 cipher, where the values of the letters are shifted by 13 places. Thus 'A' ↔ 'N', 'B' ↔ 'O' and so on.
    5
    
                  
  4. Return an array consisting of the la... Return an array consisting of the largest number from each provided sub-array. For simplicity, the provided array will contain exactly 4 sub-arrays.
    1
    //javascript
    2
    function largestOfOne(arr) {
    3
      var largest = 0;
    4
      console.log(arr.length);
    5
      for (i = 0; i < arr.length; i++) {
  5. Return true if the passed string is ... Return true if the passed string is a valid US phone number. The user may fill out the form field any way they choose as long as it is a valid US number. The following are examples of valid formats for US numbers (refer to the tests below for other variants): 555-555-5555 ||| (555)555-5555 ||| (555) 555-5555 ||| 555 555 5555 ||| 5555555555 ||| 1 555 555 5555
    1
    //javascript
    2
    function telephoneCheck(str) {
    3
       
    4
      if (!balancedParens(str)){
    5
        return false;
Morty Proxy This is a proxified and sanitized view of the page, visit original site.