Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Technical , hackerrank, logical puzzles
Top trending discussions
I was interviewed in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Hard
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Integer N
Prime numbers printed on separate lines
Generate and print all prime numbers between 2 and N, inclusive.
Iterate from 2 to N and check if each number is prime
A prime number is only divisible by 1 and itself
Print each prime number on a new line
Round duration - 60 Minutes
Round difficulty - Hard
Given two strings 'STR' and 'PTR', identify all starting indices of 'PTR' anagram substrings in 'STR'. Two strings are anagrams if one can be rearranged to form the other.
Implement a function to find all starting indices of anagram substrings of a given string in another string.
Create a frequency map of characters in the 'PTR' string.
Use a sliding window approach to check for anagrams in 'STR'.
Return the starting indices of anagram substrings found.
Example: For input 'BACDGABCD' and 'ABCD', output should be [0, 5].
Round duration - 60 Minutes
Round difficulty - Hard
Common testing questions related to Linux and operating systems
What are the different types of testing that can be performed on a Linux operating system?
How do you test the compatibility of software with different Linux distributions?
Can you explain the process of testing kernel modules in a Linux environment?
What tools and techniques do you use for performance testing on Linux systems?
How do you ensure the security an
Tip 1 : practice coding
Tip 2 : be thorough with your resume
Tip 1 : have good projects
Tip 2 : fulfill the required tech stack
I was interviewed in May 2022.
Round duration - 120 Minutes
Round difficulty - Easy
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...
Calculate total area covered by a list of rectangles on a plane.
Iterate through each rectangle and calculate its area
Check for overlapping areas between rectangles
Sum up the total area covered by all rectangles
Round duration - 60 Minutes
Round difficulty - Medium
Oops concepts and 1 DSA problem
You are provided with a string, termed as DIGIT_PATTERN
, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...
Identify the first repeating digit in a given string of digits.
Iterate through the string and keep track of seen digits using a set.
Return the first digit that repeats, or -1 if no digit repeats.
Time complexity: O(n), where n is the length of the input string.
Round duration - 60 Minutes
Round difficulty - Medium
Firstly Some general questions and then suddenly a cosing question with modifications
Given an input string STR
, generate and print all possible permutations of the string.
str
All permutations of the input string, each on a new line.
Generate and print all possible permutations of a given input string.
Use recursion to generate all permutations by swapping characters in the string.
Maintain a visited array to keep track of characters already used in a particular permutation.
Print each permutation as it is generated.
Handle duplicate characters by skipping swapping if the character is already in the current position.
Tip 1 : You should be perfect in what you know
Tip 2 : Prepare atleast DSA standard questions very well
Tip 3 : Don't ignore OOPs, they are asked very frequently.
Tip 1 : Add good projects
Tip 2 : Must mention all your coding profiles and github where you worked.
I applied via Campus Placement and was interviewed before Feb 2022. There were 4 interview rounds.
2 dsa questions need to be implemented in 1hr
Implemented vector data structure in C++
Used templates to create a generic vector class
Implemented basic vector operations like push, pop, insert, erase
Optimized vector resizing by using exponential growth
Used iterators to traverse the vector elements
Implemented vector algorithms like sort and binary search
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
It started with basic introduction, than move ahead with Java, Spring boot question in the end, he asked one leetcode medium question based on DP . Ques : Find a minimum number of jumps required to reach the end of the array, and each index , it can jump arr[index] time at max, you need to calculate minimum number of steps required to reach at the end.
I was interviewed in Jan 2021.
Round duration - 120 minutes
Round difficulty - Easy
The test had it's webcam on, we were not allowed to go out of the frame.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
The program calculates the Nth Fibonacci number using a recursive formula.
The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.
The program uses a recursive function to calculate the Nth Fibonacci number.
The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
You are provided with an unsorted array/list ARR
of N
integers. Your task is to determine the length of the longest consecutive sequence present in the array...
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
Sort the array to bring consecutive numbers together
Iterate through the sorted array and keep track of the current consecutive sequence length
Update the maximum length if a longer sequence is found
Round duration - 30 minutes
Round difficulty - Medium
The interview was online from home.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
Iterate through the string from the last character to the first character and append each character to a new string.
Alternatively, you can use built-in string reversal functions or methods available in your programming language.
To solve the follow-up question with O(1) space complexity, you can use a tw...
Round duration - 20 minutes
Round difficulty - Easy
This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals .
The interviewer was very understanding and supportive.
Tip 1 : Find a good course, and first clear all your fundamentals and implementation of every data structure. You should be thorough with their time as well as space complexities.
Tip 2 : Upon clearing the fundamentals, select a platform where you have a large no of questions, also whose test cases are good. eg. LeetCode, InterviewBit or Codezen. Go and complete 300-400 questions.
Tip 3 : Also whenever you're not able to solve the problem, check out the editorial and then re-attempt it again. Also, check the discussion if there is some good solution to the same problem.
Tip 4 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 5 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 1 : Resume should contain facts, numbers, and data comparison.
Tip 2 : Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 3 : Technical achievements in the field you're applying to, would be good.
Tip 4 : DO NOT FAKE THINGS, the interviewer is smart enough.
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
Implementing a shuffle function for a playlist of songs
Create a new empty playlist
Randomly select a song from the original playlist and add it to the new playlist
Remove the selected song from the original playlist
Repeat until all songs have been added to the new playlist
Return the new shuffled playlist
Memory leak is a situation where a program fails to release memory it no longer needs.
Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.
Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.
Tools like valgrind can be used to detect memory leaks in C and C++ programs.
Examples of memory leaks include...
Arrays have fixed size and can lead to memory wastage and performance issues.
Arrays have a fixed size and cannot be resized dynamically.
Inserting or deleting elements in an array can be time-consuming.
Arrays can lead to memory wastage if they are not fully utilized.
Arrays can cause performance issues if they are too large and need to be traversed frequently.
Arrays can also be prone to buffer overflow attacks.
Example: A...
Function to hide text on mouse click in JavaScript
Create a function that takes an element as input
Add an event listener to the element for a mouse click
Toggle the element's display property between 'none' and its original value
Find two elements in an unsorted array whose sum is equal to a given number x.
Use a hash table to store the difference between x and each element in the array.
Iterate through the array and check if the current element is in the hash table.
Return the pair of elements that add up to x.
BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.
BST is a tree-like data structure where each node has at most two children.
The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.
BST allows for efficient searching and sorting operations with a time complexity of O(log n).
Examples of a...
Number of possible BSTs with 2 and 3 nodes.
For 2 nodes, only 2 BSTs are possible.
For 3 nodes, 5 BSTs are possible.
Number of BSTs can be calculated using Catalan numbers formula.
Catalan(2) = 2, Catalan(3) = 5.
Answering the question about possible trees with two and three nodes.
For two nodes, there is only one possible tree.
For three nodes, there are three possible trees.
The formula for calculating the number of possible trees with n nodes is (2n-3)!!.
The double exclamation mark represents the double factorial function.
The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).
B+ trees are balanced trees used for indexing and searching large amounts of data.
B+ trees are similar to binary search trees but have multiple keys per node.
They are commonly used in databases and file systems.
B+ trees have a high fanout, reducing the number of disk accesses required for searching.
They are also self-balancing, ensuring efficient performance even with large amounts of data.
Example: In a database, a B+ ...
Yes, I have a few questions.
Can you tell me more about the team I'll be working with?
What is the company culture like?
What are the biggest challenges the team is currently facing?
Can you walk me through the development process for a typical project?
What opportunities are there for professional growth and development?
I prefer hash tables for their constant time lookup and insertion.
Hash tables are efficient for storing and retrieving data.
They have constant time complexity for both insertion and lookup.
They can be implemented using arrays or linked lists.
Examples include Python's dictionary and Java's HashMap.
Yes, we can implement a stack using two queues.
Push operation: Enqueue the element to the first queue.
Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.
Top operation: Same as pop operation but don't dequeue the last element.
Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...
Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.
Sort both arrays in ascending order
Initialize platform count and max count to 1
Loop through both arrays and compare arrival and departure times
If arrival time is less than or equal to departure time, increment platform count
Else, decrement platform count
Update max count if platform count is greater than ma
JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.
JVM is responsible for interpreting the compiled Java code and executing it.
It provides platform independence by converting bytecode into machine-specific code.
JVM has various components like class loader, bytecode verifier, and execution engine.
Compiler converts source code into bytecode, while JVM exec...
I am a software engineer with experience in developing web applications and a passion for learning new technologies.
Experienced in developing web applications using technologies such as Java, Spring, and Angular
Passionate about learning new technologies and keeping up with industry trends
Strong problem-solving skills and ability to work in a team environment
Completed a Bachelor's degree in Computer Science from XYZ Uni
PayTM is an Indian e-commerce payment system and digital wallet company.
PayTM was founded in 2010 by Vijay Shekhar Sharma.
It started as a mobile recharge and bill payment platform.
PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.
It also offers a digital wallet that can be used to pay for various services and products.
PayTM has over 350 million registered users and is ...
I would like to add a feature for splitting bills among friends.
The feature would allow users to split bills for movies, dinners, etc.
Users can select friends from their contact list and split the bill equally or unequally.
The app would send a notification to the selected friends to pay their share.
The feature would make it easier for users to split expenses and avoid awkward conversations.
It would also encourage more
My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.
Improved algorithm for personalized playlists
Better integration with social media platforms
Option to create collaborative playlists with friends
My favourite subject is Computer Science.
I enjoy programming and problem-solving.
I find algorithms and data structures fascinating.
I am interested in artificial intelligence and machine learning.
I like learning about new technologies and keeping up with industry trends.
I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.
NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.
The campus is located in a serene and picturesque location, which provides a conducive environment for learning.
The faculty members are highly experienced and knowledgeable, and are always willing to help students.
The college has state-of-th...
Count the number of continuous sequences with equal number of 0's and 1's in an array.
Iterate through the array and keep track of the count of 0's and 1's encountered so far.
Store the difference between the counts in a hash table and increment the count for that difference.
If the difference is already present in the hash table, add the count to the existing value.
Return the sum of all values in the hash table.
Count the number of palindromic substrings in a given string.
A substring is a contiguous sequence of characters within a string.
A palindrome is a string that reads the same backward as forward.
Use dynamic programming to count all palindromic substrings.
Time complexity can be reduced to O(n^2) using Manacher's algorithm.
Find the longest palindrome in a given string in linear time complexity.
Use Manacher's algorithm to find the longest palindrome in a string in O(n) time complexity.
The algorithm involves preprocessing the string to add special characters to handle even and odd length palindromes.
Then, it uses a combination of dynamic programming and symmetry properties to find the longest palindrome.
For example, in the string 'babad',
The value of pie is a mathematical constant approximately equal to 3.14159.
Pie is the ratio of the circumference of a circle to its diameter.
It is an irrational number, meaning it cannot be expressed as a finite decimal or fraction.
Pie is commonly used in geometry and trigonometry calculations.
The value of pie is often approximated as 3.14 or 22/7.
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MongoDB and MySQL
Familiar with version control systems like Git and deployment tools like Docker
Strong problem-solving skills and ability
Yes, I believe I will be able to fit in the company based on my experience, skills, and values.
I have experience working in diverse teams and adapting to different work cultures.
I share the company's values and vision, which align with my own.
I am eager to learn and contribute to the team, fostering a positive work environment.
I have strong communication skills, which are essential for collaboration and teamwork.
based on 1 interview
Interview experience
Software Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Niramai Health Analytix
Ather Energy
Grey Orange
Freshworks