Byju's Coding Interview Questions
25 Byju's coding interview problems with full optimal solutions — 10 easy, 11 medium, 4 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Byju's interviewer values, and a FAQ section.
Showing 11 problems of 25
- #11mediumfoundational
11. Binary Tree Level Order Traversal
Return the node values of a binary tree grouped by level.
- #12mediumfoundational
12. LRU Cache
Design an O(1) get/put cache that evicts the least-recently-used key when full.
- #13mediumfoundational
13. Binary Tree Right Side View
Return the rightmost node visible at each level of a binary tree.
- #14mediumfoundational
14. Number of Islands
Count connected land regions in a 2D grid of '1' (land) and '0' (water).
- #15mediumfoundational
15. Course Schedule
Decide whether a set of prerequisite-linked courses can all be finished.
- #16mediumfoundational
16. Implement Trie (Prefix Tree)
Build a Trie supporting insert, search, and startsWith on lowercase strings.
- #17mediumfoundational
17. Kth Largest Element in an Array
Return the kth largest element in an unsorted array without fully sorting it.
- #18mediumfoundational
18. Product of Array Except Self
Return an array where each index holds the product of every other element, without division.
- #19mediumfoundational
19. Top K Frequent Elements
Return the k most frequent values in an integer array.
- #20mediumfoundational
20. Subarray Sum Equals K
Count the number of contiguous subarrays whose sum equals k.
- #21mediumfoundational
21. Daily Temperatures
For each day in an array, return how many days until a warmer temperature occurs.