i
Aptos
Filter interviews by
I applied via campus placement at Vellore Institute of Technology (VIT) and was interviewed in Oct 2024. There were 2 interview rounds.
It included mcqs and multiple coding questions.
Top trending discussions
posted on 16 Nov 2024
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
2-3 basic dsa questions
React Queries are a library for managing server state in React applications.
React Queries provide a way to fetch and cache data from an API in React components.
They offer features like caching, background fetching, and automatic refetching.
React Queries can handle complex data fetching requirements, such as pagination and infinite scrolling.
Yes, useEffect() hook can run twice under certain conditions.
useEffect() hook can run twice if the dependencies array changes between renders.
This can happen if the dependencies array contains values that change frequently.
For example, if a state variable is included in the dependencies array and it is updated in the component, useEffect() will run again.
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
Building small UI screen application in 1 hr for frontend developer
posted on 7 Oct 2024
I applied via Walk-in and was interviewed in Feb 2024. There were 2 interview rounds.
As a recent college graduate, I am actively seeking employment opportunities where I can effectively apply my
skills. Currently pursuing a Bachelor of Engineering in Artificial Intelligence and Machine Learning, I strive to push
my limits to explore new possibilities and acquire additional skills. Aspiring to work in a growth-oriented
environment where I can achieve excellence under existing working conditions, and contribute to the goals of the
organization.
posted on 1 Feb 2024
Array duplicates and burn binary tree
posted on 8 Dec 2022
Core Java , DS and Algo
Shortest path algorithm finds the shortest path between two nodes in a graph.
Dijkstra's algorithm is a popular shortest path algorithm that uses a priority queue to find the shortest path in a weighted graph.
A* algorithm is another popular shortest path algorithm that uses heuristics to guide the search towards the goal node.
Bellman-Ford algorithm is used for finding the shortest path in a graph with negative edge weig
based on 1 interview
Interview experience
Senior Software Engineer
16
salaries
| ₹22 L/yr - ₹39.5 L/yr |
Senior Software Developer
11
salaries
| ₹16 L/yr - ₹39 L/yr |
Senior Professional Services Consultant
7
salaries
| ₹17.5 L/yr - ₹25 L/yr |
Senior Technical Consultant
7
salaries
| ₹12.6 L/yr - ₹21 L/yr |
Senior Business Analyst
6
salaries
| ₹15.3 L/yr - ₹32 L/yr |
Oracle
Blue Yonder
Algonomy
Capgemini