Filter interviews by
A functional interface is an interface that contains only one abstract method, used in Java to enable lambda expressions.
Functional interfaces can have multiple default or static methods, but only one abstract method.
Functional interfaces are used to enable lambda expressions in Java.
Examples of functional interfaces in Java include Runnable, Callable, and ActionListener.
An abstract class is a class that cannot be instantiated and is used as a blueprint for other classes to inherit from.
Cannot be instantiated on its own
May contain abstract methods that must be implemented by subclasses
Can have both abstract and non-abstract methods
Used to define common behavior for subclasses
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
Logical Reasoning and Quants
I applied via Campus Placement and was interviewed before Nov 2022. There were 5 interview rounds.
Company take aptitude test on mettle platform.
Coding test level is easy
I applied via Campus Placement and was interviewed in Oct 2022. There were 5 interview rounds.
The basic of aptitude such as percentage, relative speed, family relation and quick response questions
Basic code such as String Manipulation and Array basic coding
C2L BIZ interview questions for popular designations
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
Aptitude, Technical mCQ, 2 Coding problem
I am a trainee software developer interested in joining C2L BIZ. My hobby is reading books. The latest book I read was 'The Lean Startup' which taught me about the importance of validated learning and experimentation. I have some questions about the company.
Trainee software developer
Interested in joining C2L BIZ
Hobby is reading books
Latest book read: 'The Lean Startup'
Learned about validated learning and experimentatio
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Medium
10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of unique paths for each cell in the matrix.
Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.
For each cell ...
You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...
Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.
Split strings 'A' and 'B' into words
Count frequency of each word in 'A'
Check if word is not in 'B' and is the most frequent and lexicographically smallest
Return the word or -1 if no such word exists
Round duration - 90 Minutes
Round difficulty - Easy
timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
Find the area of the largest rectangle that can be formed within the bounds of a given histogram.
Iterate through the histogram bars and maintain a stack to keep track of increasing heights.
Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.
Update the maximum area found so far and return it as the result.
Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that
Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions
Based on ds and algorithms
Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...
Generate a pattern of numbers in rows following a specific sequence based on powers of 2.
Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.
Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.
Output the pattern for a given number 'N' of rows.
Example: For N = 4, the pattern would be 1, 23, 4567,
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
A Binary Search Tr...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions based on ds and algorithms
You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i
, the element ARR[...
Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.
Iterate through the array and swap elements to satisfy the zig-zag condition.
Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].
Multiple correct answers may exist for a given array.
You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT
, pointing to the next node in the list, and CHILD
, pointing to a linked list. Each child linke...
Flatten a linked list of sorted child linked lists into a single sorted linked list.
Traverse the linked list and maintain a priority queue to keep track of the next smallest element.
Merge the child linked lists into the priority queue while traversing the main linked list.
Pop elements from the priority queue to create the final flattened linked list.
Round duration - 45 Minutes
Round difficulty - Medium
My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider edge cases like when the matrix is empty or all cells are water (0s).
Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems
Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects
An interview is a formal conversation between an employer and a job candidate to assess their suitability for a role.
Interviews are used to evaluate a candidate's skills, experience, and personality.
They can be conducted in person, over the phone, or via video conferencing.
Interviews typically involve a series of questions and may include assessments or tests.
Examples of common interview questions include 'Tell me abou
I plan to save a portion, invest in professional development, and treat myself to a small reward.
Save a portion of the salary for future financial goals
Invest in professional development such as courses or certifications
Treat myself to a small reward or experience as a form of celebration
I applied via Approached by Company and was interviewed before Jul 2021. There were 3 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 3 interview rounds.
Basic sql
based on 3 interviews
Interview experience
based on 105 reviews
Rating in categories
Software Developer
244
salaries
| ₹2.6 L/yr - ₹9.1 L/yr |
Programmer Analyst
78
salaries
| ₹4.2 L/yr - ₹14 L/yr |
Business Analyst
56
salaries
| ₹6 L/yr - ₹16.6 L/yr |
Software Tester
40
salaries
| ₹2.5 L/yr - ₹4.3 L/yr |
Functional Architect
39
salaries
| ₹5 L/yr - ₹12.5 L/yr |
Amazon
Flipkart
Udaan
Indiamart Intermesh