Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
I have worked on several projects, including a RESTful API for a task management app and a web scraper for real-time data collection.
Developed a RESTful API using Node.js and Express for a task management application, enabling users to create, update, and delete tasks.
Implemented user authentication with JWT to secure API endpoints and manage user sessions.
Created a web scraper using Python and Beautiful Soup to collec...
I want to join HackerRank to enhance my skills, contribute to innovative projects, and be part of a dynamic tech community.
HackerRank's focus on coding challenges aligns with my passion for problem-solving and continuous learning.
The opportunity to work with experienced developers will help me grow and refine my backend development skills.
I admire HackerRank's commitment to improving the hiring process through technolo...
Top trending discussions
posted on 11 Feb 2024
I applied via Campus Placement and was interviewed in Aug 2023. There were 3 interview rounds.
We were to make a go Lang api using one of the frameworks the company has made named go-fr
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest...
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
posted on 12 Oct 2024
Dsa questions asked and java basic questions
posted on 14 Nov 2024
I applied via Campus Placement and was interviewed in Oct 2024. There were 4 interview rounds.
Consist 3 coding questions medium level
An advanced SQL query can involve complex joins, subqueries, and aggregations to extract meaningful insights from data.
Use JOINs to combine data from multiple tables. Example: SELECT * FROM orders JOIN customers ON orders.customer_id = customers.id;
Utilize subqueries for filtering results. Example: SELECT * FROM products WHERE id IN (SELECT product_id FROM order_items WHERE quantity > 5);
Implement GROUP BY for aggre...
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
posted on 9 Nov 2022
I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 5 interview rounds.
The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard
After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes
Design patterns in Java are reusable solutions to common problems in software design.
Design patterns help in creating flexible, maintainable, and scalable code.
Some common design patterns in Java include Singleton, Factory, Observer, and Strategy.
Each design pattern has its own purpose and can be applied in different scenarios.
Design patterns promote code reusability and help in organizing code in a structured manner.
based on 1 interview experience
Senior Software Engineer
15
salaries
| ₹25 L/yr - ₹52 L/yr |
Software Development Engineer II
12
salaries
| ₹22 L/yr - ₹35 L/yr |
Senior Data Engineer
8
salaries
| ₹28.6 L/yr - ₹32.3 L/yr |
Software Engineer
7
salaries
| ₹10 L/yr - ₹24.6 L/yr |
Software Developer
6
salaries
| ₹16 L/yr - ₹22 L/yr |
Aurigo
Prime Focus Technologies
Nowfloats Technologies
Peel-works