BYJU's | OA+DS&PS | SE/SSE
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.
Full Experience
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.
Interview Questions (22)
Given an array of integers and an integer k, find the total number of continuous subarrays whose sum equals k.
Given an array containing only 0s and 1s, sort the array in ascending order.
Find the pair of elements in an array with the minimum absolute difference.
Calculate the sum of values of all nodes in a Binary Search Tree (BST).
Find the second largest element in a given array of integers.
Find the middle node of a singly linked list. If the list has an even number of nodes, return the second middle node.
Given the root of a binary tree, determine if it is a valid Binary Search Tree (BST).
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Perform an inorder traversal of a binary tree iteratively without using recursion.
Perform an inorder traversal of a binary tree iteratively without using recursion or an explicit stack (Morris Traversal).
Find the largest rectangle possible in a given histogram where each bar has a width of 1.
Reverse a singly linked list without using extra space (in-place).
Given an m x n integer matrix, if an element is 0, set its entire row and column to 0.
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.
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).
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.
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.
Given a string s containing just the characters '(', ')', '{', '}', '[', ']', determine if the input string is valid.
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.
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.
Given the root of a Binary Search Tree (BST) and an integer k, return the kth largest element in the tree.
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.