// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// convert
//
// 6. Zigzag Conversion
//
// The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
//

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
import (
    "strings"
)
 
// reverseWords
//
// 151. Reverse Words in a String

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// longestCommonPrefix
//
// 14. Longest Common Prefix
//
// Write a function to find the longest common prefix string amongst an array of strings.
//
// If there is no common prefix, return an empty string "".
//

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// lengthOfLastWord
//
// 58. Length of Last Word
// Given a string s consisting of words and spaces, return the length of the last word in the string.
//
// A word is a maximal
// substring
//
//  consisting of non-space characters only.
//
// Example 1:

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
import (
    "bytes"
 
// intToRoman
//
// 12. Integer to Roman
//
// Seven different symbols represent Roman numerals with the following values:
//
// Symbol      Value
// I     1
// V     5
// X

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// romanToInt
//
// 13. Roman to Integer
//
// Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
//
// Symbol       Value
// I             1
// V             5
// X             10

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// candy
//
// 135. Candy
// There are n children standing