i
Tracxn
Filter interviews by
I was interviewed in Jul 2024.
2 Graph question of leetcode
I was interviewed before Jul 2023.
Build a sample app server using express.js
Install express.js using npm
Create a new express app
Set up routes and middleware
Start the server to listen on a specific port
I use JDBC (Java Database Connectivity) to establish connection with the database in my project.
Use JDBC API to connect to the database
Load the JDBC driver
Create a connection object
Create a statement object
Execute SQL queries
Multer is a middleware for handling multipart/form-data, used for file uploads in Node.js.
Install multer package using npm: npm install multer
Require multer in your Node.js file: const multer = require('multer')
Set up multer middleware with desired options: const upload = multer({ dest: 'uploads/' })
Use the upload middleware in your route handler to process file uploads
Top trending discussions
Majorily on SQL and Databases
Use CSS to align two images with same width and height on a page
Set both images to have the same width and height using CSS
Use flexbox or grid layout to align the images horizontally or vertically
Adjust margins or padding to fine-tune the alignment
Sorting of an array and aptitude
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Duration 1Hr
2 coding questions
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Basic coding only not to worry much
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Excellent team player with good communication skills
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using React and Node.js
Created a mobile app for tracking fitness goals using Flutter
Implemented RESTful APIs for communication between frontend and backend systems
I was interviewed in Dec 2021.
Round duration - 60 Minutes
Round difficulty - Medium
It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.
Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.
Integer T denoting the nu...
Construct the largest number by concatenating positive integers in the array exactly once.
Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.
Use a custom comparator function to sort the numbers based on their concatenated values.
Join the sorted array elements to form the final largest number.
Given an integer array ARR
of length N
, determine the count of longest increasing subsequences present in the array.
The Longest I...
Count the number of longest increasing subsequences in an integer array.
Identify the longest increasing subsequences in the array
Count the number of such subsequences
Consider the constraints while implementing the solution
Examples: For input [50, 3, 90, 60, 80], the output is 2
Round duration - 60 Minutes
Round difficulty - Medium
First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.
He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.
You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:
Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.
Create a cache data structure with specified size 'N'.
Implement insert and update operations based on the given criteria.
For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.
Handle cases where the cache is full and least frequently used items need to be removed.
Retu...
Given a string S
composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...
Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.
Create a mapping of digits to letters on a T9 keypad
Use recursion to generate all possible combinations of letters for the given phone number
Sort the resulting strings in lexicographical order
You are given an array containing N
words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...
Given an array of words, find the shortest unique prefix for each word.
Create a Trie data structure to efficiently store and search for prefixes.
Traverse the Trie to find the shortest unique prefix for each word.
Return the list of shortest unique prefixes for all words.
Round duration - 60 Minutes
Round difficulty - Hard
In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the maximum sum subarray seen so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Consider the sum of an empty subarray as 0.
Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:
1. get(key) - Return the value associated with the key if ...
Implement a Least Recently Used (LRU) cache data structure with get and put operations.
Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and remove it when the cache reaches its capacity.
Update the position of an item in the cache whenever it is accessed or updated.
Ensure constant time complexity for both get and put operations by u...
Round duration - 40 Minutes
Round difficulty - Easy
The interviewer was very friendly. He asked me about myself and previous interviews.
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
based on 2 interviews
Interview experience
based on 10 reviews
Rating in categories
Information Executive
269
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
132
salaries
| ₹0 L/yr - ₹0 L/yr |
Research Analyst
120
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Vice President
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Sequoia Capital
Matrix Partners
Kalaari Capital
Nexus Venture Partners