Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by ConveGenius Team. If you also belong to the team, you can get access from here

ConveGenius Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

ConveGenius Node JS Developer Interview Questions and Answers

Updated 8 Feb 2024

ConveGenius Node JS Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
-

I applied via Referral and was interviewed in Aug 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. There are 2 coding questions which are 3 sum and a dp.
  • Q2. They asked 2 SQL questions based on joins.

Interview Preparation Tips

Interview preparation tips for other job seekers - 3 rounds 2 technical and 1 hr. The first round is of 1 hr round they asked me some basic questions initially, then gave 2 coding questions 1 dp and 3 sums, and then two SQL questions based on joins. The second round is with the CTO it is a system design round where they asked some basic questions, SQL and LLD.

Interview questions from similar companies

I appeared for an interview in Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question 
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from 
scratch) 

It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.

  • Q1. 

    Selling Stock Problem Statement

    You are given the stock prices for N days. Each day i signifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin...

  • Ans. 

    Calculate maximum profit by buying and selling stocks on different days.

    • Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.

    • Keep track of the total profit earned by summing up the differences between buying and selling prices.

    • Return the total profit as the maximum profit that can be earned.

  • Answered by AI
  • Q2. 

    Minimum Time to Burn a Binary Tree from a Leaf Node

    You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...

  • Ans. 

    The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.

    • Traverse the tree from the given start node to calculate the time taken to burn the entire tree.

    • Use a queue to keep track of nodes and their burning time.

    • Increment the burning time for each level of nodes until the entire tree is burned.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 75-80 minutes
Round difficulty - Hard

This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.

  • Q1. 

    Matrix Maximum Path Sum Problem

    Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...

Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence 
the interviewer mostly asked me questions about my interests in technical field and the project that I have done

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Punjab Engineering College(Deemed To be University). Eligibility criteriaCGPA above 6 and no backlogs (there was no branch criteria for eligibility)Phone Pe interview preparation:Topics to prepare for the interview - 1. C++ basic Coding + Data structures knowledge (learned during the two years of college Courses + Coding Ninjas course of C++ introduction and C++ data structures) 2. OOPs + Pointers (best and complete material for interviews is available at Geeks for geeks) 3. Dynamic programming and Recursion best explained in (Coding Ninjas course) + (Youtube channel of Aditya Verma if you want free material ) 4. Graphs , Hashmaps and Priority Queues (again I found Coding Ninjas course to be super amazing) 5. Operating system + DBMS(theory part) (I found best material of Gate smashers (youtube channel)) 6. Networking (just required for very few companies) (I liked TutorialsPoint tutorials a lot (very concise and to the point ))Time required to prepare for the interview - 1+2 months (rigorous practicing)Interview preparation tips for other job seekers

Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation) 
Tip 4: Atleast read the round 1 (Coding round) Archives from (Geeks for geeks or Glassdoor). To get your mind prepared for the types of questions that company usually asks.(Coding round is the toughest Step in the whole Process to clear)

Application resume tips for other job seekers

Tip 1: Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2: You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so 
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might 
cause you pain during interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

  • Q1. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.

    ...

  • Ans. 

    The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

    • Iterate through the array and calculate the sum of each subarray of length K

    • Store the maximum sum obtained from the first subarray

    • Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

    • Store the maximum sum obtained from the second subarray

    • Return the sum of the two maximum

  • Answered by AI
  • Q2. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    The task is to find the count of distinct subsequences in a given string.

    • Use dynamic programming to solve the problem.

    • Create a 2D array to store the count of distinct subsequences for each prefix of the string.

    • Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

    • For each character in the string, calculate the count of distinct subsequences by considering two cases: including...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...

  • Ans. 

    The task is to find the intersection of two integer arrays/lists.

    • Read the number of test cases

    • For each test case, read the size and elements of the first array/list

    • Read the size and elements of the second array/list

    • Find the intersection of the two arrays/lists

    • Print the intersection elements in the order they appear in the first array/list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

  • Q1. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    The task is to find the number of islands in a grid consisting of 0s and 1s.

    • An island is a group of 1s connected horizontally, vertically, or diagonally

    • The grid is surrounded by 0s on all four edges

    • Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

    • Initialize a visited array to keep track of visited cells

    • For each unvisited cell with a value of 1, p...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].

    Input:

    The input start...
  • Ans. 

    The goal is to find the number of permutations of a list satisfying certain conditions.

    • Iterate through all permutations of the list

    • Check if each permutation satisfies the given conditions

    • Count the number of permutations that satisfy the conditions

    • Return the count for each test case

  • Answered by AI
  • Q3. 

    Idempotent Matrix Verification

    Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:

    M * M = M

    Input:

    The first line cont...
  • Ans. 

    An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

    • Check if the given matrix satisfies the property M*M = M

    • Iterate through each element of the matrix and perform the matrix multiplication

    • Compare the result with the original matrix

    • If they are equal, return true; otherwise, return false

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

  • Q1. Can you design an attendance management system?
  • Ans. 

    Design attendance management system

    • Create a database to store employee information

    • Implement a user interface for employees to mark their attendance

    • Develop a system to track and record attendance data

    • Generate reports and analytics based on attendance data

  • Answered by AI
Round 4 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.

Round 2 - Technical 

(2 Questions)

  • Q1. Question related to system design were asked.
  • Q2. He asked me to design some functions of facebook.
Round 3 - HR 

(1 Question)

  • Q1. Introduction type questions were asked. In this it will prefer only CS students

Software Developer Interview Questions & Answers

NoBroker user image Shreeta Jayakar Shetty

posted on 26 Sep 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Introduce yourself
  • Ans. 

    I am a software developer with 5 years of experience in Java and Python. I have a passion for problem-solving and creating innovative solutions.

    • 5 years of experience in Java and Python

    • Passionate about problem-solving

    • Innovative solutions driven

  • Answered by AI
  • Q2. Were u see after 5 years
  • Ans. 

    In 5 years, I see myself as a senior software developer leading a team and working on cutting-edge technologies.

    • Leading a team of developers on innovative projects

    • Working with cutting-edge technologies like AI and blockchain

    • Continuing to learn and grow in my career

    • Possibly pursuing further education or certifications

    • Contributing to open source projects

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic JavaScript Interview

Round 2 - Technical 

(2 Questions)

  • Q1. What is closure
  • Ans. 

    Closure is a function that has access to its own scope, as well as the outer scope in which it was defined.

    • Closure allows a function to access variables from its outer scope even after the outer function has finished executing.

    • It is created whenever a function is defined within another function.

    • Closure is commonly used in JavaScript for maintaining state in asynchronous operations.

  • Answered by AI
  • Q2. What are promise
  • Ans. 

    Promises are objects representing the eventual completion or failure of an asynchronous operation.

    • Promises are used to handle asynchronous operations in JavaScript.

    • They can be in one of three states: pending, fulfilled, or rejected.

    • Promises can be chained together using .then() method.

    • They help avoid callback hell and make code more readable.

    • Example: Fetching data from an API returns a promise that resolves with the da

  • Answered by AI

I appeared for an interview in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Medium

Timing was 3PM to 5 PM
There were 4 coding questions based on Dynamic Programming , Graphs, Mathematical analysis , Trie data structure.

  • Q1. 

    Weighted Job Scheduling Problem Statement

    You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...

  • Ans. 

    The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with start time, end time, and profit given.

    • Sort the jobs based on their end times in ascending order.

    • Initialize an array 'dp' to store the maximum profit that can be earned by scheduling jobs up to that index.

    • For each job, find the maximum profit by either including or excluding the current job based on non-overlapping co...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

The interviewer was very soft spoken and helpful. There were in total 3 questions of easy-medium difficulty based on DP, Graphs and Sorting . It was around 11 AM timing.

  • Q1. 

    Knight Probability in Chessboard

    Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...

  • Ans. 

    Calculate the probability that a knight remains on an N x N chessboard after making K moves.

    • Use dynamic programming to calculate the probability of the knight staying on the board after each move.

    • Consider all possible moves the knight can make from its current position.

    • Keep track of the probabilities at each position on the board after each move.

    • Normalize the probabilities at the end to get the final result.

    • Example: Fo...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The round had 1 DS and Algo problem and 1 system Design question based on building any management portal.

  • Q1. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

    • Create a mapping of each cell to its corresponding destination cell if it contains a snake or ladder.

    • Keep track of visited cells to avoid revisiting them during the traversal.

    • Consider the constraints and handle cases where t...

  • Answered by AI
Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It was more of Hiring Manager round where he asked about my skills , my projects and how could i be valuable to firm. It was quit easy going round

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Indian Institute of Information Technology Allahabad. I applied for the job as SDE - 1 in PuneEligibility criteriaAbove 7 CGPAPhone Pe interview preparation:Topics to prepare for the interview - Data Structures, System Design, Algorithms, Operating Systems, Database Management Systems, OOPs, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Always focus on the basics of the Data Structures
Tip 2 : Practice System Design very well
Tip 3 : Take Practice Contests on weekly basis for time constraints

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects with thorough knowledge 
Tip 2 : Keep the Resume one page only with no false information

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Jun 2022.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Best Time To Buy and Sell Stock Problem Statement

    You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...

  • Ans. 

    Determine the maximum profit achievable with at most K transactions by buying and selling stocks.

    • Iterate through the array and keep track of the minimum price to buy and maximum profit to sell.

    • Use dynamic programming to calculate the maximum profit with at most K transactions.

    • Consider edge cases like when K is 0 or when the array is empty.

    • Example: For input N = 6, PRICES = [3, 2, 6, 5, 0, 3], K = 2, the output should b

  • Answered by AI
  • Q2. 

    Maximum Sum Rectangle Problem Statement

    Given a matrix ARR with dimensions N x M, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.

    Input:

    The first line...
  • Ans. 

    Find the rectangle with the maximum sum of elements in a given matrix.

    • Iterate through all possible rectangles in the matrix and calculate the sum of each rectangle.

    • Keep track of the maximum sum encountered so far.

    • Optimize the solution by using Kadane's algorithm for 1D array to find maximum sum subarray in each row.

  • Answered by AI
  • Q3. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

    • Keep track of visited cells and the number of dice throws required to reach each cell.

    • Consider the presence of snakes and ladders while calculating the next possible moves.

    • Return the minimum number of dice throws to reach th

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 70 Minutes
Round difficulty - Medium

  • Q1. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q2. 

    Longest Increasing Path in a 2D Matrix Problem Statement

    Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...

  • Ans. 

    Find the length of the longest increasing path in a 2D matrix by moving in four directions from each cell.

    • Use dynamic programming to keep track of the length of the longest increasing path starting from each cell.

    • Explore all four directions from each cell and recursively find the longest increasing path.

    • Optimize the solution by storing the length of the longest increasing path starting from each cell to avoid redundant

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

  • Q1. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
  • Ans. 

    Given a rotated sorted array, find the index of a given integer 'K'.

    • Use binary search to find the pivot point where the array is rotated.

    • Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.

    • Handle cases where 'K' is not present in the array by returning -1.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaPhone Pe interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, Web Development, Operating Systems, Database Management System, Automata theory.Time required to prepare for the interview - 7 monthsInterview preparation tips for other job seekers

Tip 1 : Practice as many questions as possible from any of the good coding platform.
Tip 2 : Core CS fundamentals should be strong and can't be neglected before interview.
Tip 3 : Some hands-on dev projects are really good to have as companies nowadays(mostly startups) look some good hands-on experience even in freshers.

Application resume tips for other job seekers

Tip 1 : Should be single page, to the point and precise resume.
Tip 2 : Only put truth on the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected
Round 1 - Coding Test 

It was a coding test with 3 medium-hard questions

Round 2 - One-on-one 

(5 Questions)

  • Q1. Coding interview
  • Q2. Some question of graph
  • Q3. Some question of string
  • Q4. Some graph qquestion
  • Q5. Somerandom question

Interview Preparation Tips

Interview preparation tips for other job seekers - be prepared
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Coding Test 

There were 2 questions.
1. Knapsack
2. Median in an array

Round 2 - One-on-one 

(1 Question)

  • Q1. LLD(machine coding) of Google meet
Round 3 - One-on-one 

(1 Question)

  • Q1. In depth discussion on my projects and resume

ConveGenius Interview FAQs

How many rounds are there in ConveGenius Node JS Developer interview?
ConveGenius interview process usually has 1 rounds. The most common rounds in the ConveGenius interview process are Technical.
How to prepare for ConveGenius Node JS Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at ConveGenius. The most common topics and skills that interviewers at ConveGenius expect are MongoDB, Javascript, Backend, DBMS and Debugging.
What are the top questions asked in ConveGenius Node JS Developer interview?

Some of the top questions asked at the ConveGenius Node JS Developer interview -

  1. There are 2 coding questions which are 3 sum and a ...read more
  2. They asked 2 SQL questions based on joi...read more

Tell us how to improve this page.

ConveGenius Node JS Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 434 Interviews
Planet Spark Interview Questions
3.7
 • 366 Interviews
CARS24 Interview Questions
3.5
 • 336 Interviews
Udaan Interview Questions
3.9
 • 334 Interviews
Meesho Interview Questions
3.7
 • 332 Interviews
PhonePe Interview Questions
4.0
 • 305 Interviews
Whitehat jr Interview Questions
3.4
 • 262 Interviews
ElasticRun Interview Questions
3.5
 • 252 Interviews
NoBroker Interview Questions
3.2
 • 235 Interviews
View all
Software Engineer
7 salaries
unlock blur

₹12 L/yr - ₹18 L/yr

Program Manager
7 salaries
unlock blur

₹8 L/yr - ₹11.2 L/yr

Data Analyst
7 salaries
unlock blur

₹5.5 L/yr - ₹9 L/yr

Associate Product Manager
6 salaries
unlock blur

₹9 L/yr - ₹11.5 L/yr

Manager
5 salaries
unlock blur

₹13.1 L/yr - ₹25 L/yr

Explore more salaries
Compare ConveGenius with

Udaan

3.9
Compare

Swiggy

3.8
Compare

CARS24

3.5
Compare

Oyo Rooms

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview