Filter interviews by
The sliding window technique efficiently solves problems involving contiguous subarrays or substrings.
1. Definition: A sliding window is a subarray or substring that moves over the input data to find a solution.
2. Fixed-size window: For problems requiring a fixed number of elements, maintain a window of that size. Example: Find the maximum sum of any 3 consecutive elements in an array.
3. Dynamic-size window: Adjus...
Use recursion to print n natural numbers in C++ without semicolon.
Define a function to print natural numbers recursively.
Call the function inside main function with n as argument.
Base case: if n is less than 1, return.
Print n and call the function with n-1 as argument.
SAP security refers to the measures taken to protect SAP systems and data from unauthorized access and misuse.
SAP security involves setting up user roles and authorizations to control access to sensitive data
It includes implementing encryption, authentication, and audit trails to ensure data integrity
Regular security assessments and updates are necessary to protect against vulnerabilities
Examples of SAP security t...
Implement a key-value structure
Use a hashmap or dictionary data structure to store key-value pairs
Implement methods to add, retrieve, update, and delete key-value pairs
Consider handling collisions and implementing a hashing function
Example: HashMap<String, Integer> keyValueMap = new HashMap<>()
Implementing an LRU Cache involves using a data structure to store key-value pairs with a limit on size, evicting the least recently used.
Use a combination of a hash map and a doubly linked list for efficient access and updates.
The hash map stores keys and pointers to the corresponding nodes in the linked list.
The linked list maintains the order of usage, with the most recently used at the head and least recently ...
The diameter of a tree is the longest path between two nodes in a tree.
The diameter of a tree can be calculated by finding the longest path between two nodes in the tree.
It is not necessarily the path between the root and a leaf node.
The diameter of a tree can be calculated using Depth First Search (DFS) or Breadth First Search (BFS) algorithms.
Find the longest substring in an array of strings.
Iterate through each string and compare with all other strings to find common substrings.
Use a hash table to keep track of the frequency of each substring.
Return the substring with the highest frequency.
Query to find the top five employee salaries
Use the SELECT statement to retrieve the employee salaries
Order the results in descending order using the ORDER BY clause
Limit the results to the top five using the LIMIT clause
Graph is a non-linear data structure with cycles while tree is a hierarchical data structure without cycles.
Graph can have multiple starting points and paths between nodes while tree has only one root node and unique paths between nodes.
Graph can have cycles while tree is acyclic.
Graph can be directed or undirected while tree is always directed.
Examples of graphs include social networks, road networks, and compute...
The for loop will run indefinitely without any condition to terminate it.
The loop will continue executing until it is manually interrupted or the program crashes.
This can lead to a program becoming unresponsive or consuming excessive resources.
It is important to always include a condition in a for loop to control its execution.
Use recursion to print n natural numbers in C++ without semicolon.
Define a function to print natural numbers recursively.
Call the function inside main function with n as argument.
Base case: if n is less than 1, return.
Print n and call the function with n-1 as argument.
Basic DSA and spring boot questions
Implement a key-value structure
Use a hashmap or dictionary data structure to store key-value pairs
Implement methods to add, retrieve, update, and delete key-value pairs
Consider handling collisions and implementing a hashing function
Example: HashMap<String, Integer> keyValueMap = new HashMap<>()
LinkedList add numbers
I applied via Referral and was interviewed in Feb 2024. There were 5 interview rounds.
Coding test in Karat platform - 1 hr duration
Prepare LC - Easy and Medium Questions based on arrays, linked list and graphs.
Questions will be on data structures.
System design of web apps involves planning the architecture, components, and interactions of a web application.
Understand the requirements and constraints of the web app
Identify the key components such as frontend, backend, database, and APIs
Design the architecture considering scalability, performance, security, and maintainability
Choose appropriate technologies and frameworks for each component
Consider factors like l...
Data Structures and Algorithms , OOPS concepts
Top trending discussions
The duration of Walmart Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 28 interview experiences
Difficulty level
Duration
based on 77 reviews
Rating in categories
Bangalore / Bengaluru
7-12 Yrs
Not Disclosed
Software Engineer III
2.2k
salaries
| ₹23.3 L/yr - ₹41 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹34.4 L/yr - ₹60 L/yr |
Software Engineer
941
salaries
| ₹19.1 L/yr - ₹35 L/yr |
Software Developer
467
salaries
| ₹18.8 L/yr - ₹35 L/yr |
Software Development Engineer 3
381
salaries
| ₹24 L/yr - ₹40 L/yr |
Amazon
Reliance Retail
DMart
Reliance Digital