Siemens LeetCode Questions
25 questions all-time · 8 easy · 13 medium · 4 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Peaks in Array Array, Binary Indexed Tree, Segment Tree | Hard | 100 | 0.3% |
| 2 | Minimized Maximum of Products Distributed to Any Store Array, Binary Search, Greedy | Medium | 100 | 0.6% |
| 3 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 88 | 0.6% |
| 4 | Merge Intervals Array, Sorting | Medium | 83 | 0.5% |
| 5 | Valid Parentheses String, Stack | Easy | 78 | 0.4% |
| 6 | Merge Two Sorted Lists Linked List, Recursion | Easy | 71 | 0.7% |
| 7 | The Skyline Problem Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set | Hard | 71 | 0.5% |
| 8 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 71 | 0.5% |
| 9 | Two Sum Array, Hash Table | Easy | 61 | 0.6% |
| 10 | First Missing Positive Array, Hash Table | Hard | 61 | 0.4% |
| 11 | Valid Anagram Hash Table, String, Sorting | Easy | 61 | 0.7% |
| 12 | Maximum Product of Three Numbers Array, Math, Sorting | Easy | 61 | 0.5% |
| 13 | Angle Between Hands of a Clock Math | Medium | 61 | 0.7% |
| 14 | Remove Duplicates from Sorted Array Array, Two Pointers | Easy | 61 | 0.6% |
| 15 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 61 | 0.7% |
| 16 | Minimum Add to Make Parentheses Valid String, Stack, Greedy | Medium | 61 | 0.7% |
| 17 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 61 | 0.4% |
| 18 | Maximum Product Subarray Array, Dynamic Programming | Medium | 61 | 0.4% |
| 19 | Single Number III Array, Bit Manipulation | Medium | 61 | 0.7% |
| 20 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 61 | 0.7% |
| 21 | Rotate Array Array, Math, Two Pointers | Medium | 61 | 0.5% |
| 22 | Palindrome Number Math | Easy | 61 | 0.6% |
| 23 | Clone Graph Hash Table, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 61 | 0.7% |
| 24 | Strong Password Checker String, Greedy, Heap (Priority Queue) | Hard | 61 | 0.2% |
| 25 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 61 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.