- Interview Questions
- /
- Cytokinetics
Cytokinetics LeetCode Interview Questions
Practice 44 real coding problems frequently asked in Cytokinetics technical interviews. Master these questions to ace your next Cytokinetics software engineering interview.
Top Topics at Cytokinetics
Ace your Cytokinetics interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Cytokinetics Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Maximum Matrix Sum 100% | MediumM | Solve→ |
Basic Calculator 94% | HardH | Solve→ |
Make String a Subsequence Using Cyclic Increments 91% | MediumM | Solve→ |
Group Anagrams 88% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 84% | MediumM | Solve→ |
Split Array Largest Sum 83% | HardH | Solve→ |
K Closest Points to Origin 81% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 80% | EasyE | Solve→ |
Is Subsequence 78% | EasyE | Solve→ |
Best Time to Buy and Sell Stock II 78% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 77% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 74% | MediumM | Solve→ |
Find the Celebrity 73% | MediumM | Solve→ |
Maximum Depth of Binary Tree 70% | EasyE | Solve→ |
LFU Cache 69% | HardH | Solve→ |
Merge Two Sorted Lists 67% | EasyE | Solve→ |
Isomorphic Strings 66% | EasyE | Solve→ |
Minimum Area Rectangle 66% | MediumM | Solve→ |
Flood Fill 62% | EasyE | Solve→ |
Invalid Transactions 61% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 60% | MediumM | Solve→ |
Min Stack 60% | MediumM | Solve→ |
Continuous Subarray Sum 53% | MediumM | Solve→ |
Palindrome Number 52% | EasyE | Solve→ |
Clone Graph 47% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Islands 47% | MediumM | Solve→ |
Kth Smallest Element in a BST 46% | MediumM | Solve→ |
Search a 2D Matrix 45% | MediumM | Solve→ |
Maximum Number of Occurrences of a Substring 45% | MediumM | Solve→ |
Remove Element 45% | EasyE | Solve→ |
Two Sum 45% | EasyE | Solve→ |
Sqrt(x) 42% | EasyE | Solve→ |
High Five 39% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 37% | HardH | Solve→ |
Simplify Path 35% | MediumM | Solve→ |
Task Scheduler 34% | MediumM | Solve→ |
Ways to Make a Fair Array 27% | MediumM | Solve→ |
Sort Integers by The Power Value 26% | MediumM | Solve→ |
Reorganize String 26% | MediumM | Solve→ |
LRU Cache 25% | MediumM | Solve→ |
Word Break II 23% | HardH | Solve→ |
All Nodes Distance K in Binary Tree 22% | MediumM | Solve→ |
Toeplitz Matrix 21% | EasyE | Solve→ |
Random Pick with Weight 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Cytokinetics ask in interviews?
Cytokinetics commonly asks 44 coding problems in technical interviews, including Maximum Matrix Sum, Basic Calculator, Make String a Subsequence Using Cyclic Increments. The difficulty breakdown is 12 Easy, 27 Medium, and 5 Hard problems.
How should I prepare for a Cytokinetics coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Cytokinetics interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Cytokinetics coding interviews?
Based on our data, Cytokinetics interviews include 12 Easy (27%), 27 Medium (61%), and 5 Hard (11%) problems.
Ready to ace your Cytokinetics interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required