Veeva Systems Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Veeva Systems. The higher the ranking, the more likely you'll encounter it in a Veeva Systems interview.

Question

Frequency

Difficulty

Group Anagrams

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStrings

Very likely

If you have a Veeva Systems interview, it's very likely that you will get this question

Medium

#1. Group Anagrams

Medium

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStrings

This question is very likely to be asked in your Veeva Systems interview

Generate Parentheses

Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.

StringsRecursionBacktracking

Somewhat likely

If you have a Veeva Systems interview, you might get this question

Medium

#2. Generate Parentheses

Medium

Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.

StringsRecursionBacktracking

This question is somewhat likely to be asked in your Veeva Systems interview

Valid Sudoku

Determine if a given 9x9 Sudoku board is valid. Check if each row, column, and 3x3 subgrid contains the digits 1-9 without repetition.

Arrays

Not likely

If you have a Veeva Systems interview, it's unlikely that you will get this question. Veeva Systems does ask it, but it's rare

Medium

#3. Valid Sudoku

Medium

Determine if a given 9x9 Sudoku board is valid. Check if each row, column, and 3x3 subgrid contains the digits 1-9 without repetition.

Arrays

This question is not likely to be asked in your Veeva Systems interview