Lucid LeetCode interview questions

Explore Lucid 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
Collect Coins in a Tree Array Tree Graph Theory +1 HARD	Hard	100.0%	0.4%
Maximum Number of Balls in a Box Hash Table Math Counting EASY	Easy	100.0%	0.8%
Valid Parentheses String Stack Bracket Sequences EASY	Easy	78.0%	0.5%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	78.0%	0.7%
Min Stack Stack Design MEDIUM	Medium	68.9%	0.6%
Lowest Common Ancestor of a Binary Tree Tree Depth-First Search Binary Tree +2 MEDIUM	Medium	68.9%	0.7%

Showing 1–6 of 6 matching problems · All Problems