i
Risk Advisors:
Filter interviews by
Be the first one to contribute and help others!
I was interviewed in Dec 2024.
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
I am fluent in three languages: English, Spanish, and French.
Fluent in English, Spanish, and French
Can communicate effectively in all three languages
Have experience working in multilingual environments
posted on 25 Aug 2024
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
1 Hours, Computer Science, Bluestock.in
I am a software engineer with a passion for problem-solving and creating innovative solutions.
Experienced in programming languages such as Java, Python, and C++
Strong background in data structures and algorithms
Worked on projects involving web development and mobile app development
Excellent communication and teamwork skills from collaborating with cross-functional teams
I come from a close-knit family of four - my parents, my younger sister, and myself.
My parents have always been supportive of my career choices and have encouraged me to pursue my passion for software development.
My younger sister is currently studying computer science and we often collaborate on coding projects together.
Family gatherings are important to us and we enjoy spending quality time together, whether it's cel
posted on 26 Dec 2024
I applied via Campus Placement
Three fundamental questions related to Data Structures and Algorithms.
I was interviewed in Oct 2024.
Sql queries and other python coding
Data pipeline design
Sql queries and python stuff
posted on 22 Jul 2024
I applied via Naukri.com and was interviewed in Jan 2024. There were 5 interview rounds.
Maths, English grammer question
Phone pay application
posted on 13 Nov 2024
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
2Sum problem involves finding two numbers in an array that add up to a specific target.
Use a hashmap to store the difference between the target and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target.
Spiral traversal of a Binary tree involves visiting nodes level by level alternating between left to right and right to left.
Start by pushing the root node into a queue.
While the queue is not empty, pop a node, print its value, and push its children into the queue.
Alternate between popping nodes from the queue and printing their values in a spiral manner.
The aggressive cows problem involves finding the maximum distance between cows in a field while ensuring they are not too close to each other.
Use binary search to find the maximum distance between cows.
Sort the cows' positions and check if a certain distance is feasible.
Consider the constraints of the problem such as the number of cows and the size of the field.
I applied via Approached by Company and was interviewed in Mar 2023. There was 1 interview round.
I applied via Referral and was interviewed in Sep 2021. There were 3 interview rounds.
based on 1 review
Rating in categories
Stashfin
PrimeXBT
Bluestock ™
UAE Exchange