byjus logo
BYJU'S· Software Engineer / Senior Software Engineer

BYJU's | OA+DS&PS | SE/SSE

Result
Ongoing
Posted
7 Jan 2022
334 reads

Summary

I received a list of data structures and problem-solving questions from a BYJU's recruiter for a Software Engineer / Senior Software Engineer position, and I encountered the 'Coin Change' problem from this list during my online assessment.

How it went

I was provided with a comprehensive list of data structures and problem-solving questions by the BYJU's recruiter, intended for an Online Assessment (OA) or technical interview for a Software Engineer/Senior Software Engineer role. During my assessment, I specifically encountered the 'Coin Change' problem, which was one of the many problems detailed in the list. I also observed that several other candidates who shared their experiences had received questions from the same list, suggesting its importance as a resource for preparation.

Questions asked (22)

  1. 01

    Subarray with Sum K

    Data Structures & Algorithms · Medium

    Given an array of integers and an integer k, find the total number of continuous subarrays whose sum equals k.

  2. 02

    Sort Array of 0s and 1s

    Data Structures & Algorithms · Easy

    Given an array containing only 0s and 1s, sort the array in ascending order.

  3. 03

    Minimum Distance Pair

    Data Structures & Algorithms · Medium

    Find the pair of elements in an array with the minimum absolute difference.

  4. 04

    Sum of All Nodes in BST

    Data Structures & Algorithms · Easy

    Calculate the sum of values of all nodes in a Binary Search Tree (BST).

  5. 05

    Second Largest Element in Array

    Data Structures & Algorithms · Easy

    Find the second largest element in a given array of integers.

  6. 06

    Middle of Linked List

    Data Structures & Algorithms · Easy

    Find the middle node of a singly linked list. If the list has an even number of nodes, return the second middle node.

  7. 07

    Validate Binary Search Tree

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, determine if it is a valid Binary Search Tree (BST).

  8. 08

    Min Stack

    Data Structures & Algorithms · Medium

    Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

  9. 09

    Inorder Traversal Iterative

    Data Structures & Algorithms · Medium

    Perform an inorder traversal of a binary tree iteratively without using recursion.

  10. 10

    Inorder Traversal Morris

    Data Structures & Algorithms · Hard

    Perform an inorder traversal of a binary tree iteratively without using recursion or an explicit stack (Morris Traversal).

  11. 11

    Largest Rectangle in Histogram

    Data Structures & Algorithms · Hard

    Find the largest rectangle possible in a given histogram where each bar has a width of 1.

  12. 12

    Reverse Linked List

    Data Structures & Algorithms · Easy

    Reverse a singly linked list without using extra space (in-place).

  13. 13

    Set Matrix Zeroes

    Data Structures & Algorithms · Medium

    Given an m x n integer matrix, if an element is 0, set its entire row and column to 0.

  14. 14

    Coin Change

    Data Structures & Algorithms · Medium

    Given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money, return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

  15. 15

    Binary Tree Zigzag Level Order Traversal

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, return the zigzag level order traversal of its nodes' values (i.e., from left to right, then right to left for the next level and alternate between).

  16. 16

    Binary Tree Left Side View

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, imagine yourself standing on the 'left' side of it, return the values of the nodes you can see ordered from top to bottom.

  17. 17

    Diameter of Binary Tree

    Data Structures & Algorithms · Easy

    Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

  18. 18

    Valid Parentheses

    Data Structures & Algorithms · Easy

    Given a string s containing just the characters '(', ')', '{', '}', '[', ']', determine if the input string is valid.

  19. 19

    Duplicate Parentheses

    Data Structures & Algorithms · Medium

    Given a balanced expression, find if it contains any duplicate parentheses. A set of parentheses are duplicate if the same subexpression is enclosed in multiple sets of parentheses.

  20. 20

    Common Elements in Three Sorted Arrays

    Data Structures & Algorithms · Easy

    Given three integer arrays nums1, nums2, and nums3, sorted in strictly increasing order, return a sorted array of only the integers that appeared in all three arrays.

  21. 21

    Kth Largest Element in a BST

    Data Structures & Algorithms · Medium

    Given the root of a Binary Search Tree (BST) and an integer k, return the kth largest element in the tree.

  22. 22

    Search a 2D Matrix II

    Data Structures & Algorithms · Medium

    Write an efficient algorithm that searches for a target value in an m x n integer matrix. This matrix has the following properties: Integers in each row are sorted in ascending order. Integers in each column are sorted in ascending order.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at BYJU'S recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!