• 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

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

HackeEarth Flipkart’s Drone

Max Sum in circularly situated Values

Linked List V/S Binary Search Tree

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

LeetCode: Binary Tree Maximum Path Sum

Regular Expression Matching

CodeChef Code SGARDEN

C++ OOPs Part2

Reverse a Linked List in groups of given size

Given a string, find the first character which is non-repetitive

Implement a generic binary search algorithm for Integer Double String etc

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

SAP Off Campus Hiring_ March 2015 Verbal Skills

VMWare Openings

Find the smallest window in a string containing all characters of another string

Code Chef PRGIFT Solution

Find two non repeating elements in an array of repeating elements

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

Leetcode: Edit Distance

The Magic HackerEarth Nirvana solutions Hiring Challenge

How Radix sort works

Leetcode: Merge Intervals

Length of the longest substring without repeating characters

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

Doubly linked list

Maximum sum contiguous subarray of an Array

Print Power Set of a Set

Binary Tree Isomorphic to each other

Get Minimum element in O(1) from input numbers or Stack

Copyright © 2026 · Genesis Framework · WordPress · Log in