Check Point Software Technologies Interview Questions, Process, and Tips

Q1. Are you ready to work in rotational shifts?
Add your answer
Q2. What is your salary expectation?
Add your answer

Q1. Why you left your previous company so early?
Add your answer
Q2. Why you didn't apply based on your previous experience?
Add your answer
Q3. Why do you want to work for Paychex?
Add your answer

Sometime it is taken

Q1. It related to product
Add your answer

Q1. Salary discussion
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

LLD Round (but with machine coding sort of expectations in whatever that can be done in 60 mins)

Q1. Design a Snake game.
Ans. 
Design a snake game
• Use a 2D array to represent the game board

• Keep track of the snake's position and direction

• Handle user input to change the snake's direction

• Update the snake's position and check for collisions with walls or itself

• Add food to the board and handle eating it to grow the snake

• Keep track of the score and display it to the player
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

DSA 

Q1. 
K Most Frequent Words Problem Statement
Given an array of N non-empty words and an integer K, return the K most frequent words sorted by their frequency from highest to lowest.
Example:
Input:
N = 6, K...read more
Ans. 
Given an array of words and an integer k, return the k most frequent words sorted by frequency.
• Use a hashmap to count the frequency of each word

• Use a priority queue to keep track of the k most frequent words

• Sort the priority queue based on frequency and lexicographical order
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Round duration - 60 Minutes
Round difficulty - Easy

Managerial Round (Some questions on projects and general situation based questions)

Round duration - 45 minutes
Round difficulty - Easy

Values round

Round duration - 90 minutes
Round difficulty - Medium

It was an online coding round which had 2 questions.

Q1. 
Query and Matrix Problem Statement
You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:
Query 1: 1 R inde...read more
Ans. Brute Force
A simple idea is to traverse the given row or column. If you come across a query that is of type 1 then swap 0 with 1 and vice-versa and for the query of type 2 initialize a variable ‘COUNT’ and increment count when you encounter ‘0’ and return ‘COUNT’.
 
The steps are as follows:
 
• If the type of query is 1.
  • If we have to consider row ‘R’ at the given ‘INDEX’
    • Run a loop for row ‘INDEX’  and every c...read more
Answered Anonymously
Add your answer
Q2. 
Longest Increasing Path in Matrix Problem Statement
Given a 2-D matrix mat with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j], determine the length of the longest increasing...read more
Ans. Recursion
Algorithm
 
• This is a recursive approach.
• Make a recursive function ‘helper(row, col)’ and call this function with (0, 0). In each recursive step do the following-:
  • Initialize an integer variable ‘temp’: = 0.
  • If cell (row+1, c) exist and mat[row+1][col] > mat[row][col], then recursively call ‘helper(row+1, col)’ and update ‘temp’ with maximum of ‘temp’ and value return by ‘helper(row+1, col)’.
  • If cell (row, ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The next round was a debugging round. There were approximately 20 people in this round and all of us had to give this round simultaneously. 9 people were shortlisted from this round.

Round duration - 60 minutes
Round difficulty - Medium

The first F2F interview was a DSA round. Initial 5 mins went in the introduction. Then I had to log in to the code pair link on hackerrank and the interviewer gave me a question. So the question had sort of like a common premise on which follow-up questions were asked.

Q1. 
Loot Houses Problem Statement
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...read more
Ans. Recursive Approach
Suppose that the robber is at the ith house. The robber has two options:
• If he decides to rob this house, then he cannot rob the next house, so he’ll have to go to the house after that.
• If he decides not to rob this house, he has no restriction over choosing the next house.
You will follow the same for the rest of the houses. Thus, if maxLoot(i) is the maximum loot possible when we’re at the ith house, t...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Can you describe the system design you created for Pastebin and the set of requirements you had to fulfill?
Add your answer