given an array of positive numbers and a target number, print all the subarrays that have sum equal to target sum.
Development Engineer Interview Questions
37,151 development engineer interview questions shared by candidates
Find maximum sum subsequence of an array without choosing consecutive elements.
Rotate array. He asked to propose any solution first, and then optimise it.
Round 1: DS & Algo 1. Serialize and Deserialse Tree 2. Rat Maze problem (Backtracking) Round 2: Design Design Redis (LRU policy), Design should take care of multi-threading Round 3: Design Design Distribute Global Lock Round 4: Technical Manager - about work - Design a analytics platform that collect logs from multiple systems and provide insight from that
They took online test of 2 hrs long.
Can be found on Leetcode.
Implement a function that calculates the Kevin Bacon number of a given actor.
They ask about the connection of relay to mcu
Is website live on cloud or not?
Basics of c, c++ with oops concepts and DSA
Viewing 2241 - 2250 interview questions