Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      Orbitax

      Questa è la tua azienda?

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Orbitax | Offerte di lavoro di Orbitax | Stipendi di Orbitax | Benefit di Orbitax
      Colloqui di OrbitaxColloqui per Associate Software Engineer presso OrbitaxColloquio di Orbitax


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Colloquio per Associate Software Engineer

      7 set 2024
      Candidato anonimo a colloquio
      Dhâkâ
      Nessuna offerta
      Esperienza negativa
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Orbitax (Dhâkâ) nel mese di set 2024

      Colloquio

      phase -1 : hacker-rank based : hackerrank_url->contests->orbitax-associate-software-engineer-recruitment-2024-phase-1->challenges If you can rank the challenge based on the leadership board, you will be selected! (Good luck) I think this interview process is designed for competitive programmers specially, because only problem solving skill will not help that much, (personal opinion)

      Domande di colloquio [6]

      Domanda 1

      **Days Needed For Becoming Orbitax Engineers** You are the lead Trainer at Orbitax, and you’ve been given the responsibility to mentor a group of n fresh joiners who aspire to become Orbitax Engineers. The onboarding process for each joiner involves two critical phases: a training phase followed by a self-learning phase. The journey for each joiner is unique, as they require different amounts of time for training and self-learning. Here’s how it works: 1. Training Phase: Before a joiner can dive into self-learning, they need to undergo hands-on training from you. You have a packed schedule, so you can only train one joiner per day. Each joiner has a specific number of days they require for training. For example, for a joiner if Training Time is 5, he needs 5 days of your training, but those days don’t have to be consecutive. However, for him all 5 days must be completed before he can move on to self-learning. 2. Self-Learning Phase: Once a joiner completes his training, they move on to self-learning, which takes a fixed number of days for each joiner. During this phase, they study independently and don’t require your direct involvement. For example, for a joiner if Self Learning Time is 4, he needs 4 days of self-learning after completing his training. Your challenge is to create an efficient plan. Since you can train only one joiner a day, you must carefully choose the order in which you train them so that all joiners complete both phases and become Orbitax Engineers as quickly as possible. Determine the minimum number of days required for all joiners to finish both phases (training and self-learning) and officially become Orbitax Engineers. Note: You have the flexibility to decide in what order you train the joiners. Once a joiner completes their training phase, they automatically start their self-learning phase and work on it independently. Input Format The First Line contains a integer : n denotes Total number of new joiners The Second Line contains n integers denotes Training Time needed for the n new joiners The Third Line contains n integers denotes Self Learning Time needed for the n new joiners Constraints 1 <= n <= 105 1 <= trainingTime[i], selfLearningTime[i] <= 104 Output Format A single integer denotes Total Number of days needed For all the new joiners to become Orbitax Engineers Sample Input 0 3 2 5 4 3 4 2 Sample Output 0 14
      Rispondi alla domanda

      Domanda 2

      **Orbitaxian** You are given a string S of length N and an integer K. Your task is to find the total number of subsequences in S that match the pattern P = "orbitaxian", where the difference in position between every consecutive character in the subsequence is no more than K. More formally, let the subsequence of P be represented by an array pos, where (1 ≤ pos[i] ≤ N) and S[pos[i]] = P[i]. Then for each i > 1, the condition pos[i] − pos[i-1] ≤ K must hold. The result should be returned modulo 10^9+7. Input Format The first line of the input contains one integer T — the number of test cases. For each test case: The first line contains two integers N and K — the length of the string S and maximum allowed difference. The second line contains the string S consisting of only lowercase English letters. Constraints (1 ≤ T ≤ 100) (1 ≤ N, K ≤ 200000) It is guaranteed that the sum of N over all test cases does not exceed 2×10^6. Output Format For each test case, print the answer — the total number of valid subsequences modulo 10^9+7. Sample Input 0 5 11 1 orbittaxian 11 2 orbittaxian 20 1 oorrbbiittaaxxiiaann 20 2 oorrbbiittaaxxiiaann 20 6 ossrbbijttaayxiibamn Sample Output 0 0 2 0 11 16
      Rispondi alla domanda

      Domanda 3

      **Count Between Tags** You are given an HTML string. Your task is to determine the number of characters encompassed by each HTML tag in the string. For each tag, count the number of characters that are enclosed between the opening () and closing () tags. A tag is composed of one or more lowercase English letters (a-z). For example: ... , ... It can be followed by digits (0-9) i.e ... The content between the tags can consist of: English characters (a-z, A-Z). Digits (0-9). Punctuation marks: period (.), comma (,), and spaces(' '). Note When a character is encompassed by a same tag multiple times, count only once for that tag. A tag can have 0 characters. In that case don't print that tag. Spaces(' ') between the tags are not counted. It is guaranteed that answer will have at least one tag with non zero count. Input Format A single line of string s. Constraints 1 length of string |s| number of unique tags 25 Output Format For each unique tag, output in each line in the format: tag: count in lexicographical order. Sample Input 0 Hello world. This is an html. random text. Sample Output 0 div: 35 h1: 11 p: 13
      Rispondi alla domanda

      Domanda 4

      **wow Factor** Shamim Ahsan Shaon is currently(2024) working as a Software Architect at Orbitax. He loves to find the “wow” factor. “wow” factor itself has a deeper meaning (You have to join Orbitax if you want to learn about it). Recently another developer of Orbitax named Mozahid found a string consisting of lowercase english letters and told Shaon to find the largest substring of that string which contains exactly x subsequence of "wow". If multiple solutions exist, he has to find the leftmost one. For example , “awswoew” has two subsequence of “wow” {2,5,7} & {4,5,7} Input Format In the first line, given the number of test cases t (1 <= t <= 10). For each test case there will be one line containing a string of lowercase English letters of size n (1 <= n <= 10^5) and an integer x (0 <= x <= 10^12) separated by a space. Constraints 1 <= t <= 10 1 <= n <= 10^5 0 <= x <= 10^12 Output Format For each test case print “-1” if there is no solution. Otherwise the start and end position of the resulting substring (1 based) separated by a space in one line. Sample Input 0 2 wowoowow 1 oowo 1 Sample Output 0 1 5 -1
      Rispondi alla domanda

      Domanda 5

      **Transfer Message** You are given multiple test cases. Each test case consists of a binary string S of length N, where N is divisible by K. The string S is transmitted between two machines. But the message must be transmitted block by block. Each block has a length of K. To determine the start and end of the message, the machines use a special block called the "indicator block" which also has a length of K. This indicator block must not match any substring of length K present in the original message S. Your task is to determine the lexicographically smallest possible indicator block that does not appear as any substring within the string S for each test case. Input Format The first line contains an integer T the number of test cases. For each test case: The first line two integers N and K. Second line contains a binary string S. Constraints 1<=T<=10^5 1<=N<=10^5 1<=K<=200 String S contains only 0 and 1 The sum of the lengths of all strings across all test cases does not exceed 10^5. Output Format For each test case, print the lexicographically smallest indicator block of length K that does not match any substring of length K in the message S. If no indicator block exists print -1. Sample Input 0 2 10 5 1011100111 6 3 001101 Sample Output 0 00000 000
      Rispondi alla domanda

      Domanda 6

      **Rescue the flood victim** Imagine the area as a grid, where each square represents a specific location. Each square has a number indicating how long it takes to fill up with water. Once filled, water flows to its neighboring squares (directly up, down, left, or right) those haven't started filling yet. The water starts from certain border squares where dam gates are opened, and all gates are opened at the same time. image In the example shown, there is a 4x4 grid where the top left corner is labeled as (0,0). The dam gates are opened at the same time at three locations: (0,0), (0,3), and (2,3). For the cell at (2,0), it takes 9 units of time for water to reach there. This means that if there are any people in cell (2,0), they must be rescued within 9 units of time before the water arrives. Input Format The first line contains two integers n and m (1 ≤ n ≤ 1000, 1 ≤ m ≤ 1000) — the number of rows and columns in the grid. In the next n lines, there will be m positive integers. Each integer w indicates how long it takes to fill up with water (1 ≤ w ≤ 10^6). The next line contains one integer b (1 ≤ b ≤ Total number of border cells in the grid) — the number of border squares where there is a dam gate located. In the next each b lines, each contains two integer x and y (0 ≤ x ≤ n-1, 0 ≤ y ≤ m -1) – the coordinate of the border square where a dam gate is located. In the next line, there will be one positive integer t (1 ≤ t ≤ 10^5) indicating the number of queries. The next t lines each contain two integers, q_x and q_y (0 ≤ q_x ≤ n-1 and 0 ≤ q_y ≤ m-1), which represent the coordinates of a square in the grid. For each of these coordinates, you need to calculate how much time it will take for the water to reach that square. Constraints (1 ≤ n ≤ 1000, 1 ≤ m ≤ 1000) (1 ≤ w ≤ 10^6) (1 ≤ b ≤ Total number of border cells in the grid) (0 ≤ x ≤ n-1, 0 ≤ y ≤ m -1) (1 ≤ t ≤ 10^5) (0 ≤ q_x ≤ n-1 and 0 ≤ q_y ≤ m-1) Output Format For each of the t queries you need output one integer which indicates how much time it will take for the water to reach that square. Sample Input 0 4 4 5 6 1 10 4 5 3 2 5 5 5 6 12 3 5 4 3 0 0 0 3 2 3 3 0 0 1 2 2 1 Sample Output 0 0 8 11
      Rispondi alla domanda
      3

      Altre recensioni di colloqui per Associate Software Engineer presso Orbitax

      Colloquio per Associate Software Engineer

      23 set 2024
      Candidato anonimo a colloquio
      Dhâkâ
      Nessuna offerta
      Esperienza neutra
      Colloquio nella media

      Candidatura

      Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Orbitax (Dhâkâ) nel mese di set 2024

      Colloquio

      I applied for a position at Orbitax through LinkedIn. They organized an online contest where I ranked 67th. Unfortunately, there were instances of cheating, so they screened candidates based on CVs, ratings, and participation in various programming contests. Despite this, I was selected for the second round and participated in an onsite programming contest, where I ranked 8th in my group. They formed two groups, each with around 40+ participants. I was then selected for a technical interview, followed by a second technical interview. However, two days after the second interview, I received a rejection email.

      Domande di colloquio [1]

      Domanda 1

      OS, NETWORKING, DBMS, PROJECT, ETC ON COMPUTER SCIENCE.
      Rispondi alla domanda
      1

      Colloquio per Associate Software Engineer

      13 set 2024
      Candidato anonimo a colloquio
      Dhâkâ
      Nessuna offerta
      Esperienza negativa
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Orbitax (Dhâkâ) nel mese di set 2024

      Colloquio

      They took an online programming contest in Hackerrank. Did not go to the next stage. I found the problems to be quite hard. The contest lasted 2 hours. There were about 100 people.

      Domande di colloquio [1]

      Domanda 1

      1. Related to substring. 2. Finding blocks of numbers in binary 3. A 2D matrix problem - given time taken for am index to drown, and location of dam gates, how long would it take for a given index to drown. 4. Parse HTML tag to find characters in between the tags.
      Rispondi alla domanda

      Le migliori aziende per "stipendio e benefit" vicino a te

      avatar
      BMW Group
      4.0★Stipendio e benefit
      avatar
      Sinch
      3.7★Stipendio e benefit
      avatar
      Anton Tech
      3.6★Stipendio e benefit