Snowflake Interview Questions Coding round questions Two sum problem with slight variation Maximum product of two non overlapping palindromic sub-sequences Maximum size of square such that all submatrices of that size have sum less than K