Palo Alto Networks Researcher Interview Questions and Answers

Online test was hackerrank was was og avg difficulty

Q1. Second round was of 1 hr of which 30 mins divided into understanding my current project architecture. And second half was on what i worked and how I worked and what skills I have
Add your answer

Assignment was straightforward which could be done using trie. Did it in 1/6th throughout time for given queries then mentioned allowed still no reply. Keep on asking engineering manager and hr to which they replied not upto the mark.

Q1. How to check a number is power of 2
Ans. 
To check if a number is a power of 2, we can use bitwise operations.
• A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.

• If n is a power of 2, then n & (n-1) will be 0.

• For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Answered by AI
Add your answer
Q2. Sort a stack without using another data structure
Ans. 
Sort a stack without using another data structure
• Use recursion to pop the top element and insert it at the bottom of the remaining stack

• Repeat until the stack is sorted in ascending order

• Time complexity: O(n^2), space complexity: O(n) due to recursion
Answered by AI
Add your answer
Q3. Check weather array have continuous increasing than decreasing value
Ans. 
Check if array has continuous increasing and decreasing values
• Loop through the array and check if each element is greater than the previous one

• Once you find the maximum element, check if the remaining elements are in decreasing order

• If yes, return true else false
Answered by AI
Add your answer

Q1. Design a cricinfo (LLD)
Ans. 
Design a cricinfo (LLD)
• Identify the entities: players, teams, matches, scorecards, tournaments, etc.

• Define the relationships between entities

• Create a database schema to store the data

• Implement APIs to fetch and update data

• Design a UI to display the information

• Consider scalability and performance

• Ensure data security and privacy
Answered by AI
Add your answer

Q1. Share details of your previous job.
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer

Was asked to understand a project in python and translate it to NodeJS. This had to be done during the interview with you explaining you thought process through every step.

Coding string related programming

Hacker rank data structure linked list

Q1. System design high level
Add your answer

Hacker rank data structure trees

Hacker rank codinv problems level medium

Q1. Coding round again D and S
Add your answer

Q1. System design tech dummies
Add your answer

Q1. Common questions , why we should hire you , achievements
Add your answer

Q1. Reverse linked list using the recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q2. Find max number in the linked list using stack.
Ans. 
To find max number in linked list using stack.
• Create an empty stack.

• Traverse the linked list and push each element onto the stack.

• Pop elements from the stack and compare with max value.

• Return the max value.
Answered by AI
Add your answer

Aptitude relates questions... It was modratley difficult

Q1. Twchnical rouns. Qas easy... Asked questions oc C and some. Projects
Add your answer
Q2. Reverse linked list using recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q3. What is difference between mutex semaphore?
Ans. 
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
• Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.

• Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multiple s...read more
Answered by AI
Add your answer