The New York Times Company LeetCode Interview Questions
Practice 35 real coding problems frequently asked in The New York Times Company technical interviews. Master these questions to ace your next The New York Times Company software engineering interview.
Top Topics at The New York Times Company
Ace your The New York Times Company interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
The New York Times Company Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Make String a Subsequence Using Cyclic Increments 100% | MediumM | Solve→ |
Merge Intervals 92% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 91% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 90% | MediumM | Solve→ |
Top K Frequent Elements 90% | MediumM | Solve→ |
Zero Array Transformation I 86% | MediumM | Solve→ |
Regular Expression Matching 84% | HardH | Solve→ |
Nested List Weight Sum 79% | MediumM | Solve→ |
Single Number 76% | EasyE | Solve→ |
Word Ladder II 68% | HardH | Solve→ |
Group Shifted Strings 66% | MediumM | Solve→ |
Minimum Area Rectangle 65% | MediumM | Solve→ |
House Robber II 62% | MediumM | Solve→ |
Subsets 61% | MediumM | Solve→ |
Remove All Occurrences of a Substring 59% | MediumM | Solve→ |
Invalid Transactions 59% | MediumM | Solve→ |
Minimum Time to Visit a Cell In a Grid 58% | HardH | Solve→ |
Coin Change II 50% | MediumM | Solve→ |
Kth Largest Element in an Array 43% | MediumM | Solve→ |
Largest Rectangle in Histogram 42% | HardH | Solve→ |
Basic Calculator II 37% | MediumM | Solve→ |
Plus One 37% | EasyE | Solve→ |
Maximum Depth of Binary Tree 36% | EasyE | Solve→ |
Find K Pairs with Smallest Sums 35% | MediumM | Solve→ |
Design Tic-Tac-Toe 35% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Take Gifts From the Richest Pile 33% | EasyE | Solve→ |
Flood Fill 33% | EasyE | Solve→ |
Generate Parentheses 31% | MediumM | Solve→ |
Find First and Last Position of Element in Sorted Array 31% | MediumM | Solve→ |
Diameter of Binary Tree 31% | EasyE | Solve→ |
Shortest Palindrome 30% | HardH | Solve→ |
Kth Missing Positive Number 27% | EasyE | Solve→ |
Remove Stones to Minimize the Total 26% | MediumM | Solve→ |
Coin Change 25% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 20% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does The New York Times Company ask in interviews?
The New York Times Company commonly asks 35 coding problems in technical interviews, including Make String a Subsequence Using Cyclic Increments, Merge Intervals, Convert Binary Search Tree to Sorted Doubly Linked List. The difficulty breakdown is 7 Easy, 22 Medium, and 6 Hard problems.
How should I prepare for a The New York Times Company coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. The New York Times Company interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of The New York Times Company coding interviews?
Based on our data, The New York Times Company interviews include 7 Easy (20%), 22 Medium (63%), and 6 Hard (17%) problems.
Ready to ace your The New York Times Company interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required