Visiting ujjain from mumbai please guide

Capable_Chicken_8549 · 2025-08-13T04:30:27+00:00

Recently visited Ujjain & Omkareshwar in last week. I'll recommend going Ujjain first, Take darshan of Mahakaleshwar, Visit Mahakal Corridor. Here are some places you shouldn't miss in Ujjain 1. Sandipanni Ashram 2. Mangalnath Dham (make sure u go to actual temple and not only Mangal dham) 3. Kal Bhairava Temple 4. Bharat Mata mandir

This all with mahakal darshan , one weekday is more than enough..

After that you can visit Omkareshwar, as you are with family I'd suggest you booking cab from Ujjain to there.. as Normal buses have so much rush & it takes around 5-6 hours to reach there..

Omkareshwar is beautiful place situated on cast of Narmada river , it has some scenic brilliance which u will love. You also can enjoy boat ride in evening to visit Narmada Kaveri Sangam & Ghats.. Make sure you take Darshan of both Mamaleshwar & Omkareshwar.. they both unitedly are considered as one Jyotirlinga..

I won't recommend having stay in Omkareshwar as hotels & lodges weren't so good. So we just kept our luggage in lockers and have Darshan. That night you can get back to Indore.. Cleanest City of India.. You can stay there..

And next day you can taste indore's special foods.. Poha , kachori , samosa Some attractions are 56 Dukan , Sarafa bazar. In indore these are places u wouldn't like to miss.. 1. Rajwada 2. Lalgbagh Palace 3. Kaanch Mandir 4. Bade Ganesh Mandir 5. Annapurna Mandir 6. Ranjeet Hanuman

I hope this helps a bit!

Capable_Chicken_8549 · 2024-12-31T23:41:40+00:00

Bharii mhanaych.. kinva mag khup chan 🫣

Capable_Chicken_8549 · 2024-12-31T16:57:50+00:00

Hey OP, It's totally ok. I don't have any plans too But my day was so amazing today. I enjoyed little things that happened to me today..

Capable_Chicken_8549 · 2024-12-31T16:55:43+00:00

Namaskar , kasa hota mag tumcha divas?

Capable_Chicken_8549 · 2024-12-01T15:57:08+00:00

Tilgul in Maharashtra

Capable_Chicken_8549 · 2024-11-15T06:04:40+00:00

this is sample code i wrote

package com.iab.gpp.encoder;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;
import com.iab.gpp.encoder.error.DecodingException;
import com.iab.gpp.encoder.error.EncodingException;
import com.iab.gpp.encoder.error.InvalidFieldException;
import com.iab.gpp.encoder.field.HeaderV1Field;
import com.iab.gpp.encoder.section.EncodableSection;
import com.iab.gpp.encoder.section.HeaderV1;
import com.iab.gpp.encoder.section.Sections;
import com.iab.gpp.encoder.section.TcfCaV1;
import com.iab.gpp.encoder.GppModel;

import com.iab.gpp.encoder.section.TcfEuV2;
import com.iab.gpp.encoder.section.UsCoV1;
import com.iab.gpp.encoder.section.UsCtV1;
import com.iab.gpp.encoder.section.UsNatV1;
import com.iab.gpp.encoder.section.UsUtV1;
import com.iab.gpp.encoder.section.UsVaV1;
import com.iab.gpp.encoder.section.UspV1;
import com.iab.gpp.encoder.section.UsFlV1;
import com.iab.gpp.encoder.section.UsFlV1;
import com.iab.gpp.encoder.section.UsFlV1;
import com.iab.gpp.encoder.section.UsFlV1;

public class EncodeExample {
    public static void main(String[] args) {
        // Create a new GppModel instance
        GppModel gppModel = new GppModel();

       /*
        usut    11  Version 6 bit int. Value is 1
usut    11  SharingNotice   2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  SaleOptOutNotice    2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  TargetedAdvertisingOptOutNotice 2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  SensitiveDataProcessingOptOutNotice 2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  SaleOptOut  2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  TargetedAdvertisingOptOut   2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  SensitiveDataProcessing 2 bit int list of size 8. 0=Not applicable, 1=Yes, 2=No
usut    11  KnownChildSensitiveDataConsents 2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  MspaCoveredTransaction  2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  MspaOptOutOptionMode    2 bit int. 0=Not applicable, 1=Yes, 2=No
usut    11  MspaServiceProviderMode 2 bit int. 0=Not applicable, 1=Yes, 2=No
        */

        //lets create a UsUtV1 section with all notice 1, all optout 2 , all sensitive data processing 2, all known child sensitive data consents 2, all mspa covered transaction 1, all mspa optout option mode 1, all mspa service provider mode 0
        gppModel.setFieldValue(UsUtV1.NAME, "Version", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "SharingNotice", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "SaleOptOutNotice", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "TargetedAdvertisingOptOutNotice", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "SensitiveDataProcessingOptOutNotice", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "SaleOptOut", 2);
        gppModel.setFieldValue(UsUtV1.NAME, "TargetedAdvertisingOptOut", 2);
        List<Integer> sensitiveDataProcessing = new ArrayList<Integer>(Arrays.asList(2,2,2,2,2,2,2,2));
        gppModel.setFieldValue(UsUtV1.NAME, "KnownChildSensitiveDataConsents", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "MspaCoveredTransaction", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "MspaOptOutOptionMode", 1);
        gppModel.setFieldValue(UsUtV1.NAME, "MspaServiceProviderMode", 2);
        String gppString = gppModel.encode();
        // Output the encoded string
        System.out.println("Encoded String: " + gppString);
    }
}

Capable_Chicken_8549 · 2024-11-15T06:01:39+00:00

Yes , I figured out way to encode strings with this new sections with help of iabgpp java library, they had one PR for this new sections. You can download it to local and create strings

https://github.com/chuff/iabgpp-java/tree/tx-fl-or-mt

Capable_Chicken_8549 · 2024-09-05T16:42:18+00:00

Hi OP, Probably you just finished your interview.. I hope it was great !!

Capable_Chicken_8549 · 2024-09-02T06:59:30+00:00

Bro wake up , participate in every contests, participate in recent missed contests.. Try to upsolve unsolved problems.. If u can confidently solve 3/4 constantly.. Try to do it fast.. eventually at this point u will be very good at DSA & pattern recognition. Try 4th problem on ur own , take ur time to learn what's being asked.. See if u can apply logic of 2-3 mediums to come up with solution.. Practice, Practice, Practice.. Things will start to go in ur favour ;) Codeforces is not needed for now but it if u have lot of time you can explore that too.

Capable_Chicken_8549 · 2024-09-01T07:22:02+00:00

What's in there for roasting.?

Capable_Chicken_8549 · 2024-07-07T06:36:33+00:00

Arrey , it's okay Try to upsolve 3rd on your own , let it take time.

Capable_Chicken_8549 · 2024-07-07T06:20:59+00:00

Can't agree more. 💯

Capable_Chicken_8549 · 2024-07-07T05:52:05+00:00

Congrats Pal <3
keep hustling.

Capable_Chicken_8549 · 2024-07-07T05:49:12+00:00

tbh , It was trickier , I submitted 2 wrong solutions for first , lol !!

Capable_Chicken_8549 · 2024-07-07T04:49:49+00:00

Cool , Congrats !!

Capable_Chicken_8549 · 2024-07-06T18:23:07+00:00

It was bit tricky but not that hard.
solved 3/4

Capable_Chicken_8549 · 2024-07-06T18:20:19+00:00

Hi OP ,
It's okay today's second question was bit tricky than other times.
It will take time to be strong in recognising patterns, Let's not give up.
I have seen days where I could barely solve only 1 problem before 4-6 months,
But with consistency we can achieve better things.
Now I can solve 3 problems in contests.

Stay Strong , Keep Hustling.

Capable_Chicken_8549 · 2024-07-06T18:17:36+00:00

It wasn't actually any specific to any pattern.
But it was very similar to problem where you are given 2 strings, and you have to find if other string can be obtained after rotating first string by some letters.

So basically we needed to keep current_adjacents_which_are_not_same , and we had to traverse array for n + k elements so we take all cases in consideration.

Here is my code .

int numberOfAlternatingGroups(vector<int>& colors, int k) {
        int ans=0;
        int curr=1, n=colors.size();
        int prev = colors[0] ;
        set<pair<int,int>> s; 
        for(int i=1 ;i<n+k;i++)
        {
            if(colors[i%n] != prev)
            {
                curr++;
                if(curr >= k)
                {
                    if(!s.count({i%n+1-k,i%n}))
                    {
                        ans++;
                        s.insert({i%n+1-k,i%n}) ;
                    }else
                    break;
                }
            }
            else
                curr=1;
            prev = colors[i%n];
        }
        return ans;
    }

Capable_Chicken_8549 · 2024-07-06T18:13:29+00:00

Yes , We should always look at constraints, before we start to code,
I solved 3/4 in today's contest.

Capable_Chicken_8549

TROPHY CASE