Filter interviews by
Given a binary string STR
containing either '0' or '1', determine the minimum number of operations needed to make it beautiful. A binary string is called beautiful if it ...
The problem involves determining the minimum number of operations needed to make a binary string beautiful by ensuring it contains alternating 0s and 1s.
Iterate through the binary string and count the number of operations needed to make it beautiful by flipping the bits as required.
Keep track of the current bit and compare it with the next bit to determine if a flip operation is needed.
Return the total number of o...
Given an integer N
, determine whether its binary representation is a palindrome.
The first line contains an integer 'T' representing the number of test cases.
The next 'T' ...
Check if the binary representation of a given integer is a palindrome.
Convert the integer to binary and check if the binary string is a palindrome.
Use bitwise operations to manipulate the binary representation of the integer.
Consider edge cases like handling leading zeros in the binary representation.
Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements, ...
Find the fourth largest element in an array of integers.
Sort the array in descending order to easily find the fourth largest element.
If the array has less than four distinct elements, return -2147483648.
Handle edge cases like empty array or array with less than four elements.
A sorted doubly-linked list of distinct positive integers is provided, along with an integer 'X'. Your task is to identify and print all unique pairs from the list whose ...
Find pairs in a sorted doubly-linked list whose sum equals a given integer 'X'.
Traverse the list from both ends to find pairs with sum equal to 'X'.
Use two pointers approach to efficiently find the pairs.
Handle cases where the sum is less than, equal to, or greater than 'X'.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort ...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each array has only one element.
Merge the sorted halves to produce a completely sorted array.
Time complexity of Merge Sort is O(n log n).
Example: Input - [3, 1, 4, 1, 5], Output - [1, 1, 3, 4, 5]
Ninja is engaged in a task involving divisors. He is given 'N' numbers, and his objective is to compute the sum of all numbers which are divisible by either 2 or 3.
Find the sum of numbers divisible by 2 or 3 from a given list of numbers.
Iterate through the list of numbers and check if each number is divisible by 2 or 3.
If a number is divisible by 2 or 3, add it to the sum.
Return the final sum as the output.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed linke...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Var, const, and let are all ways to declare variables in JavaScript, each with different scopes and mutability.
Var: function-scoped, can be redeclared and reassigned
Const: block-scoped, cannot be reassigned, but can be mutated for objects and arrays
Let: block-scoped, can be reassigned but not redeclared
Coding interview basic level nothing more required for this
Basic coding not more relevant in the whole process
Trapping rain water and median of two sorted array
I appeared for an interview in Oct 2024.
2 questions ...........................................................................................
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
The assessment was conducted online and consisted of five questions: two focused on coding, two on behavioral aspects, and one required an explanation of the code.
Covered core programming concepts include data structures, algorithms, object-oriented programming, and software design patterns.
Data structures such as arrays, linked lists, stacks, queues, trees, and graphs were covered.
Algorithms like sorting, searching, recursion, and dynamic programming were studied.
Object-oriented programming principles like inheritance, encapsulation, and polymorphism were implemented.
Software d...
To find the length of an array in programming, use built-in functions or properties depending on the language.
In JavaScript, use array.length: `let arr = ['a', 'b', 'c']; console.log(arr.length); // 3`
In Python, use len(): `arr = ['a', 'b', 'c']; print(len(arr)) # 3`
In Java, use array.length: `String[] arr = {'a', 'b', 'c'}; System.out.println(arr.length); // 3`
In C#, use array.Length: `string[] arr = {'a', 'b', 'c'}; ...
To find a substring in a string, we can use various methods like indexOf, includes, or regular expressions in programming languages.
Use the indexOf method: 'hello'.indexOf('lo') returns 3.
Use the includes method: 'hello'.includes('lo') returns true.
Regular expressions: /lo/.test('hello') returns true.
For case-insensitive search, convert both to the same case: 'Hello'.toLowerCase().includes('lo') returns true.
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
1st round was Hirevue video assessment which had 5 questions .
1st - Tell us about yourself
2nd and 3rd were coding questions
4th was related to the 3rd coding question about its logic and alternate logic
5th was basically how are you fit for the role
I applied via Walk-in and was interviewed in Sep 2023. There were 2 interview rounds.
Two questions were given to be solved
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
The initial round was mixture of video interview and coding round.We will be asked 2 video interview questions and 2 coding questions
The longest alphabetical sequence in a string of combined numbers can be separated using string manipulation and iteration.
Iterate through the string character by character
Check if the current character is alphabetical
If it is, start building a substring of alphabetical characters
If the next character is also alphabetical, add it to the substring
If the next character is not alphabetical, compare the length of the curre...
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
There were given 2 coding questions.It is done on hireview platform.After solving the second problem we have to tell the approach behind the code in video mode which will be recorded for evaluation.
I applied via Naukri.com and was interviewed before Jul 2023. There was 1 interview round.
Top trending discussions
Some of the top questions asked at the Bank of America Software Developer interview -
based on 11 interview experiences
Difficulty level
Duration
based on 15 reviews
Rating in categories
Team Lead
2.5k
salaries
| ₹8.3 L/yr - ₹15 L/yr |
Assistant Manager
2k
salaries
| ₹12.7 L/yr - ₹22 L/yr |
Team Developer
1.9k
salaries
| ₹4.6 L/yr - ₹9.7 L/yr |
Software Engineer
1.2k
salaries
| ₹8.2 L/yr - ₹25.5 L/yr |
Manager
1k
salaries
| ₹19.1 L/yr - ₹35.2 L/yr |
JPMorgan Chase & Co.
BA Continuum
HDFC Bank
ICICI Bank