Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Jul 2023. There were 5 interview rounds.
There were 4 questions, CoderByte was the platform used.
1st: Hard: Array: Search GFG for "Maximum size rectangle binary sub-array with all 1s"
2nd: Medium: Search: Longest Palindrome Substring
3rd: Easy: String: Search LEET for "Largest Substring between two equal characters." There was one more condition - the substring should have unique characters.
4th: Easy: String: Given a string, of characters, If "M" is encountered, remove "M" and duplicate the last small case letter. If "N" is encountered, remove "N" and discard the next character.
Time complexity to add an element to a Singly Linked List is O(1) if added at the end using Tail pointer, and O(n) if added anywhere in the middle.
Adding an element at the end of a Singly Linked List using the Tail pointer is a constant time operation, hence O(1).
Adding an element anywhere in the middle of a Singly Linked List requires traversing the list to find the insertion point, resulting in a time complexity of O...
NextJs is a framework built on top of ReactJs, providing server-side rendering and other features for easier development.
NextJs is a framework built on top of ReactJs, providing server-side rendering, routing, and other features for easier development.
ReactJs is a JavaScript library for building user interfaces, while NextJs is a framework that adds functionality like server-side rendering and routing to React applicat...
Optimizing JSON involves minimizing redundant data, using efficient data structures, and compressing data when necessary.
Minimize redundant data by using references or IDs instead of repeating the same information multiple times.
Use efficient data structures like arrays or dictionaries to store JSON data in a more organized and accessible way.
Compress JSON data using techniques like gzip or deflate to reduce file size ...
Yes, I prefer commuting to work by train for its reliability and eco-friendliness.
I find commuting by train to be more reliable than other modes of transportation, as it is not affected by traffic congestion.
Taking the train is also more eco-friendly compared to driving a car, as it reduces carbon emissions.
Commuting by train allows me to relax, read, or work during the journey, making it a productive use of time.
Top trending discussions
posted on 15 Jan 2025
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
posted on 20 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 4 interview rounds.
Five coding questions along with technical questions focusing on Object-Oriented Programming (OOP) and the expected output of Java programs.
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Graduated with a degree in Computer Science
Proficient in programming languages such as Java, Python, and C++
Completed internships at tech companies like Google and Microsoft
Enthusiastic about learning new technologies and collaborating with team members
The candidate is asked to solve three common coding problems related to binary trees, strings, and matrices.
To find the height of a binary tree, you can use a recursive function to traverse the tree and calculate the height at each node.
To find the first repeating character in a string, you can use a hashmap to store the frequency of each character and then iterate through the string to find the first character with a ...
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 19 Jun 2024
I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.
posted on 28 Jun 2024
I applied via Approached by Company and was interviewed before Jun 2023. There was 1 interview round.
Normal and simple js dsa question regarding strings and arrays.
posted on 15 Dec 2022
I applied via Approached by Company and was interviewed in Nov 2022. There were 2 interview rounds.
posted on 1 Feb 2023
I was interviewed before Feb 2022.
Some of the top questions asked at the Carwale Full Stack Web Developer interview -
based on 1 interview
Interview experience
Accounts Manager
134
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Regional Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicBricks
Impact Guru
Netmeds.com
Tracxn