Filter interviews by
I applied via Instahyre and was interviewed in Dec 2022. There were 2 interview rounds.
Find minimum steps to make product of array equal to 1 by changing elements by +1,-1,0.
Calculate number of negative elements and number of zeroes in array.
If number of negative elements is even, add 1 to all elements.
If number of negative elements is odd, add 1 to all elements except the smallest negative element.
Count the number of steps taken to modify the array elements.
Return the count of steps taken.
Given an array, print the next greater element for every element.
Iterate through the array from right to left
Use a stack to keep track of the greater elements
Pop elements from the stack until a greater element is found or the stack is empty
If a greater element is found, it is the next greater element for the current element
If the stack is empty, there is no greater element for the current element
Store the next greater ...
Top trending discussions
Different question were asked on sql python java
I was interviewed before Feb 2024.
There were two coding questions; one was related to linked lists, and the other was linked to binary trees.
Developed a web application for tracking inventory and sales data
Used React for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Integrated authentication and authorization features for secure access
Implemented data visualization using Chart.js
Reversing a linked list involves changing the direction of pointers to go from the end to the beginning.
Start by initializing three pointers: current, previous, and next.
Iterate through the linked list, updating the pointers to reverse the direction of the links.
Update the head of the linked list to point to the new first node, which was the original last node.
Program to find perfect squares between two numbers
Iterate through numbers between the given range
Check if the square root of the number is an integer
If yes, then it is a perfect square
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
Mutual exclusion is a concept in concurrent programming where only one thread can access a shared resource at a time.
Ensures that only one thread can access a critical section of code at a time
Prevents race conditions and data corruption
Commonly implemented using locks, semaphores, or mutexes
Example: Using a mutex to protect a shared variable in a multi-threaded application
Implementing multithreading involves creating and managing multiple threads to execute tasks concurrently.
Identify the tasks that can be executed concurrently
Create and manage multiple threads to execute these tasks simultaneously
Use synchronization techniques like locks and semaphores to prevent race conditions
Handle communication and coordination between threads
Consider thread safety and resource sharing issues
posted on 20 Dec 2021
I was interviewed in Oct 2021.
Round duration - 90 Minutes
Round difficulty - Medium
The first round was scheduled in the evening time.
First of all interviewer introduced himself and after my introduction
He directly shoot first DSA question. The question was easy but conceptual. I have solved some question with same concept and he ask me to share the screen and code in online compiler. Finally I was able to get correct output with all the use cases and I was like "Half work done!"
Then he asked me very core concepts of JavaScript along with that Some Output based questions.
Then finally he asked me theory questions on React along with my experience in React.
The interviewer was very helpful as well as polite. I don't think if he will not help me during interview I could crack the interview
Ninja is relocating to a place called NinjaGram, and for school admission, he is required to identify if a given sentence is a pangram. Your task is to assist Ninja in determini...
Yes, the sentence is a pangram if it includes every letter of the English alphabet at least once.
Check if the sentence contains all 26 letters of the English alphabet.
Convert the sentence to lowercase to simplify the checking process.
Use a set to keep track of the letters present in the sentence.
Iterate through the sentence and add each unique letter to the set.
After iterating, check if the set contains all 26 letters.
Tip 1 : Code at least a single problem on your favourite coding platform with proper understanding of concept.
Tip 2 : Work on your resume, specifically try to grab some technical achievements(Hackathons, GSoc, etc) along with your degree which can stand out you from other candidates.
Tip 3 : Ask your friend for some mock interviews which can help you to excel in interview.
Tip 1 : Project description should contain maximum keywords mentioned in Job Description. Success Matrix of project will give you an edge in the interview.
Tip 2 : Resume should be one page along with some clickable GitHub and Achievments links if possible.
posted on 19 Mar 2024
I applied via Newspaper Ad and was interviewed in Sep 2023. There were 2 interview rounds.
1. Question regarding Strings and maths .
Design a social media platform for microblogging and sharing short messages.
User profiles with bio, profile picture, and followers/following counts
Ability to post tweets with text, images, and videos
Timeline to view tweets from followed users
Hashtags and mentions for organizing and interacting with content
Like, retweet, and reply functionalities for engagement
posted on 22 Jul 2024
I applied via Approached by Company and was interviewed before Jul 2023. There were 2 interview rounds.
DSA and algorithms linked list, binary tree etc
Problems similar to leet code
Easy mcq from oops and aptitude
Aptitude consited of maths and coding quetions
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Easy level coding test, with basic knowledge of programming
Recursion, and other advance topics
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
There were questions of basic aptitude
Radix sort is a non-comparative sorting algorithm that sorts integers by processing individual digits.
Radix sort works by sorting numbers based on each digit's value, starting from the least significant digit to the most significant digit.
It can be implemented using counting sort or bucket sort as a subroutine.
Radix sort is efficient for sorting integers with a fixed number of digits, like phone numbers or social secur
based on 1 interview
Interview experience
based on 17 reviews
Rating in categories
QA Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Octro
Games2Win
Nazara Technologies
99games Online