i
Nowfloats Technologies
Filter interviews by
I applied via Company Website and was interviewed before Mar 2021. There were 2 interview rounds.
Top trending discussions
I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.
I applied via Job Portal and was interviewed in Nov 2020. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Oct 2020. There was 1 interview round.
I applied via Referral and was interviewed in May 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.
Find sum of k smallest numbers in a BST.
Traverse the BST in-order and add the k smallest numbers to a sum variable.
Use a priority queue to keep track of the k smallest numbers.
If k is greater than the number of nodes in the BST, return the sum of all nodes.
If k is 0, return 0.
Design algorithm and database for seat booking system of BookMyShow and handle failed payments.
Create a database with tables for movies, theaters, seats, bookings, and payments
Use a locking mechanism to prevent double booking of seats
If payment fails, release the locked seats and notify the user
Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;
Code for time stamp in C
Use the time.h header file
Call the time() function to get the current time in seconds
Convert the time to a string using strftime() function
Use the format string to specify the desired format of the time stamp
Rearrange array in consecutive pair multiplication in descending order.
Create a new array to store the multiplied values
Use a loop to iterate through the original array and multiply consecutive pairs
Write a compare function to sort the new array in descending order
Code to rearrange an array in maximum-minimum form.
Sort the array in descending order.
Create a new array and alternate between adding the maximum and minimum values from the sorted array.
Return the new array.
Time complexity: O(nlogn)
Space complexity: O(n)
stoi() function converts a string to an integer.
stoi() is a C++ function that takes a string as input and returns an integer.
It is used to convert a string of digits into an integer.
It can also handle negative numbers and ignore leading whitespace.
Example: int num = stoi("123"); // num is now 123
Code for finding the longest common substring in an array of strings.
Iterate through the first string and check for all possible substrings
Check if the substring is present in all other strings
Keep track of the longest common substring found so far
Return the longest common substring
Answers to common technical questions in a software engineering interview
A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.
A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.
Common Linux commands include ls...
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
Business Development Manager
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Branch Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Sales Consultant
17
salaries
| ₹0 L/yr - ₹0 L/yr |
JustDial
Indiamart Intermesh
Info Edge
Matrimony.com