README.md

• You should need somewhat a strong knowledge in

• These are the Intermediate Algos

  • 🥈 ArrayDestroyer
    Given a array of datas, delete the the datas which is present as second argument
  • 🥈 CountBits
    convert the given number to binary and count it
  • 🥈 DigitalRoot
    data = 493193 -> 4+9+3+1+9+3 = 29 =2+9 = 11
  • 🥈 DNAPairing
    dna pairing(CG TA)!
  • 🥈 DomainSeperator
    seperate the domain from the given link
  • 🥈 FbLikeSystem
    implementing FB likes algorithm
  • 🥈 FindNums
    find the nums with even num of digits(more explanation in the file)
  • 🥈 FindOutlier
    find the party outlier. for eg:- return the odd number if that is the only odd number in the party
  • 🥈 HashtagGenerator
    yes the name says it
  • 🥈 IntersectionElements
    return the intersection elements from 2 arrays
  • 🥈 PalindromeCheck(Ignore Special Characters)
    given the string, checks if it is palindrome by ignoring the special characters
  • 🥈 IsPangram
    check if the given string contains all the alphabets(pangram)
  • 🥈 MaxConsecutiveNum
    return the maxconsecutiveones occuring sum
  • 🥈 MedianOfSortedArr
    return the median of a sorted array
  • 🥈 PigLatin
    Rules for pig latin is given in the file
  • 🥈 SortOrder
    sorting order with numbers btw words!
  • 🥈 SortedUnion
    getting n number of arrays, sort it all return as one array(no duplicates)
  • 🥈 SpinalCase
    convert the string into spinal case
  • 🥈 SpinWords
    if the word is more than or equal to 5 then reverse it and append with all of them
  • 🥈 StringSplit
    rules are mentioned in the program
  • 🥈 SymmetricDifference
    find and return the symmetric SymmetricDifference of an array
  • 🥈 ToHTMLEntities
    convert symbols to html entities
  • 🥈 TruthCheck
    check if the pre inside the object is true
  • 🥈 TwoSum
    return the 2 numbers which sums up into the second argument
  • 🥈 UniqueInOrder
    unique words or arrays or integers or whatever... no duplicates at same time
  • 🥈 ValidParantheses
    check if the parantheses are valid
  • 🥈 WhereMyAnagramAt
    This is really hard to explain so you may have to check the program first
  • 🥈 PowXN
    Find the power of x raise to n
  • 🥈 MyAtoi
    Create a atoi function
  • 🥈 WordLadder
    Word ladder
  • 🥈 StrongPasswordCheck
    Given a password, check and return the number of steps required to make it stronger, if it's already strong then return 0