You have to define all trigger minutes, it looks ugly but it should work:
CREATE OR REPLACE TASK tsk_master
WAREHOUSE = XS_WH
SCHEDULE = 'USING CRON 0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58 5-17 * * * America/New_York'
TIMESTAMP_INPUT_FORMAT = 'YYYY-MM-DD HH24'
COMMENT = 'Master task job to trigger all other tasks'
AS call pntinsight_lnd.SP_ACCT_DIM_1();
Questions i could find for those of y'all planning to give the snowflake OA/interview
How do you Hackerrank?
TikTok Summer 2024 OA Assessment Hackerrank
Maximum Job Scheduling Profit with "n" overlapping jobs
You have to define all trigger minutes, it looks ugly but it should work:
CREATE OR REPLACE TASK tsk_master
WAREHOUSE = XS_WH
SCHEDULE = 'USING CRON 0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58 5-17 * * * America/New_York'
TIMESTAMP_INPUT_FORMAT = 'YYYY-MM-DD HH24'
COMMENT = 'Master task job to trigger all other tasks'
AS call pntinsight_lnd.SP_ACCT_DIM_1();
snowflake task to run everyday at every 2 minutes from 5:00 EST to 5:00 PM EST.
Optional parameters:
/n
Indicates the nth instance of a given unit of time. Each quanta of time is computed independently
So every 2 minutes will be:
SCHEDULE = 'USING CRON */2 5-17 * * * America/New_York'
Umm... really low effort post but I was preping for the snowflake oa, i really really dont know what im doing btw( for context, gave my first ever GCA yesterday and got a 700) and was looking for resources to study from and found these questions. You can easily find most of them in 3-4 clicks but was making a list for myself so thought might as well share w y'all.
-> Extremely DP heavy with heavy implications on code optimization from what i've heard.
Problems that aren't on leetcode:
-
Remove all the element of B which are present in A (A and B are arrays). Both the array can consist of duplicates and are not sorted.
-
Given two arrays team_a and team_b of n integers each, choose two indices i and j such that the subarrays [team_a[i], team_a[i+1]... team_a[j]] and [team_b[i], team_b[i+1]... team_b[j]] can form a non decreasing sequence. Find the maximum possible value of (j-1+1) i.e. the length of the chosen subarray.
print(get_max_team([3,2,5,3], [10,2,8,4])) # Output: 2
print(get_max_team([2,7,3], [4,2,6])) # Output: 3
print(get_max_team([5,2,4,1], [2,6,2,2])) # Output: 3
-
Task Scheduling - https://leetcode.com/discuss/interview-question/2775415
-
Server Selection- https://leetcode.com/discuss/interview-question/2794537
-
Max Order Value / Max Profit in Job Scheduling - https://leetcode.com/discuss/interview-question/1028649
-
Non-Overlapping Intervals - https://leetcode.com/discuss/interview-question/2115993
-
Grid Land / Kth Smallest Instructions - https://leetcode.com/discuss/interview-question/527769
-
Lexicographically largest array (MEX) - https://leetcode.com/discuss/interview-question/2550995
-
Minimize Array Value - https://leetcode.com/discuss/interview-question/214601
-
Maximum Array Value - https://leetcode.com/discuss/interview-question/2551033
-
Largest Sub Grid - https://leetcode.com/discuss/interview-question/850974
-
String Patterns - https://leetcode.com/discuss/interview-question/2825744
-
Same Bit Pair - https://leetcode.com/discuss/interview-question/2835233
-
https://leetcode.com/discuss/interview-question/1028649/Snowflake-or-OA-or-Maximum-order-volume
-
https://leetcode.com/discuss/interview-question/527769/Lucid-or-OA-or-Gridland
-
https://leetcode.com/discuss/interview-question/2146013/snowflake-oa-2022-minimize-array-value
-
https://leetcode.com/discuss/interview-question/2825744
Problems which are on leetcode:
-
Patching Array - https://leetcode.com/problems/patching-array/
-
Vowel Substring - https://leetcode.com/problems/count-vowel-substrings-of-a-string
-
String Formation - https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/
-
Palindromic Subsequences - https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/
Problems which are on leetcode and in Neetcode 150:
-
Course Schedule II - https://leetcode.com/problems/course-schedule-ii/
-
https://leetcode.com/problems/binary-tree-inorder-traversal/ bonus point if I could do it in constant space (Basically using Morris Inorder Traversal)
-
Merge Intervals - https://leetcode.com/problems/merge-intervals/
-
Best Interval / Minimum Interval to Include Each Query - https://leetcode.com/problems/minimum-interval-to-include-each-query/
go crazy