• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

How strtok() Works

April 13, 2015 by Dhaval Dave

strtok() : Split string into tokens
Syntax :

char * strtok ( char * str, const char * delimiters );

Parameters
str C string to truncate.Notice that this string is modified by being broken into smaller strings (tokens). Alternativelly, a null pointer may be specified, in which case the function continues scanning where a previous successful call to the function ended.

delimiters   C string containing the delimiter characters. These can be different from one call to another.

Example

/* strtok example */
 #include <stdio.h>
 #include <string.h>
int main (){
char str[] ="- This, a sample string.";
char * pch;
printf ("Splitting string \"%s\" into tokens:\n",str);
pch = strtok (str," ,.-");
while (pch != NULL){
printf ("%s\n",pch);
pch = strtok (NULL, " ,.-");
}
return 0;
}

code courtesy : cplusplus.com

Why Function strtok() is not Thread Safe / reentrant

The strtok() function uses a intermediate static buffer while parsing, and reuse them at each call so it’s not thread safe.

Solution :

Use  strtok_r() to use strtok as thread safe

 

Similar Articles

Filed Under: Adobe Interview Questions, problem Tagged With: c, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Skiing on Mountains Matrix

Trie Dictionary

Amazon Interview Experience – SDE Chennai

flattens 2 D linked list to a single sorted link list

How Radix sort works

DFS (Depth First Search)

CodeChef’ RRCOPY

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

VMWare SDEII Interview

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Implement LRU Cache

Closed Parentheses checker

Fibonacci Hashing & Fastest Hashtable

Printing each word reverse in string

Serialise Deserialise N-ary Tree

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Naurki.com Security Breach

Find Percentage of Words matching in Two Strings

Check Binary Tree is Binary Search Tree or not

Microsoft BING Interview Experience

The Magic HackerEarth Nirvana solutions Hiring Challenge

Find and print longest consecutive number sequence in a given sequence in O(n)

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Subset Sum Problem Dynamic programming

Get K Max and Delete K Max in stream of incoming integers

Maximum occurred Smallest integer in n ranges

SAP Off Campus Hiring_ March 2015 Computer Skills

Python String and numbers

Convert number to words java

Copyright © 2025 · Genesis Framework · WordPress · Log in