Filter interviews by
Find the next greater element in an array for each element
Iterate through the array and use a stack to keep track of elements
For each element, pop elements from the stack until finding a greater element
Store the next greater element in a result array
Top trending discussions
I applied via Approached by Company and was interviewed in Mar 2023. There were 2 interview rounds.
I am a software developer with a passion for Python. I have worked on various projects showcasing my skills.
I chose Python because of its simplicity, readability, and vast community support.
Python's extensive libraries and frameworks make it suitable for a wide range of applications.
I have worked on projects like building web applications using Django, data analysis using pandas, and automation scripts using Selenium.
O...
I chose Gaotek because of its reputation in the software development industry.
Gaotek is known for its cutting-edge technology and innovative solutions.
The company has a strong focus on professional growth and learning opportunities.
Gaotek's work culture promotes collaboration and teamwork.
I was impressed by the positive reviews and success stories of Gaotek's previous interns and employees.
Python is a high-level interpreted language while C is a low-level compiled language.
Python is dynamically typed while C is statically typed.
Python has automatic memory management while C requires manual memory management.
Python is easier to learn and write code in while C is more efficient and faster.
Python is used for web development, data analysis, and machine learning while C is used for system programming and embe...
Unpaid internships can provide valuable learning opportunities and networking connections.
Gain practical experience and enhance skills
Build a professional network
Explore different career paths
Gain exposure to real-world projects
Increase chances of future employment
Learn from experienced professionals
Develop a strong work ethic
Demonstrate dedication and commitment
posted on 4 Oct 2023
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Sep 2023. There were 4 interview rounds.
It was aptitude + oops concpets mcqs
This round had 3 dsa questions (tree, linked list, array) and 1 output based answer(bst)
This was another coding round of higher difficulty (linked list, tree)
posted on 22 Feb 2024
I was interviewed before Feb 2023.
Finding the least common ancestor of two nodes in a tree
Use a method like Lowest Common Ancestor (LCA) to find the least common ancestor of two nodes in a tree
Traverse the tree to find the paths from the root to each node, then compare the paths to find the LCA
Consider edge cases like when one node is the ancestor of the other or when one of the nodes is not in the tree
Structure in C++ is a user-defined data type that allows grouping of variables of different data types under a single name.
Structures are used to create complex data types by grouping variables together.
They can contain variables of different data types.
Structures are defined using the 'struct' keyword.
Example: struct Person { string name; int age; };
Example: Person p1;
posted on 16 Sep 2021
I was interviewed in Feb 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
Given a string STR
consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
The idea is to fix a character at a position and then find the permutations for rest of the characters.
Make a list ‘ans’ which will contain the permutations of the given string.
Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index ‘l’ and ends at index ‘r’.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I applied via LinkedIn and was interviewed in Feb 2023. There were 2 interview rounds.
I have worked on various projects including a web application for a retail company and a mobile app for a fitness tracking system.
Developed a web application for a retail company to manage inventory and sales.
Created a mobile app for a fitness tracking system that allows users to track their workouts and set goals.
Contributed to a team project for building a chatbot using natural language processing.
Implemented a data ...
Programming languages differ in syntax, features, and purpose.
Syntax: how code is written and structured
Features: what the language can do and how it does it
Purpose: what the language is best suited for
Examples: Java for enterprise applications, Python for data science, JavaScript for web development
I applied for the Software Development Intern position because I am passionate about coding and want to gain practical experience in software development.
Passionate about coding
Desire to gain practical experience
Interest in software development
Opportunity to learn and grow
Aligns with my career goals
Yes
During a project, I faced a problem with integrating a third-party API.
I resolved the issue by thoroughly analyzing the API documentation and troubleshooting the code.
Another problem I encountered was a performance bottleneck in the application.
To resolve it, I used profiling tools to identify the bottleneck and optimized the code accordingly.
Additionally, I faced a challenge with a database query that was returning...
posted on 18 Oct 2023
I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.
Aptitude test consisted of around 45 MCQs from basic topics like C, C++, OOPS
2nd round had 3 medium level (Leetcode) questions and 1 output question: 1. Level order traversal, 2. count zeros(not sure), 3. Linked List traversal related.
posted on 11 Mar 2022
I was interviewed in Nov 2021.
Round duration - 45 minutes
Round difficulty - Easy
There were around 20 mcq's on Aptitude.
1 Coding Question
Given an array ARR
of size N
, your objective is to determine the sum of the largest and smallest elements within the array.
Can you achie...
First I initialized two variables max and min.
and traverse the array to find max and min.
then return the sum of max and min.
Round duration - 60 minutes
Round difficulty - Easy
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...
Approach:
HashMap is the data structure used to store key-value pairs, where the average retrieval time for get() and insert() operations is constant i.e. O(1).
Hashmap uses the array of Singly Linked List internally.
The array is called the buckets and at every bucket(i-th index of the array) holds a pointer to head of the Singly Linked List.
Every Linked List Node has f...
Tip 1 : Prepare OOPS Concepts
Tip 2 : Build good knowledge in Data Structure and Algorithms.
Tip 3 : Practice SQL queries.
Tip 1 : Do not put false things on resume
Tip 2 : Mention atleast 2 projects.
posted on 16 Sep 2021
I was interviewed in Feb 2021.
Round duration - 70 minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I applied via Approached by Company and was interviewed in Aug 2022. There were 2 interview rounds.
Interview experience
Business Development Executive
27
salaries
| ₹2.2 L/yr - ₹5.5 L/yr |
Software Developer
10
salaries
| ₹8 L/yr - ₹16 L/yr |
Software Development Engineer
10
salaries
| ₹12 L/yr - ₹16 L/yr |
Data Scientist
7
salaries
| ₹6 L/yr - ₹11 L/yr |
Senior Executive
6
salaries
| ₹3.9 L/yr - ₹5 L/yr |
BigBasket
Blinkit
Nature's Basket
Reliance Fresh