ServiceNow Dynamic Programming Questions

17 dynamic programming problems asked at ServiceNow interviews

Easy (1)Medium (13)Hard (3)

Questions

Title	Difficulty	Acceptance	Frequency
Number of Distinct Roll Sequences	Hard	58.2%	95.2%
Trapping Rain Water	Hard	66.8%	89.3%
Generate Parentheses	Medium	78.3%	81.7%
Best Time to Buy and Sell Stock II	Medium	70.8%	71.0%
Longest Palindromic Substring	Medium	37.4%	63.4%
Best Time to Buy and Sell Stock	Easy	56.4%	63.4%
Coin Change	Medium	48.0%	63.4%
Jump Game II	Medium	42.5%	63.4%
Maximum Subarray	Medium	53.0%	63.4%
Vowels of All Substrings	Medium	55.2%	52.8%
Maximum Product Subarray	Medium	36.0%	52.8%
Target Sum	Medium	51.9%	52.8%
Minimum One Bit Operations to Make Integers Zero	Hard	78.5%	52.8%
Time Needed to Rearrange a Binary String	Medium	52.6%	52.8%
Maximum Profit From Trading Stocks	Medium	48.0%	52.8%
House Robber II	Medium	44.6%	52.8%
Longest Common Subsequence	Medium	58.9%	52.8%

Showing 17 questions