Added public key words

Author: jindulys

Sources/DynamicProgramming.swift

@@ -8,7 +8,9 @@
 
 import Foundation
 
-class CoinChangeProblem {
+public class CoinChangeProblem {
+ public init() {}
+ 
  func solution() {
  // read in N, M
  let metrics = getLineToArray().map {Int($0)!}
@@ -26,7 +28,7 @@ class CoinChangeProblem {
  // 1. dont use the mth coin
  // 2. use at least 1 mth coin
  // By constructing a table we could avoid overlapping subproblems
- func solveChanges(coins:[Int], coinsCounts:Int, total:Int) {
+ public func solveChanges(coins:[Int], coinsCounts:Int, total:Int) {
  // 1. construct matrix to save result
  // - row represent total count from 0 to total
  // - col represent mth coin to use
@@ -49,7 +51,10 @@ class CoinChangeProblem {
  }
 }
 
-class MaximumSubArray {
+public class MaximumSubArray {
+ 
+ public init() {}
+ 
  func solution() {
  let T = Int(getLine())!
  for _ in 0..<T {
@@ -59,7 +64,7 @@ class MaximumSubArray {
  }
  }
 
- func solve(inputs:[Int]) {
+ public func solve(inputs:[Int]) {
  let maxElement = inputs.maxElement()
  if let maxE = maxElement where maxE < 0 {
  print("\(maxE) \(maxE)")
@@ -101,7 +106,10 @@ func ==(lhs: KnapSackPair, rhs: KnapSackPair) -> Bool {
  return lhs.itemIndex == rhs.itemIndex && lhs.capacity == rhs.capacity
 }
 
-class Knapsack {
+public class Knapsack {
+ 
+ public init() {}
+ 
  func solution() {
  let T = getInt()
  for _ in 0..<T {
@@ -114,7 +122,7 @@ class Knapsack {
  /**
  * This solution used memoization approach, which is a fantistic feature from Swift
  */
- func solveWithMemo(N: Int, K: Int, array:[Int]) {
+ public func solveWithMemo(N: Int, K: Int, array:[Int]) {
  if K == 0 {
  print("0")
  return
@@ -143,7 +151,10 @@ class Knapsack {
  }
 }
 
-class LongestIncreasingSubsequence {
+public class LongestIncreasingSubsequence {
+ 
+ public init() {}
+ 
  func solution() {
  let N = getInt()
  let array = getLinesToArray(N).map { Int($0)! }
@@ -155,7 +166,7 @@ class LongestIncreasingSubsequence {
  * LIS[i] = max(LIS) 
  * time efficiency O(n^2)
  */
- func solve(array:[Int]) {
+ public func solve(array:[Int]) {
  let N = array.count
  var LIS = Array(count: N, repeatedValue: 0)
  LIS[0] = 1
@@ -203,7 +214,9 @@ class LongestIncreasingSubsequence {
  }
 }
 
-class SherlockAndCost {
+public class SherlockAndCost {
+ 
+ public init() {}
 
  func solution() {
  let T = getInt()
@@ -241,9 +254,12 @@ class SherlockAndCost {
  }
 }
 
-class HexagonalGrid {
+public class HexagonalGrid {
+ 
  static let nextPos = [(1, 0), (1, -1), (0, 1)]
 
+ public init() {}
+ 
  func solution() {
  let T = getInt()
  for _ in 0..<T {
@@ -263,7 +279,7 @@ class HexagonalGrid {
  }
  }
 
- func solve(grid:[[Int]]) {
+ public func solve(grid:[[Int]]) {
  var currentGrid = grid
  if rec(&currentGrid) {
  print("YES")
@@ -305,15 +321,18 @@ class HexagonalGrid {
  }
 }
 
-class SamAndSubString {
+public class SamAndSubString {
+ 
+ public init() {}
+ 
  static let MOD = Int(1e9 + 7)
 
  func solution() {
  let input = getLine()
  solve(input)
  }
 
- func solve(input:String) -> Int {
+ public func solve(input:String) -> Int {
  let N = input.characters.count
  var preSum = Array(count: N, repeatedValue: 0)
  preSum[0] = Int(String(input.characters.first!))!
@@ -336,7 +355,10 @@ class SamAndSubString {
  }
 }
 
-class TravelAroundTheWorld {
+public class TravelAroundTheWorld {
+ 
+ public init() {}
+ 
  func solution() {
  let metrics = getLineToArray().map { Int($0)! }
  let a = getLineToArray().map() { Int($0)! }
@@ -357,7 +379,7 @@ class TravelAroundTheWorld {
  * all of the city with need[i] == 0 is suitable start point
  *
  */
- func solve(c:Int, a:[Int], b:[Int]) -> Int {
+ public func solve(c:Int, a:[Int], b:[Int]) -> Int {
  let N = a.count
  var earthA = Array(count: 2*N, repeatedValue: 0)
  var earthB = Array(count: 2*N, repeatedValue: 0)
@@ -412,7 +434,10 @@ class TravelAroundTheWorld {
  }
 }
 
-class RedJohnisBack {
+public class RedJohnisBack {
+ 
+ public init() {}
+ 
  func solution() {
  let T = getInt()
  for _ in 0..<T {
@@ -422,7 +447,7 @@ class RedJohnisBack {
  }
 
  // Use a way similar to fibonacci sequence
- func solve(n:Int) -> Int {
+ public func solve(n:Int) -> Int {
  let fibOneAndFour: (Int)->Int = memoize { fibOneAndFour, n in
  if n>=1 && n<=3 {
  return 1
@@ -444,30 +469,33 @@ class RedJohnisBack {
  * Struct Passenger to store information like offer value and accept weight of gold
  * Using struct here is for sorting
  */
-struct Passenger {
+public struct Passenger {
  let offer: Int
  let weight: Int
 }
 
 extension Passenger : Hashable {
- var hashValue : Int {
+ public var hashValue : Int {
  get {
  return offer.hashValue + weight.hashValue
  }
  }
 }
 
 extension Passenger : CustomStringConvertible {
- var description: String { return "Passenger offer \(offer) for \(weight)grams" }
+ public var description: String { return "Passenger offer \(offer) for \(weight)grams" }
 }
 
-func ==(lhs: Passenger, rhs: Passenger) -> Bool {
+public func ==(lhs: Passenger, rhs: Passenger) -> Bool {
  return lhs.offer == rhs.offer && lhs.weight == rhs.weight
 }
 
 let LOWESTNUMBER = -1 * NSIntegerMax
 
-class DorseyThief {
+public class DorseyThief {
+ 
+ public init() {}
+ 
  func solution() {
  let metrics = getLineToArray().map { Int($0)! }
  var array: [Passenger] = []
@@ -479,7 +507,7 @@ class DorseyThief {
  solve(array, c:metrics[1])
  }
 
- func solve(array:[Passenger],c:Int)->Int {
+ public func solve(array:[Passenger],c:Int)->Int {
  // sort the input array
  let sortedArray = array.sort { p1, p2 in
  if p1.offer == p2.offer {

Sources/Implementation.swift

@@ -9,7 +9,10 @@
 import Foundation
 
 // https://www.hackerrank.com/challenges/angry-professor
-class AngryProfessor {
+public class AngryProfessor {
+ 
+ public init() {}
+ 
  func solution() -> Void {
  let TN = Int(getLine())!
  for _ in 0..<TN {
@@ -29,7 +32,10 @@ class AngryProfessor {
 }
 
 // https://www.hackerrank.com/challenges/sherlock-and-the-beast
-class SherlockAndTheBeast {
+public class SherlockAndTheBeast {
+ 
+ public init() {}
+ 
  func solution() -> Void {
  let TN = Int(getLine())!
  for _ in 0..<TN {
@@ -38,7 +44,7 @@ class SherlockAndTheBeast {
  }
  }
 
- func cypherOutput(cypher: Int) -> String {
+ public func cypherOutput(cypher: Int) -> String {
  for i in SRange(start: cypher/3*3, end:-1, step:-3) {
  if (cypher - i) % 5 == 0 {
  let fives = String(count: i, repeatedValue: Character("5"))
@@ -50,7 +56,7 @@ class SherlockAndTheBeast {
  }
 }
 
-class UtopianTree {
+public class UtopianTree {
  var heights:[Int]
 
  static func generatesHeights() -> [Int] {
@@ -69,7 +75,7 @@ class UtopianTree {
  return heights
  }
 
- init() {
+ public init() {
  heights = UtopianTree.generatesHeights()
  }
 
@@ -82,8 +88,11 @@ class UtopianTree {
  }
 }
 
-class FindDigits {
- func countN(n: String) {
+public class FindDigits {
+ 
+ public init() {}
+ 
+ public func countN(n: String) {
  let N = Int(n)!
  var count = 0
  for c in n.characters {

Sources/IndeedPrime.swift

@@ -8,7 +8,9 @@
 
 import Foundation
 
-class TheUltimateQuestion {
+public class TheUltimateQuestion {
+ public init() {}
+ 
  func solution() {
  let inputs = getLineToArray().map {Int($0)!}
  let addSum = (inputs.reduce(0, combine: +), "\(inputs[0])+\(inputs[1])+\(inputs[2])")
@@ -26,7 +28,8 @@ class TheUltimateQuestion {
  }
 }
 
-class RelatedSpecies {
+public class RelatedSpecies {
+ public init() {}
  func solution() {
  let T = Int(getLine())!
  for _ in 0..<T {
@@ -38,7 +41,7 @@ class RelatedSpecies {
  }
 
  // This solution timeout
- func solve(a: [Int], b: [Int], N: Int) {
+ public func solve(a: [Int], b: [Int], N: Int) {
  var current = 0
  for i in 0..<N {
  let currentMax = max(a[i], b[i])
@@ -59,7 +62,9 @@ class RelatedSpecies {
  // Divide and conquer
 }
 
-class Gretchen {
+public class Gretchen {
+ 
+ public init() {}
  // Overtime
  func solution() {
  var parameters = getLineToArray().map {Int($0)!}