Make a string combination of K length with repeated characters and mo repeated combinations.
Engineer 1 Interview Questions
3,915 engineer 1 interview questions shared by candidates
How does a hashmap work Design a calendar app What minimum fields are required for a request to a specific web page
What Are You Passionate About?
Why I was interested in working for boostmobile/DISH
Cloud based deployment questions (AWS, Docker, Containers, K8s), Network related (OSI layers), Behavioural (Why Dish and Why this role)
Technical questions: 1. Routing Protocols explanation (Mainly IS-IS and BGP) 2. MPLS 3. Layers of Network 4. Quick overview of Firewalls 5. Troubleshooting BGP issue question 6. Difference between IGP and EGP
What do you know about Micron technologies and the processes we use?
Leetcode based questions only. And 3rd round is of LLD
Given a string str, find the length of the longest substring without repeating characters. For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, with length 6. For “BBBB” the longest substring is “B”, with length 1. In this exercise, you're going to decompress a compressed string. Your input is a compressed string of the format number[string] and the decompressed output form should be the string written number times. For example: The input 3[abc]4[ab]c Would be output as abcabcabcababababc Other rules Number can have more than one digit. For example, 10[a] is allowed, and just means aaaaaaaaaa One repetition can occur inside another. For example, 2[3[a]b] decompresses into aaabaaab
Binary search, sorting etc
Viewing 3691 - 3700 interview questions