Support LeetCode contests

libcaide/libcaide.cabal

@@ -169,6 +169,7 @@ library
         Caide.Parsers.GCJ
         Caide.Parsers.HackerRank
         Caide.Parsers.LeetCode
+        Caide.Parsers.LeetCodeContest
         Caide.Parsers.POJ
         Caide.Parsers.RCC
         Caide.Parsers.RccContest

libcaide/src/Caide/Commands/ParseContest.hs

@@ -4,22 +4,22 @@ module Caide.Commands.ParseContest(
 ) where
 
 import Data.List (find)
-import qualified Data.Text as T
 
 import Caide.Types (CaideIO, throw)
 
 import Caide.Parsers.Common (URL, ContestParser(..))
 import Caide.Parsers.CodeforcesContest
 import Caide.Parsers.CodeChefContest
+import qualified Caide.Parsers.LeetCodeContest as LeetCode
 import Caide.Parsers.RccContest
 
 createContest :: URL -> CaideIO ()
 createContest contestUrl = case findContestParser contestUrl of
-    Nothing -> throw . T.concat $ [contestUrl, " is not recognized as a supported contest URL"]
+    Nothing -> throw $ contestUrl <> " is not recognized as a supported contest URL"
     Just contestParser -> contestParser `parseContest` contestUrl
 
 contestParsers :: [ContestParser]
-contestParsers = [codeforcesContestParser, codeChefContestParser, rccContestParser]
+contestParsers = [codeforcesContestParser, codeChefContestParser, LeetCode.contestParser, rccContestParser]
 
 findContestParser :: URL -> Maybe ContestParser
 findContestParser url = find (`contestUrlMatches` url) contestParsers

libcaide/src/Caide/Parsers/LeetCodeContest.hs

@@ -0,0 +1,62 @@
+{-# LANGUAGE DeriveGeneric, NamedFieldPuns, OverloadedStrings #-}
+module Caide.Parsers.LeetCodeContest(
+      contestParser
+) where
+
+import Control.Monad.Extended (liftIO)
+import qualified Data.ByteString.Lazy as LBS
+import Data.Either.Util (mapLeft)
+import qualified Data.Text as T
+import qualified Data.Text.Encoding as T
+import Data.Text (Text)
+
+import GHC.Generics (Generic)
+import Network.URI (parseURI, pathSegments, URI(uriPath, uriQuery, uriFragment))
+
+import qualified Data.Aeson as Aeson
+
+import Caide.Commands.ParseProblem (parseProblems)
+import Caide.Parsers.Common (URL, ContestParser(..), isHostOneOf)
+import Caide.Types
+import Caide.Util (downloadDocument, tshow)
+
+
+isLeetCodeUrl :: URL -> Bool
+isLeetCodeUrl = isHostOneOf ["leetcode.com", "www.leetcode.com", "leetcode-cn.com", "www.leetcode-cn.com"]
+
+
+contestParser :: ContestParser
+contestParser = ContestParser
+    { contestUrlMatches = isLeetCodeUrl
+    , parseContest = doParseContest
+    }
+
+newtype ProblemInContest = ProblemInContest { title_slug :: Text }
+    deriving (Show, Generic)
+instance Aeson.FromJSON ProblemInContest
+
+newtype Contest = Contest { questions :: [ProblemInContest] }
+    deriving (Show, Generic)
+instance Aeson.FromJSON Contest
+
+
+eitherDecodeText' :: Aeson.FromJSON a => Text -> Either Text a
+eitherDecodeText' = mapLeft T.pack . Aeson.eitherDecode' . LBS.fromStrict . T.encodeUtf8
+
+doParseContest :: URL -> CaideIO ()
+doParseContest url = case (mbUri, mbPathSegments) of
+    (Just uri, Just seg) | length seg >= 2 && seg !! (length seg - 2) == "contest" -> do
+        let contestId = last seg
+            apiUri = uri{uriPath = "/contest/api/info/" <> contestId <> "/", uriQuery="", uriFragment=""}
+            probUrlPrefix = tshow $ apiUri{uriPath="/problems/"}
+        mbDoc <- liftIO $ downloadDocument $ tshow apiUri
+        case mbDoc >>= eitherDecodeText' of
+            Left err -> throw err
+            Right (Contest{questions}) -> parseProblems 3 $
+                [ probUrlPrefix <> (title_slug prob) | prob <- questions ]
+
+    _ -> throw "Invalid contest url"
+  where
+    mbUri = parseURI (T.unpack url)
+    mbPathSegments = pathSegments <$> mbUri
+

libcaide/tests/leetcode-contest.test

@@ -0,0 +1,6 @@
+#!/bin/bash
+
+basic_init
+"$CAIDE" contest https://leetcode.com/contest/weekly-contest-291
+compare_with after-parse {total-appeal-of-a-string,k-divisible-elements-subarrays,minimum-consecutive-cards-to-pick-up,remove-digit-from-number-to-maximize-result}/{problem.ini,case{1,2}.{in,out}}
+

libcaide/tests/leetcode-contest/after-parse/k-divisible-elements-subarrays/case1.out

@@ -0,0 +1 @@
+11

libcaide/tests/leetcode-contest/after-parse/k-divisible-elements-subarrays/case2.in

@@ -0,0 +1,3 @@
+[1,2,3,4]
+4
+1

libcaide/tests/leetcode-contest/after-parse/k-divisible-elements-subarrays/case2.out

@@ -0,0 +1 @@
+10

libcaide/tests/leetcode-contest/after-parse/k-divisible-elements-subarrays/problem.ini

@@ -0,0 +1,5 @@
+[problem]
+double_precision: 0.000001
+name: K Divisible Elements Subarrays
+type: leetcode,countDistinct:int,nums:vint,k:int,p:int
+

libcaide/tests/leetcode-contest/after-parse/minimum-consecutive-cards-to-pick-up/case1.in

@@ -0,0 +1 @@
+[3,4,2,3,4,7]

libcaide/tests/leetcode-contest/after-parse/minimum-consecutive-cards-to-pick-up/case1.out

@@ -0,0 +1 @@
+4

libcaide/tests/leetcode-contest/after-parse/minimum-consecutive-cards-to-pick-up/case2.in

@@ -0,0 +1 @@
+[1,0,5,3]

libcaide/tests/leetcode-contest/after-parse/minimum-consecutive-cards-to-pick-up/case2.out

@@ -0,0 +1 @@
+-1

libcaide/tests/leetcode-contest/after-parse/minimum-consecutive-cards-to-pick-up/problem.ini

@@ -0,0 +1,5 @@
+[problem]
+double_precision: 0.000001
+name: Minimum Consecutive Cards to Pick Up
+type: leetcode,minimumCardPickup:int,cards:vint
+

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case1.in

@@ -0,0 +1,2 @@
+"123"
+"3"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case1.out

@@ -0,0 +1 @@
+"12"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case2.in

@@ -0,0 +1,2 @@
+"1231"
+"1"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case2.out

@@ -0,0 +1 @@
+"231"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case3.in

@@ -0,0 +1,2 @@
+"551"
+"5"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/case3.out

@@ -0,0 +1 @@
+"51"

libcaide/tests/leetcode-contest/after-parse/remove-digit-from-number-to-maximize-result/problem.ini

@@ -0,0 +1,5 @@
+[problem]
+double_precision: 0.000001
+name: Remove Digit From Number to Maximize Result
+type: leetcode,removeDigit:String,number:String,digit:character
+

libcaide/tests/leetcode-contest/after-parse/total-appeal-of-a-string/case1.in

@@ -0,0 +1 @@
+"abbca"

libcaide/tests/leetcode-contest/after-parse/total-appeal-of-a-string/case1.out

@@ -0,0 +1 @@
+28

libcaide/tests/leetcode-contest/after-parse/total-appeal-of-a-string/case2.in

@@ -0,0 +1 @@
+"code"

libcaide/tests/leetcode-contest/after-parse/total-appeal-of-a-string/case2.out

@@ -0,0 +1 @@
+20

libcaide/tests/leetcode-contest/after-parse/total-appeal-of-a-string/problem.ini

@@ -0,0 +1,5 @@
+[problem]
+double_precision: 0.000001
+name: Total Appeal of A String
+type: leetcode,appealSum:long,s:String
+