Storable PHP Developer Interview Questions and Answers

Questions trees and graphs.

2 DSA questions Both are from DP

Q1. 2 Questions , 1 is DSA
Add your answer
Q2. Second question is Puzzle
Add your answer

Q1. DSA problems on linked list, OOPs in depth programming, design pattens in Java. Some theoretical knowledge on OOPs and design patterns
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. JavaScript based, reduce, map, Database indexing
Add your answer

Array, dp, stack , queue

Q1. Asked Buy stocks 1 from leetcode, JAVA core concepts
Add your answer

Easy questions based on 2 pointer

Q1. OOPs, DBMS, Networking
Add your answer
Q2. Binary Search related question
Add your answer

Q1. Data structures overview using stacks, queue
Ans. 
Stacks and queues are fundamental data structures used for storing and accessing data in a specific order.
• Stacks follow the Last In First Out (LIFO) principle, where the last element added is the first one to be removed. Example: Undo functionality in text editors.

• Queues follow the First In First Out (FIFO) principle, where the first element added is the first one to be removed. Example: Print job queue in a printer.

• St...read more
Answered by AI
Add your answer
Q2. General CS fundamentals and Puzzles
Add your answer