Cashfree LeetCode interview questions

Explore Cashfree questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 6

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
House Robber IV Array Binary Search Dynamic Programming +1 MEDIUM	Medium	100.0%	0.6%
Maximum Erasure Value Array Hash Table Sliding Window MEDIUM	Medium	95.2%	0.6%
Find K Closest Elements Array Two Pointers Binary Search +3 MEDIUM	Medium	65.6%	0.5%
Minimum Edge Reversals So Every Node Is Reachable Dynamic Programming Depth-First Search Breadth-First Search +1 HARD	Hard	65.6%	0.6%
Sum of Subarray Minimums Array Dynamic Programming Stack +1 MEDIUM	Medium	65.6%	0.4%
Roman to Integer Hash Table Math String EASY	Easy	65.6%	0.7%

Showing 1–6 of 6 matching problems · All Problems