asethia

package linkedlist

import scala.annotation.tailrec
import scala.collection.immutable.HashMap


/**
  * LinkList remove duplicates using HashMap
  * Time Complexity O(n)
  * Space Complexity O(n) for hashmap if all are duplicates

asethia

import org.scalatest.{Matchers, FunSpec, WordSpec}

import scala.util.Try

/**
  * Given an image represented by an NxN matrix,
  * write a method to rotate the by 90 degrees.
  * do this in place.
  * Time Complexity O(n*n)
  * Created by Arun Sethia on 7/8/18.

asethia

import org.scalatest.{Matchers, WordSpec}

import scala.annotation.tailrec

/**
  * Assume you have a method isSubstring which checks if one word is a substring of another.
  * Given two strings, 51 and 52, write code to check if 52 is a rotation of 51 using only
  * one call to isSubstring (e.g.,"waterbottle"is a rotation of"erbottlewat").
  * Time Complexity: O(n)
  * Created by Arun Sethia on 7/7/18.

asethia

package arraystring

import org.scalatest.{Matchers, WordSpec}

import scala.annotation.tailrec
import scala.collection.mutable.StringBuilder

/**
  * basic string compression using the counts of repeated characters.
  * For example, the string aabcccccaaa would become a2b1c5a3.

asethia

import org.scalatest.{Matchers, WordSpec}

import scala.annotation.tailrec

/**
  * There are three types of edits that can be performed on strings: insert a character, remove a character,
  * or replace a character.
  * Given two strings, write a function to check if they are one edit (or zero edits) away.
  * pale, pIe -> true
  * pales, pale -> true

asethia

import scala.annotation.tailrec

/**
  * From given string input can we make Palindrome or not
  * Input: Tact Coa
  * Output: True 
  * (permutations: "taco cat". "atco cta". etc.)
  * Created by Arun Sethia on 7/6/18.
  */
trait PalindromePermutation {

asethia

/**
  * Write a method to replace all spaces in a string with '%20: 
  * You may assume that the string has sufficient space at the end to hold the additional characters
  * Input: "hello world   " 
  * Output: "hello%20world"
  * Created by Arun Sethia on 7/5/18.
  */
trait URLify {

  /**

asethia

import scala.annotation.tailrec

/**
  * given two strings, write a method to decide if one is a permutation of the other.
  * Created by Arun Sethia on 7/5/18.
  */
trait AnagramString {

  final val ASCII_CHAR_LEN: Int = 128

asethia

import scala.annotation.tailrec

/**
  * find given string has unique characters
  *
  * Created by Arun Sethia on 5/21/18.
  */
trait UniqueCharacters {
  //ASCII Characters 128
  def isUnique(input: String): Boolean = {

asethia

package searchpattern

import scala.annotation.tailrec

/**
  * KMP Pattern Matching
  * inspired from https://www.youtube.com/watch?v=GTJr8OvyEVQ
  * Created by Arun Sethia on 6/13/18.
  */
object KMPAlgorithm extends App {