Interview logo

BNY mellon Interview experience

Java Developer 8 years

By Vinayagaram SPublished about a year ago 2 min read
Like
BNY mellon Interview experience
Photo by Tim Gouw on Unsplash

BNY mellon Interview Experience for 8 years Exp Java

I have applied through Naukri .and i got a call from HR for interview slot. they told like we have four rounds of interview.

karat round, two technical round, last managerial round

first round will be Karat round

Time duration : 60 minutes

first 5 minutes : self intro

second 15 minutes : sql questions mostly joins

remaining 40 minutes : programming questions

you can search syntax of programming language in online, if you dont know.

i got sql questions like based on joining they provided four tables below

student,teacher,assignement ,grade

they told to write a sql qeury like display student id, student name, teacher name even there is no teacher assigned to particular student..

programming questions:

they asked below question

/*

You are with your friends in a castle, where there are multiple rooms named after flowers. Some of the rooms contain treasures - we call them the treasure rooms.

Each room contains a single instruction that tells the player which room to go to next.

*** instructions_1 ***

lily -------- daisy sunflower

| | |

v v v

jasmin -> tulip violet -> rose --->

^ | ^ ^ |

| | | | |

----- iris -----

*** instructions_2 ***

lily --------

|

v

jasmin -> tulip -- > violet

Write a function that takes two parameters as input:

* a list containing the treasure rooms, and

* a list of instructions represented as pairs of (source_room, destination_room)

and returns a collection of all the rooms that satisfy the following two conditions:

* at least two *other* rooms have instructions pointing to this room

* this room's instruction immediately leads to a treasure room

Examples

instructions_1 = [

["jasmin", "tulip"],

["lily", "tulip"],

["tulip", "tulip"],

["rose", "rose"],

["violet", "rose"],

["sunflower", "violet"],

["daisy", "violet"],

["iris", "violet"]

]

treasure_rooms_1 = ["lily", "tulip", "violet", "rose"]

treasure_rooms_2 = ["lily", "jasmin", "violet"]

instructions_2 = [

["jasmin", "tulip"],

["lily", "tulip"],

["tulip", "violet"],

["violet", "violet"]

]

treasure_rooms_3 = ["violet"]

filter_rooms(treasure_rooms_1, instructions_1) => ["tulip", "violet"]

* tulip can be accessed from rooms lily and jasmin. Tulip's instruction leads to a treasure room (tulip itself)

* violet can be accessed from daisy, sunflower and iris. Violet's instruction leads to a treasure room (rose)

filter_rooms(treasure_rooms_2, instructions_1) => []

* none of the rooms reachable from tulip or violet are treasure rooms

filter_rooms(treasure_rooms_3, instructions_2) => [tulip]

* tulip can be accessed from rooms lily and jasmin. Tulip's instruction leads to a treasure room (violet)

All the test cases:

filter_rooms(treasure_rooms_1, instructions_1) => ["tulip", "violet"]

filter_rooms(treasure_rooms_2, instructions_1) => []

filter_rooms(treasure_rooms_3, instructions_2) => [tulip]

Complexity Analysis variables:

N: treasure rooms

P: instructions

*/

For this you have to explain the which data structure you are going to use. after that they will tell you to write code

i have done the karat interview. i am waiting for interview feedback.

Actors
Like

About the Creator

Reader insights

Be the first to share your insights about this piece.

How does it work?

Add your insights

Comments

There are no comments for this story

Be the first to respond and start the conversation.

Sign in to comment

    Find us on social media

    Miscellaneous links

    • Explore
    • Contact
    • Privacy Policy
    • Terms of Use
    • Support

    © 2024 Creatd, Inc. All Rights Reserved.