i
Apple
Filter interviews by
I applied via Campus Placement
Hackerrank test, it was simple cuz intern
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Online test with a few behavioral questions and games. Nothing difficult.
This round included CSE Core MCQs and 2 coding questions. MCQs where moderated and Coding questions were for Leetcode Medium-Hard difficulty.
I applied via Walk-in and was interviewed in Jul 2024. There were 3 interview rounds.
It contains 35 question
The project is a web application that helps users track their daily water intake and reminds them to stay hydrated.
Users can input their daily water consumption and set goals for themselves.
The application sends notifications to remind users to drink water throughout the day.
Users can view their water intake history and track their progress over time.
Code to identify even numbers
Use the modulo operator (%) to check if a number is divisible by 2
If the remainder is 0, then the number is even
Example: int num = 6; if(num % 2 == 0) { // num is even }
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Strong communication and teamwork skills
Experience with programming languages such as Java, Python, and C++
LinkedList is a data structure where each element is connected to the next element through a pointer.
Each element in a LinkedList is called a node and contains data and a reference to the next node.
LinkedList allows for dynamic size and efficient insertion and deletion of elements.
Example: LinkedList can be used to implement a stack or queue data structure.
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve problems
It involves concepts like inheritance, encapsulation, polymorphism, and abstraction
Example: Inheritance allows a class to inherit properties and behavior from another class
I applied via Campus Placement and was interviewed in Apr 2024. There were 3 interview rounds.
Prepare thoroughly for aptitude...
Code for multiplication operation in programming languages
Use the * operator in most programming languages to perform multiplication
Example: int result = num1 * num2;
Remember to handle overflow cases if working with large numbers
My semester subjects include Computer Science, Mathematics, and Economics.
Computer Science - Programming, Algorithms, Data Structures
Mathematics - Calculus, Linear Algebra, Statistics
Economics - Microeconomics, Macroeconomics, Econometrics
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Experience with programming languages such as Java, Python, and C++
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Strong communication and teamwork skills
3 medium level DSA questions based on Arrays, priority queue and DP
I applied via LinkedIn
The probability of bit error in a binary symmetric channel can be calculated using the formula P = 1/2 * erfc(sqrt(Eb/N0)), where erfc is the complementary error function.
Probability of bit error in a binary symmetric channel is influenced by the signal-to-noise ratio (Eb/N0).
The error function erfc is used to calculate the probability of bit error.
The formula for calculating the probability of bit error is P = 1/2 * e
I applied via campus placement at Indian Institute of Technology (IIT), Kharagpur and was interviewed before Oct 2023. There were 3 interview rounds.
3 questions medium leetcode
Depth First Search (DFS) pseudo code
Initialize a stack to keep track of nodes to visit
Start with the initial node and push it onto the stack
While the stack is not empty, pop a node from the stack and visit its neighbors
Push unvisited neighbors onto the stack
Repeat until all nodes are visited
BFS (Breadth First Search) algorithm pseudo code
Start by enqueueing the starting node
While the queue is not empty, dequeue a node and process it
Enqueue all adjacent nodes that have not been visited yet
Repeat until all nodes have been visited
To find the middle of a linked list, use the slow and fast pointer technique.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.
The position of the slow pointer at this point will be the middle of the linked list.
I applied via Company Website and was interviewed in Apr 2023. There were 3 interview rounds.
based on 3 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
166
salaries
| ₹17 L/yr - ₹61.9 L/yr |
Ipro
113
salaries
| ₹2 L/yr - ₹5.1 L/yr |
Sales Executive
103
salaries
| ₹1.6 L/yr - ₹5 L/yr |
Software Developer
90
salaries
| ₹12.8 L/yr - ₹55.1 L/yr |
Senior Software Engineer
73
salaries
| ₹14.1 L/yr - ₹53.2 L/yr |
Amazon
Microsoft Corporation
Samsung