Mission: Our mission is to create a world where companies are loved by customers and employees. Over a thousand of the world"s leading brands trust Medallia Experience Cloud, a software-as-a-service (SaaS) platform, to win through customer experience.
What is the difference in CSS between visibility:hidden and display?
What kind of data is sent in HTTP POST/GET requests?
Implement a data structure which can implement add, delete, and random delete in O(1) time complexity.
Sort a string array in O(n) time complexity.
Find the largest subtree that has the same elements in the left and the right subtree.
How do you code a hash map? How do you deal with collisions on a node?
Implement a function to check if a string is a palindrome or not.
Given a cost function and a budget, find the maximum quantity you can buy.
Given a string of size N and a number K, find the greatest substring with K different characters.
Explain and develop an algorithm for a boolean array to decide whether or not a point is inside a closed geometric figure.
Given a string s (1<=s.length()<=1000), return the shortest substring that is only occurring once.
Example: s="aabbabbaab" gives either "bab" or "baa" s="aaaa" gives "aaaa".
Summing up the individual digits for each number from 0 to k (0<=k<=10000000), return how many times the most common sum occurs.
Example: k=10 gives 2 (since 1 and 10 both sum up to 1)
k=50 gives 6 (since 5, 14, 23, 32, 41, 50 all sum up to 5)
k=7777 gives 555.
Given an integer k (1<=k<=2000000000), find 2 prime numbers that sum up to it and return the lower number. If there are multiple solutions, always return the lowest prime. If there are no solutions, return -1.
Example: k=12 gives 5 (5 + 7 = 12)
k=68 gives 7 (7 + 61 = 68)
k=77 gives -1.
Write a method the gets a string as input and prints it backwards.
Given the digits 1 through k (1<=k<=9), return the list of all numbers where each digit occurs at most once.
Most efficient way to sort 1000 arrays of 1000 items into one huge array.
Stage 1: Phone screen with recruiter
Stage 2: Coding challenge
Stage 3: Technical phone interview
Stage 4: Onsite interview
Pathrise is a career accelerator that helps people land their dream jobs. We regularly place our fellows at top companies like Apple, Amazon, and Meta. Our mentors have experience at companies like Apple, giving fellows the inside scoop on interview and company culture in 1-on-1 sessions.
We can’t guarantee you a job at a specific company like Apple. But we do guarantee you a great job–if you don’t accept an offer in 1 year, you pay nothing. Our income share agreement means you only pay with a percentage of your income at your new role.
Mentors work with fellows at every stage in search, helping them build the skills necessary to be the best candidate possible. Fellows in Pathrise usually see a 2-4x increase in application response rates, 1.5-3x increase in interview scores, and 10-20% increase in salary through negotiation.