add inverse ai

docs/.vitepress/config.mjs

@@ -24,6 +24,7 @@ export default defineConfig({
           { text: "Bevy Commerce", link: "/bevycommerce" },
           { text: "DSI", link: "/dsi" },
           { text: "Exabyting", link: "/exabyting" },
+          { text: "Inverse AI", link: "/inverseai" },
           { text: "IQVIA", link: "/iqvia" },
           { text: "Priyo", link: "/priyo" },
           { text: "Kite Games Studio", link: "/kite" },
@@ -49,7 +50,6 @@ export default defineConfig({
       {
         items: [{ text: "CSE competitions", link: "/competitions" }],
       },
-      ,
     ],
 
     socialLinks: [

docs/inverseai.md

@@ -0,0 +1,62 @@
+# Inverse.Ai
+
+## Introduction
+[Inverse.Ai](https://inverseai.com/) specializes in app development that primarily focus on video, audio and image manipulation. Their porfolio contains massive hits apps with more than 15M downloads.
+
+## Interview Stages
+There are 3 stages for the interview
+1. **Primary selection:** You can either apply through their website or they can contact you based on your performace in programming contests
+1. **Coding round:** The coding round is online and typically have 10+ questions with varying difficulties
+1. **Technical round:** The technical round can be in their office or through online meeting platform based on the scenario.
+
+> [!TIP]
+> Inverse AI typicaly hire from competitive programmers. If you have a knack for solving complex problems then they can be a good placement for you.
+
+## Questions
+<details>
+<summary>
+You are given a positive integer N. Find the number of triples (X,Y,Z) such that:
+
+- 0 < X,Y,Z < N
+- X + Y + Z = N
+- X ∣∣ Y ∣∣ Z = N, where ∣∣ represents the bitwise OR operation.
+Since the number of triples can be huge, print them modulo 10^9+7.
+</summary>
+<hr>
+
+[**💻 Submit Code**](https://www.codechef.com/problems/AWESUM_OR)
+
+</details>
+
+<details>
+<summary>
+You are given an integer n. A game is played on a square field consisting of n × n cells. Initially all cells are empty. On each turn a player chooses and paint an empty cell that has no common sides with previously painted cells. Adjacent corner of painted cells is allowed. On the next turn another player does the same, then the first one and so on. The player with no cells to paint on his turn loses. Output the player who wins
+</summary>
+<hr>
+
+[**💻 Submit Code**](https://codeforces.com/problemset/problem/630/R)
+</details>
+
+<details>
+<summary>
+You are given a chess board of size (2n)*(2n), some of the color of the board is flipped and the board is broken down in 4 square piece each with size n*n. You can join the 4 pieces in any order without rotating or flipping. As the some of the colors were flipped, so to get a valid chessboard there must need to be some recoloring. Output the minimum number of recoloring such that the 4 pieces can be joined to get a valid chessboard. 
+</summary>
+<hr>
+
+[**💻 Submit Code**](https://codeforces.com/problemset/problem/961/C)
+</details>
+
+<details>
+<summary>
+You have a string of N decimal digits.
+
+Now you are given M queries, each of whom is of following two types.
+
+- Type 1: 1 X Y: Replace A[X] by Y.
+- Type 2: 2 C D: Print the number of sub-strings divisible by 3 of the string denoted by A[C],A[C+1] ... A[D].
+    Formally, you have to print the number of pairs (i,j) such that the string A[i],A[i+1]...A[j], (C ≤ i ≤ j ≤ D), when considered as a decimal number, is divisible by 3
+</summary>
+<hr>
+
+[**💻 Submit Code**](https://www.codechef.com/problems/QSET)
+</details>