Susquehanna International Group LeetCode Interview Questions
Practice 37 real coding problems frequently asked in Susquehanna International Group technical interviews. Master these questions to ace your next Susquehanna International Group software engineering interview.
Top Topics at Susquehanna International Group
Ace your Susquehanna International Group interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Susquehanna International Group Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Kth Largest Element in an Array 100% | MediumM | Solve→ |
Counting Bits 93% | EasyE | Solve→ |
Kth Missing Positive Number 91% | EasyE | Solve→ |
Make String a Subsequence Using Cyclic Increments 91% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 88% | HardH | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 84% | MediumM | Solve→ |
Take Gifts From the Richest Pile 82% | EasyE | Solve→ |
Maximum Beauty of an Array After Applying Operation 81% | MediumM | Solve→ |
Evaluate Division 81% | MediumM | Solve→ |
Same Tree 80% | EasyE | Solve→ |
Add Two Numbers 79% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 72% | EasyE | Solve→ |
Word Ladder 71% | HardH | Solve→ |
Valid Palindrome 68% | EasyE | Solve→ |
Check Completeness of a Binary Tree 68% | MediumM | Solve→ |
Find Score of an Array After Marking All Elements 67% | MediumM | Solve→ |
Remove Stones to Minimize the Total 67% | MediumM | Solve→ |
Move Zeroes 66% | EasyE | Solve→ |
Maximum Product Subarray 65% | MediumM | Solve→ |
Continuous Subarrays 62% | MediumM | Solve→ |
Number of Ships in a Rectangle 60% | HardH | Solve→ |
Subsets II 59% | MediumM | Solve→ |
Fraction to Recurring Decimal 56% | MediumM | Solve→ |
Closest Binary Search Tree Value 55% | EasyE | Solve→ |
High Five 55% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Largest Rectangle in Histogram 52% | HardH | Solve→ |
Binary Tree Right Side View 44% | MediumM | Solve→ |
Palindrome Number 38% | EasyE | Solve→ |
Longest Subarray of 1's After Deleting One Element 35% | MediumM | Solve→ |
Longest Consecutive Sequence 32% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 31% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 27% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 27% | MediumM | Solve→ |
Word Pattern II 26% | MediumM | Solve→ |
Max Consecutive Ones III 22% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 20% | EasyE | Solve→ |
Single Number 20% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Susquehanna International Group ask in interviews?
Susquehanna International Group commonly asks 37 coding problems in technical interviews, including Kth Largest Element in an Array, Counting Bits, Kth Missing Positive Number. The difficulty breakdown is 12 Easy, 21 Medium, and 4 Hard problems.
How should I prepare for a Susquehanna International Group coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Susquehanna International Group interviews typically emphasize Array and Heap (Priority Queue). Practice explaining your thought process while coding.
What is the difficulty level of Susquehanna International Group coding interviews?
Based on our data, Susquehanna International Group interviews include 12 Easy (32%), 21 Medium (57%), and 4 Hard (11%) problems.
Ready to ace your Susquehanna International Group interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required