Akamai SDE 2 interview experience
Summary
Interview experience for Akamai SDE 2 position involving two rounds of technical interviews with coding problems and project discussion.
Full Experience
I have applied via referral and got a call after 15+ days and Hr scheduled the interview on the same friday.
Round 1
- Group anagram https://leetcode.com/problems/group-anagrams/description/
- Kth Largest element in an array https://leetcode.com/problems/kth-largest-element-in-an-array/description/
- Number of Subsequences That Satisfy the Given Sum Condition https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/description/
- Few questions about my projects
Round 2
- Modified version of -> Minimum Number of Steps to Make Two Strings Anagram https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/description/
- Modified version of Max Consecutive Ones https://leetcode.com/problems/max-consecutive-ones/description/
Solved all the questions
Both the rounds happened on the same day
waiting for the HR call !! Wish me luck :)
Interview Questions (5)
Group Anagrams
Given an array of strings strs, group the anagrams together. You can return the answer in any order.
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Kth Largest Element in an Array
Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Can you solve it without sorting?
Number of Subsequences That Satisfy the Given Sum Condition
You are given an array of integers nums and an integer target.
Return the number of non-empty subsequences of nums such that the sum of the minimum and maximum element on it is less than or equal to target. Since the answer may be too large, return it modulo 109 + 7.
Minimum Number of Steps to Make Two Strings Anagram
You are given two strings of the same length s and t. In one step you can choose any character of t and replace it with another character.
Return the minimum number of steps to make t an anagram of s.
An Anagram of a string is a string that contains the same characters with a different (or the same) ordering.
Max Consecutive Ones
Given a binary array nums, return the maximum number of consecutive 1's in the array.