Technical Interview Questions

Review this list of 387 Technical interview questions and answers verified by hiring managers and candidates.

+ Share interview

Asked at NASA • 5 months ago
Write a query that detects repeated authentication failures from the same IP within a 10-minute window. Then explain how you would determine whether the pattern indicates malicious activity or simp...
Security Analyst
Technical
+1 more
Add answer
Security Analyst
Technical
+1 more
Asked at DoubleVerify • 5 years ago
How would you build a webpage content classification engine?
Technical
Add answer
Technical
Explain the 3 partition problem.
Technical
Add answer
Technical
Asked at Salesforce • 2 years ago
Choose a platform for building an app leveraging APIs
Solutions Architect
Technical
Add answer
Solutions Architect
Technical
Asked at LexisNexis • 5 years ago
Design a scalable system for content ingestion at a publishing company.
Technical
Add answer
Technical

🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

Find all pairs in an array with a given difference k.
Technical
1 answer
"public static Dictionary FindPairsWitkkDifference(int k, int[] nums) { Dictionary pairsWithkDifference = new Dictionary(); int n = nums.Length; if( n== 0 || n == 1) Return 0; for(int i =0; i< n;i++) { for(int j = i+1; j < n; j++) { if(Math.Abs(nums[i] - nums[j]) == k) { pairsWithkDifference(nums[i], nums[j]); } } } Return pairsWithkDifference ; }"
Sanobar K. - "public static Dictionary FindPairsWitkkDifference(int k, int[] nums) { Dictionary pairsWithkDifference = new Dictionary(); int n = nums.Length; if( n== 0 || n == 1) Return 0; for(int i =0; i< n;i++) { for(int j = i+1; j < n; j++) { if(Math.Abs(nums[i] - nums[j]) == k) { pairsWithkDifference(nums[i], nums[j]); } } } Return pairsWithkDifference ; }"See full answer
Technical
Find a path from source to destination in a matrix that satisfies given constraints.
Technical
Add answer
Technical
Asked at WhatsApp • 5 years ago
Determine all possible words from a game of Boggle.
Technical
Add answer
Technical
Asked at Zoom • 5 months ago
How do you find vulnerable software running on people’s work machines?
Security Engineer
Technical
Add answer
Security Engineer
Technical
Asked at Meta • 5 months ago
Let's say you were investigating a security incident and didn't know how to remediate it, what steps would you follow to figure it out?
Security Analyst
Technical
Add answer
Security Analyst
Technical
Asked at Amazon, Microsoft • 5 months ago
How do you work through figuring out things you don't know?
Security Engineer
Technical
+1 more
Add answer
Security Engineer
Technical
+1 more
Asked at Lockheed Martin, Sierra Nevada Corporation • 5 months ago
Tell me about a high profile threat actor that you are familiar with.
Security Engineer
Technical
+1 more
Add answer
Security Engineer
Technical
+1 more
What is a front-end assignment?
Software Engineer
Technical
1 answer
"משימת בית פרונט עם התחברות לשרת רמה היה ממש קל"
מיכל ש. - "משימת בית פרונט עם התחברות לשרת רמה היה ממש קל"See full answer
Software Engineer
Technical
Asked at Freightos • 4 years ago
If I know coding.
Product Manager
Technical
1 answer
"Yes"
Rajaa M. - "Yes"See full answer
Product Manager
Technical
Asked at NASA • 5 months ago
How would you spot a phishing email?
Security Analyst
Technical
Add answer
Security Analyst
Technical
Asked at AWS, NASA • 5 months ago
What is a TCP handshake?
Security Analyst
Technical
+2 more
Add answer
Security Analyst
Technical
+2 more
Asked at Age of Learning • 5 years ago
What is the core game loop in our product?
Technical
Product Design
Add answer
Technical
Product Design
Explain the process of insertion in a binary search tree (BST).
Technical
Add answer
Technical
Design the architecture for a self-serve insurance product.
Technical
Add answer
Technical
Explain the process of deletion from a binary search tree (BST).
Technical
1 answer
"// Function to delete a node from BST. public static Node deleteNode(Node root, int X) { // code here. if(root == null) return root; if(X root.data){ root.right = deleteNode(root.right, X); return root; } if(root.left == null){ return root.right; }else if(root.right == null){ "
Vipin G. - "// Function to delete a node from BST. public static Node deleteNode(Node root, int X) { // code here. if(root == null) return root; if(X root.data){ root.right = deleteNode(root.right, X); return root; } if(root.left == null){ return root.right; }else if(root.right == null){ "See full answer
Technical