Given a string s and multiple queries. Each query consists of a string t. Check if t is a subsequence of s.2025
Kite Games Studio
| Founding year | |
| Company Website | https://www.kitegamesstudio.com/ |
| Career Website | https://www.kitegamesstudio.com/ |
| Technologies Used | Swift, React, Kotline, PyTorch |
Introduction
Kite Games Studio (KGS), founded in 2014, is a leading mobile application development firm in Bangladesh. Based in Mohakhali DOHS, Dhaka, KGS specializes in developing software for both iOS and Android platforms, along with building websites. The company is known for its emphasis on competitive programming skills, making it an excellent choice for talented competitive programmers looking to join a dynamic and innovative team.
Interview Stages
Online Contest: Candidates participate in an online programming contest that typically consists of 5-6 problems to be solved within 3-4 hours. The contest may be hosted on platforms like Toph, Hackerrank, or other online judges. Candidates are shortlisted for the next round based on their ranking in this contest.
Technical Round: This round primarily focuses on coding problems and some basic Java concepts. The interviewers assess the candidate's problem-solving approach and how they think through the problems.
Technical Round Questions
A permutation P is good if P[i] % i == 0 or i % P[i] == 0 for 1 ≤ i ≤ N. Given N ≤ 20, count the number of good permutations.
Design a data structure to add integers and remove the most frequent element, with ties broken by recency.
What are the main concepts of OOP?
Implement the Singleton pattern.
You are given an integer array nums and two integers indexDiff and valueDiff. Find a pair of indices (i, j) such that: i != j, abs(i - j) <= indexDiff and abs(nums[i] - nums[j]) <= valueDiff.2025
Online Round Questions
You're at a buffet with various food items. Each food item has a deliciousness factor and nutrient values. You need to maximize the total deliciousness of the foods you eat. Additionally, for health reasons, each nutrient value must occur in an odd number of food items. 2024
You have a 2D grid representing a village. 'X' denotes farmer-owned land, and '.' denotes government-owned land. Connected 'X' areas belong to the same farmer. If two connected 'X' areas match under any 90° rotation, they also belong to the same farmer. Count the number of unique farmers in the village. 2024
You need to write a program to simulate a Linux terminal on an old computer. You'll be given commands like "mkdir", "ls", "rm", "pwd", and "cd", and you need to simulate their behavior, printing the appropriate output or error messages. 2024
You have a 2D grid representing a field with crop fields and godowns. Harvesters start at godowns and collect crops from fields, bringing them back to their godown. The first harvester must collect from a specific number of fields. You need to calculate the minimum total time for all harvesters to collect all crops. 2024
You have a list of unique strings and an empty list. You'll be given queries to add strings to the empty list, delete strings from it, and count the number of strings between two given strings in the list after sorting it. 2024
Given a number N, find the number of integers between [1,N] that has odd number of divisors. Jr SWE 2025
Given an array of pairs indicating the size and reward of each item. You will be given a minimum and maximum size of the bag. You need to find the maximum reward you can get by filling the bag with items. Jr SWE 2025
Given an array A of size N and some queries. Each query will ask for f(l,r) where the function computes the sum of the greatest common divisors over all prefixes of some range [l,r]. Jr SWE 2025
Given a permutation of size N. You will change the permutation repeatedly. In each operation, you will create a new permutation b such that b[i] = a[a[i]] for all 1 ≤ i ≤ n. Then replace a with b. You need to find the number of operations required to make the permutation sorted or report that it is impossible. Jr SWE 2025
Given a tree with N nodes. You will need to chose an optimal start node s such that the round trip distance from s to some given target nodes is minimized. Jr SWE 2025
Given a grid of size N and M with digit 0 and 1. The grid indicates some patterns which are not connected. The patterns can be rotated or stretched too. You will need to find the patterns present in the grid. Jr SWE 2025