Pinned Repositories
Check-Permutation
Given two strings, wrote a method to decide if one is a permutation of the other.
CS-4990-Final-Project---Daren-Sathy-
CS 4990 Final Project - Daren Sathy
One-Away
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, I wrote a function to check if they are one edit (or zero edits) away.
Palindrome-Permutation
Given a string, created a function to check if it is a permutation of a palindrome.
String-Compression-
Implemented a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3
Unique-Characters
Implemented an algorithm to determine if a string has all unique characters.
URLify
Developed a method to replace all spaces in a string with '%20'
DarenSathy's Repositories
DarenSathy/CS-4990-Final-Project---Daren-Sathy-
CS 4990 Final Project - Daren Sathy
DarenSathy/String-Compression-
Implemented a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3
DarenSathy/One-Away
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, I wrote a function to check if they are one edit (or zero edits) away.
DarenSathy/Palindrome-Permutation
Given a string, created a function to check if it is a permutation of a palindrome.
DarenSathy/URLify
Developed a method to replace all spaces in a string with '%20'
DarenSathy/Check-Permutation
Given two strings, wrote a method to decide if one is a permutation of the other.
DarenSathy/Unique-Characters
Implemented an algorithm to determine if a string has all unique characters.